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.r158-smll-171636266300154.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 EisenbergMcGuire-PT-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 255K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716510326784

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 00:25:29] [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-24 00:25:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:25:29] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-05-24 00:25:29] [INFO ] Transformed 196 places.
[2024-05-24 00:25:29] [INFO ] Transformed 448 transitions.
[2024-05-24 00:25:29] [INFO ] Found NUPN structural information;
[2024-05-24 00:25:30] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 64 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 189 transition count 420
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 189 transition count 420
Applied a total of 14 rules in 88 ms. Remains 189 /196 variables (removed 7) and now considering 420/448 (removed 28) transitions.
[2024-05-24 00:25:30] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
// Phase 1: matrix 256 rows 189 cols
[2024-05-24 00:25:30] [INFO ] Computed 13 invariants in 40 ms
[2024-05-24 00:25:30] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-24 00:25:30] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
[2024-05-24 00:25:30] [INFO ] Invariant cache hit.
[2024-05-24 00:25:31] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-24 00:25:31] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-24 00:25:31] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
[2024-05-24 00:25:31] [INFO ] Invariant cache hit.
[2024-05-24 00:25:31] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 28 ms to minimize.
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 4 ms to minimize.
[2024-05-24 00:25:36] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 4 ms to minimize.
[2024-05-24 00:25:36] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:25:36] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:25:36] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 3 ms to minimize.
[2024-05-24 00:25:37] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 4 ms to minimize.
[2024-05-24 00:25:37] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 4 ms to minimize.
[2024-05-24 00:25:37] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:25:37] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:25:37] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:25:37] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:25:37] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 3 ms to minimize.
[2024-05-24 00:25:38] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:25:38] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:25:38] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 3 ms to minimize.
[2024-05-24 00:25:38] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 3 ms to minimize.
[2024-05-24 00:25:38] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:25:38] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:25:39] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:25:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-24 00:25:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 00:25:39] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:25:40] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 3 ms to minimize.
[2024-05-24 00:25:40] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:25:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 00:25:40] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:25:40] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 4 ms to minimize.
[2024-05-24 00:25:40] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 3 ms to minimize.
[2024-05-24 00:25:40] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:25:41] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:25:41] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:25:41] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:25:41] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 3 ms to minimize.
[2024-05-24 00:25:41] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 6 ms to minimize.
[2024-05-24 00:25:42] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:25:42] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:25:42] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-24 00:25:43] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 3 ms to minimize.
[2024-05-24 00:25:44] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:25:47] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:25:50] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:25:51] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 4 ms to minimize.
[2024-05-24 00:25:51] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:25:53] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-05-24 00:25:54] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:25:54] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 3 ms to minimize.
[2024-05-24 00:25:54] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 3 ms to minimize.
[2024-05-24 00:25:55] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:25:55] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:25:57] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 3 ms to minimize.
[2024-05-24 00:25:57] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:25:58] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:25:58] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:25:59] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/445 variables, and 68 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/189 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:26:07] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:26:08] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:26:09] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:26:12] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:26:16] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:26:16] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 3 ms to minimize.
[2024-05-24 00:26:17] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 3 ms to minimize.
[2024-05-24 00:26:17] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 3 ms to minimize.
[2024-05-24 00:26:17] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:26:22] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:26:24] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 4 ms to minimize.
[2024-05-24 00:26:24] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:26:25] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:26:25] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:26:25] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:26:25] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:26:26] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-24 00:26:31] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-24 00:26:31] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:26:31] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:26:31] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/445 variables, and 89 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/189 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 76/76 constraints]
After SMT, in 60547ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60598ms
Starting structural reductions in LTL mode, iteration 1 : 189/196 places, 420/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62104 ms. Remains : 189/196 places, 420/448 transitions.
Support contains 64 out of 189 places after structural reductions.
[2024-05-24 00:26:32] [INFO ] Flatten gal took : 112 ms
[2024-05-24 00:26:32] [INFO ] Flatten gal took : 61 ms
[2024-05-24 00:26:32] [INFO ] Input system was already deterministic with 420 transitions.
RANDOM walk for 40000 steps (8 resets) in 2429 ms. (16 steps per ms) remains 35/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
[2024-05-24 00:26:34] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
[2024-05-24 00:26:34] [INFO ] Invariant cache hit.
[2024-05-24 00:26:34] [INFO ] State equation strengthened by 91 read => feed constraints.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 145/189 variables, 8/9 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-05-24 00:26:34] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2024-05-24 00:26:34] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:26:34] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 3 ms to minimize.
Problem AtomicPropp20 is UNSAT
[2024-05-24 00:26:35] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-05-24 00:26:35] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 3 ms to minimize.
[2024-05-24 00:26:35] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 3 ms to minimize.
[2024-05-24 00:26:35] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:26:35] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2024-05-24 00:26:36] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:26:36] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:26:36] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 11/24 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-24 00:26:36] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:26:36] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:26:36] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 3/27 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-24 00:26:37] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:26:37] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 2/29 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-24 00:26:37] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:26:37] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 3 ms to minimize.
[2024-05-24 00:26:38] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:26:38] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 3 ms to minimize.
[2024-05-24 00:26:38] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:26:38] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 6/35 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-24 00:26:38] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:26:39] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 2 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/445 variables, and 37 constraints, problems are : Problem set: 2 solved, 30 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/189 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 2 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 149/189 variables, 8/9 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 24/37 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-24 00:26:39] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 4 ms to minimize.
[2024-05-24 00:26:39] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-24 00:26:40] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:26:40] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 4 ms to minimize.
[2024-05-24 00:26:40] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 4 ms to minimize.
[2024-05-24 00:26:40] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 3 ms to minimize.
[2024-05-24 00:26:40] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 3 ms to minimize.
[2024-05-24 00:26:41] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-05-24 00:26:41] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 4 ms to minimize.
[2024-05-24 00:26:41] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:26:41] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-24 00:26:41] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 2 ms to minimize.
[2024-05-24 00:26:41] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 13/50 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-24 00:26:42] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:26:42] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:26:42] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 3/53 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 256/445 variables, 189/242 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 91/333 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 30/363 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-24 00:26:44] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:26:44] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 10115ms, After SMT, problems are : Problem set: 2 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 189 transition count 418
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 187 transition count 418
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 4 place count 187 transition count 373
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 94 place count 142 transition count 373
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 138 transition count 357
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 138 transition count 357
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 126 place count 126 transition count 345
Applied a total of 126 rules in 93 ms. Remains 126 /189 variables (removed 63) and now considering 345/420 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 126/189 places, 345/420 transitions.
RANDOM walk for 40000 steps (8 resets) in 727 ms. (54 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
[2024-05-24 00:26:44] [INFO ] Flow matrix only has 181 transitions (discarded 164 similar events)
// Phase 1: matrix 181 rows 126 cols
[2024-05-24 00:26:44] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 00:26:44] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 89/125 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:45] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:26:45] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:26:45] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:26:45] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:26:45] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:26:45] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:26:45] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 3 ms to minimize.
[2024-05-24 00:26:46] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:46] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:26:46] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:46] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:26:46] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:26:46] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2024-05-24 00:26:47] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:26:47] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
[2024-05-24 00:26:47] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:26:47] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:26:47] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:26:47] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 00:26:47] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:26:47] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:26:48] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:26:48] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-05-24 00:26:48] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:26:48] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:48] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-24 00:26:48] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 181/307 variables, 126/166 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 79/245 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:49] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:26:49] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-24 00:26:49] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:26:49] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:26:49] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:26:49] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 0/307 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 251 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5754 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 126/126 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 89/125 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:50] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:26:51] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:51] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:26:51] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 181/307 variables, 126/176 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 79/255 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 26/281 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:52] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:26:52] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:53] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 00:26:53] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-24 00:26:53] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (OVERLAPS) 0/307 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 286 constraints, problems are : Problem set: 0 solved, 26 unsolved in 4996 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 126/126 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 42/42 constraints]
After SMT, in 10790ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 4 properties in 3032 ms.
Support contains 34 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 345/345 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 126 transition count 341
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 122 transition count 341
Applied a total of 8 rules in 23 ms. Remains 122 /126 variables (removed 4) and now considering 341/345 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 122/126 places, 341/345 transitions.
RANDOM walk for 40000 steps (8 resets) in 331 ms. (120 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 283705 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :15 out of 22
Probabilistic random walk after 283705 steps, saw 59559 distinct states, run finished after 3007 ms. (steps per millisecond=94 ) properties seen :15
[2024-05-24 00:27:02] [INFO ] Flow matrix only has 177 transitions (discarded 164 similar events)
// Phase 1: matrix 177 rows 122 cols
[2024-05-24 00:27:02] [INFO ] Computed 13 invariants in 4 ms
[2024-05-24 00:27:02] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 71/86 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 5/91 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 25/116 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 00:27:02] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:27:02] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:27:02] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
[2024-05-24 00:27:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 00:27:02] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 6/122 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 00:27:02] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 177/299 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 79/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/299 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 220 constraints, problems are : Problem set: 0 solved, 7 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 122/122 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 71/86 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 5/91 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 25/116 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 00:27:02] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:27:03] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 6/122 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 177/299 variables, 122/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 79/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 00:27:03] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:27:03] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/299 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 231 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 122/122 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 1900ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 2367 ms.
Support contains 15 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 341/341 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 122 transition count 336
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 117 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 332
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 332
Applied a total of 12 rules in 23 ms. Remains 116 /122 variables (removed 6) and now considering 332/341 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 116/122 places, 332/341 transitions.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 425565 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :2 out of 7
Probabilistic random walk after 425565 steps, saw 86727 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :2
[2024-05-24 00:27:09] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-05-24 00:27:09] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 00:27:09] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 69/79 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/110 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 00:27:09] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:27:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-24 00:27:09] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/116 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 00:27:09] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 4 ms to minimize.
[2024-05-24 00:27:09] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:27:09] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:27:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 168/284 variables, 116/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 76/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/284 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 212 constraints, problems are : Problem set: 0 solved, 5 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 69/79 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/110 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/116 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 168/284 variables, 116/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 76/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 00:27:10] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 00:27:10] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 00:27:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/284 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 220 constraints, problems are : Problem set: 0 solved, 5 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 1599ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1508 ms.
Support contains 10 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 31 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 116/116 places, 332/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 447355 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 5
Probabilistic random walk after 447355 steps, saw 91104 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-24 00:27:15] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 00:27:15] [INFO ] Invariant cache hit.
[2024-05-24 00:27:15] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 69/79 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/110 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 00:27:16] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/116 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 00:27:16] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:27:16] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:27:16] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:27:16] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 168/284 variables, 116/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 76/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 00:27:16] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:27:16] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:27:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/284 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 213 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 69/79 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/110 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/116 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 168/284 variables, 116/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 76/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 00:27:17] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:27:17] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-05-24 00:27:17] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/284 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 221 constraints, problems are : Problem set: 0 solved, 5 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
After SMT, in 1828ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1060 ms.
Support contains 10 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 116/116 places, 332/332 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 10 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-24 00:27:18] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 00:27:18] [INFO ] Invariant cache hit.
[2024-05-24 00:27:18] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-24 00:27:18] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 00:27:18] [INFO ] Invariant cache hit.
[2024-05-24 00:27:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:27:19] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-24 00:27:19] [INFO ] Redundant transitions in 26 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-24 00:27:19] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 00:27:19] [INFO ] Invariant cache hit.
[2024-05-24 00:27:19] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:21] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 2 ms to minimize.
[2024-05-24 00:27:21] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:27:21] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-24 00:27:21] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:27:21] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:27:21] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:27:21] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:27:22] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:27:22] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:27:22] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:27:22] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:27:22] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:27:22] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:27:22] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-24 00:27:22] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:27:22] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:27:23] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:27:23] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:27:23] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 3 ms to minimize.
[2024-05-24 00:27:23] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:24] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:27:24] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:27:24] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:27:24] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:27:24] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:27:24] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-24 00:27:25] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-05-24 00:27:25] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:27:25] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:27:25] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:27:25] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:27] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:27:28] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:27:28] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-24 00:27:28] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:27:28] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:27:28] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 3 ms to minimize.
[2024-05-24 00:27:29] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:30] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:27:30] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:27:30] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 4 ms to minimize.
[2024-05-24 00:27:30] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-24 00:27:30] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:27:31] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:27:31] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:27:31] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:32] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:27:33] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:27:33] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:27:33] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:27:33] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-24 00:27:33] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:27:34] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:38] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:27:38] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:27:38] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:27:38] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 3 ms to minimize.
[2024-05-24 00:27:38] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 3 ms to minimize.
[2024-05-24 00:27:39] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:41] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:44] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:27:44] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:48] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:27:48] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 116/284 variables, and 77 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/116 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:51] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 7 ms to minimize.
[2024-05-24 00:27:51] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:27:51] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:27:51] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-05-24 00:27:52] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-24 00:27:52] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:27:52] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:27:52] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:27:52] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:27:52] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:27:52] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:27:53] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:27:53] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:27:55] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:27:55] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:27:56] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:27:56] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (OVERLAPS) 168/284 variables, 116/210 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 76/286 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 328/614 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:28:05] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:28:07] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:28:14] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 617 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 84/84 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60709 ms. Remains : 116/116 places, 332/332 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-24 00:28:19] [INFO ] Flatten gal took : 40 ms
[2024-05-24 00:28:19] [INFO ] Flatten gal took : 42 ms
[2024-05-24 00:28:19] [INFO ] Input system was already deterministic with 420 transitions.
Support contains 58 out of 189 places (down from 59) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 404
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 404
Applied a total of 8 rules in 11 ms. Remains 185 /189 variables (removed 4) and now considering 404/420 (removed 16) transitions.
[2024-05-24 00:28:19] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-05-24 00:28:19] [INFO ] Computed 13 invariants in 5 ms
[2024-05-24 00:28:19] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-24 00:28:19] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 00:28:19] [INFO ] Invariant cache hit.
[2024-05-24 00:28:20] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 00:28:20] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-24 00:28:20] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 00:28:20] [INFO ] Invariant cache hit.
[2024-05-24 00:28:20] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:28:24] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:28:24] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 00:28:24] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:28:24] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:28:24] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2024-05-24 00:28:25] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-24 00:28:25] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 5 ms to minimize.
[2024-05-24 00:28:25] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:28:25] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 4 ms to minimize.
[2024-05-24 00:28:25] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:28:26] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:28:26] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-05-24 00:28:26] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:28:26] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:28:26] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:28:27] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 3 ms to minimize.
[2024-05-24 00:28:27] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:28:27] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:28:27] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:28:27] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:28:28] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 3 ms to minimize.
[2024-05-24 00:28:28] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:28:28] [INFO ] Deduced a trap composed of 63 places in 188 ms of which 4 ms to minimize.
[2024-05-24 00:28:28] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:28:29] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-05-24 00:28:29] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-24 00:28:29] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:28:29] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:28:29] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:28:29] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 2 ms to minimize.
[2024-05-24 00:28:30] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:28:30] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:28:30] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:28:30] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:28:30] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:28:31] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:28:31] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:28:31] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:28:32] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-05-24 00:28:32] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:28:35] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:28:35] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:28:35] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:28:36] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:28:36] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:28:36] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:28:36] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:28:37] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-05-24 00:28:37] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:28:38] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:28:38] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-05-24 00:28:38] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:28:38] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:28:39] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:28:39] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:28:40] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:28:42] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 3 ms to minimize.
[2024-05-24 00:28:42] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:28:43] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:28:45] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:28:50] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:28:50] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 30262ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30270ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 404/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31214 ms. Remains : 185/189 places, 404/420 transitions.
[2024-05-24 00:28:50] [INFO ] Flatten gal took : 22 ms
[2024-05-24 00:28:50] [INFO ] Flatten gal took : 22 ms
[2024-05-24 00:28:51] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-24 00:28:51] [INFO ] Flatten gal took : 20 ms
[2024-05-24 00:28:51] [INFO ] Flatten gal took : 20 ms
[2024-05-24 00:28:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3088970144825487765.gal : 11 ms
[2024-05-24 00:28:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6504279101501048372.ctl : 4 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/CTLFireability3088970144825487765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6504279101501048372.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.
Detected timeout of ITS tools.
[2024-05-24 00:29:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:29:21] [INFO ] Applying decomposition
[2024-05-24 00:29:21] [INFO ] Flatten gal took : 16 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/graph17646385905242935011.txt' '-o' '/tmp/graph17646385905242935011.bin' '-w' '/tmp/graph17646385905242935011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17646385905242935011.bin' '-l' '-1' '-v' '-w' '/tmp/graph17646385905242935011.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:29:21] [INFO ] Decomposing Gal with order
[2024-05-24 00:29:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:29:21] [INFO ] Removed a total of 532 redundant transitions.
[2024-05-24 00:29:21] [INFO ] Flatten gal took : 116 ms
[2024-05-24 00:29:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 27 ms.
[2024-05-24 00:29:21] [INFO ] Time to serialize gal into /tmp/CTLFireability3218177646238072586.gal : 12 ms
[2024-05-24 00:29:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10717814877994399014.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/CTLFireability3218177646238072586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10717814877994399014.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.23577e+06,17.2289,301248,8006,1070,470058,7029,985,1.12194e+06,194,134049,0


Converting to forward existential form...Done !
original formula: EF(AX((((i11.u3.turn_2==1)&&(i1.u9.p10_2_0==1)) * (EX(((i0.u2.flag_3_active==0)||(i1.u6.p09_2_3==0))) + (((i11.u3.turn_0==1)&&(i8.i2.u1.f...198
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((((i11.u3.turn_2==1)&&(i1.u9.p10_2_0==1)) * (EX(((i0.u2.flag_3_active==0)||(i1.u6.p09...256
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t...1162
(forward)formula 0,0,23.1783,301248,1,0,470058,32000,4102,1.18854e+06,775,271467,1599403
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 185 transition count 364
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 133 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 128 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 116 transition count 332
Applied a total of 146 rules in 56 ms. Remains 116 /189 variables (removed 73) and now considering 332/420 (removed 88) transitions.
[2024-05-24 00:29:44] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-05-24 00:29:44] [INFO ] Computed 13 invariants in 16 ms
[2024-05-24 00:29:45] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-24 00:29:45] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 00:29:45] [INFO ] Invariant cache hit.
[2024-05-24 00:29:45] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:29:45] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2024-05-24 00:29:45] [INFO ] Redundant transitions in 10 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-24 00:29:45] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 00:29:45] [INFO ] Invariant cache hit.
[2024-05-24 00:29:45] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:29:48] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 3 ms to minimize.
[2024-05-24 00:29:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:29:48] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:29:48] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 3 ms to minimize.
[2024-05-24 00:29:48] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:29:48] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:29:48] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:29:49] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:29:49] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:29:49] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:29:49] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:29:49] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:29:50] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:29:50] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:29:50] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-05-24 00:29:50] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 3 ms to minimize.
[2024-05-24 00:29:50] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:29:50] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:29:50] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-24 00:29:51] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:29:51] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:29:52] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:29:52] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:29:52] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:29:52] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:29:52] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:29:52] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:29:53] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:29:53] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:29:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
[2024-05-24 00:29:53] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:29:53] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 3 ms to minimize.
[2024-05-24 00:29:53] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:29:54] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:29:54] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:29:54] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:29:57] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:29:58] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:30:00] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 168/284 variables, 116/168 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 76/244 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:30:08] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
[2024-05-24 00:30:08] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 3 ms to minimize.
[2024-05-24 00:30:09] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:30:15] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/284 variables, and 248 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:30:17] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:30:18] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:30:18] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:30:18] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 168/284 variables, 116/176 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 76/252 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 328/580 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:30:24] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:30:24] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:30:24] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:30:25] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:30:25] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:30:25] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:30:26] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:30:27] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:30:28] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 9/589 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:30:32] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:30:33] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:30:35] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:30:36] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:30:41] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:30:43] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:30:43] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 596 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 63/63 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/189 places, 332/420 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61054 ms. Remains : 116/189 places, 332/420 transitions.
[2024-05-24 00:30:45] [INFO ] Flatten gal took : 21 ms
[2024-05-24 00:30:45] [INFO ] Flatten gal took : 56 ms
[2024-05-24 00:30:46] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-24 00:30:46] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:30:46] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:30:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5517696834206484856.gal : 4 ms
[2024-05-24 00:30:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5179245298115269783.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/CTLFireability5517696834206484856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5179245298115269783.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,145270,23.1717,520992,2,70848,5,1.20656e+06,6,0,799,1.28994e+06,0


Converting to forward existential form...Done !
original formula: E(!((((turn_3==1)&&(flag_3_active==1))&&(p25_0_1==1))) U (((turn_2==1)&&(flag_2_waiting==1))&&(p25_1_0==1)))
=> equivalent forward existential formula: [(FwdU(Init,!((((turn_3==1)&&(flag_3_active==1))&&(p25_0_1==1)))) * (((turn_2==1)&&(flag_2_waiting==1))&&(p25_1_...172
Hit Full ! (commute/partial/dont) 255/0/77
Detected timeout of ITS tools.
[2024-05-24 00:31:16] [INFO ] Flatten gal took : 22 ms
[2024-05-24 00:31:16] [INFO ] Applying decomposition
[2024-05-24 00:31:16] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5276695346433342780.txt' '-o' '/tmp/graph5276695346433342780.bin' '-w' '/tmp/graph5276695346433342780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5276695346433342780.bin' '-l' '-1' '-v' '-w' '/tmp/graph5276695346433342780.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:31:16] [INFO ] Decomposing Gal with order
[2024-05-24 00:31:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:31:16] [INFO ] Removed a total of 495 redundant transitions.
[2024-05-24 00:31:16] [INFO ] Flatten gal took : 75 ms
[2024-05-24 00:31:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 30 ms.
[2024-05-24 00:31:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4851268755193666676.gal : 8 ms
[2024-05-24 00:31:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7857083269908226271.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/CTLFireability4851268755193666676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7857083269908226271.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,145270,15.8742,298476,7184,1638,413229,24127,878,1.04201e+06,186,239840,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 7 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
[2024-05-24 00:31:46] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 00:31:46] [INFO ] Computed 13 invariants in 4 ms
[2024-05-24 00:31:46] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-24 00:31:46] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:31:46] [INFO ] Invariant cache hit.
[2024-05-24 00:31:46] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:31:47] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:31:47] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:31:47] [INFO ] Invariant cache hit.
[2024-05-24 00:31:47] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:31:50] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:31:50] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:31:51] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:31:51] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 4 ms to minimize.
[2024-05-24 00:31:51] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-05-24 00:31:51] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:31:52] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:31:52] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-05-24 00:31:52] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 3 ms to minimize.
[2024-05-24 00:31:52] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:31:52] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-05-24 00:31:52] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 2 ms to minimize.
[2024-05-24 00:31:52] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:31:53] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:31:53] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:31:53] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 4 ms to minimize.
[2024-05-24 00:31:53] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:31:53] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:31:54] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 4 ms to minimize.
[2024-05-24 00:31:54] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:31:54] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:31:55] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:31:55] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:31:55] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 3 ms to minimize.
[2024-05-24 00:31:55] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2024-05-24 00:31:55] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:31:56] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:31:56] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:31:56] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-05-24 00:31:56] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 3 ms to minimize.
[2024-05-24 00:31:56] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-05-24 00:31:56] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:31:57] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:31:57] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 4 ms to minimize.
[2024-05-24 00:31:57] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:31:57] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
[2024-05-24 00:32:00] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:32:00] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2024-05-24 00:32:01] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 3 ms to minimize.
[2024-05-24 00:32:01] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:32:04] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:32:05] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2024-05-24 00:32:06] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-05-24 00:32:06] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:32:07] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 3 ms to minimize.
[2024-05-24 00:32:07] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 3 ms to minimize.
[2024-05-24 00:32:07] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-05-24 00:32:07] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:32:08] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:32:08] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:32:08] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:32:08] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:32:09] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:32:10] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:32:10] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:32:10] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:32:12] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 70 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:32:19] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:32:19] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:32:19] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:32:19] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:32:19] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:32:20] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-05-24 00:32:20] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:32:20] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:32:20] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:32:23] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:32:24] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:32:25] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-24 00:32:26] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 236/420 variables, 184/267 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 76/343 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 396/739 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:32:38] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2024-05-24 00:32:38] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-24 00:32:38] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-24 00:32:38] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:32:38] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-24 00:32:38] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:32:39] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:32:39] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-05-24 00:32:39] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:32:39] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:32:42] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:32:43] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 3 ms to minimize.
[2024-05-24 00:32:43] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:32:43] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 2 ms to minimize.
[2024-05-24 00:32:44] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
[2024-05-24 00:32:45] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:32:45] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:32:46] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:32:46] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:32:46] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 20/759 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 759 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 90/90 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 400/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60982 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-24 00:32:47] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:32:47] [INFO ] Flatten gal took : 29 ms
[2024-05-24 00:32:47] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:32:47] [INFO ] Flatten gal took : 29 ms
[2024-05-24 00:32:47] [INFO ] Flatten gal took : 29 ms
[2024-05-24 00:32:47] [INFO ] Time to serialize gal into /tmp/CTLFireability8457864223470398848.gal : 20 ms
[2024-05-24 00:32:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3879905900004840003.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/CTLFireability8457864223470398848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3879905900004840003.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.
Detected timeout of ITS tools.
[2024-05-24 00:33:17] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:33:17] [INFO ] Applying decomposition
[2024-05-24 00:33:17] [INFO ] Flatten gal took : 19 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/graph16323420916685725387.txt' '-o' '/tmp/graph16323420916685725387.bin' '-w' '/tmp/graph16323420916685725387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16323420916685725387.bin' '-l' '-1' '-v' '-w' '/tmp/graph16323420916685725387.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:33:17] [INFO ] Decomposing Gal with order
[2024-05-24 00:33:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:33:17] [INFO ] Removed a total of 539 redundant transitions.
[2024-05-24 00:33:17] [INFO ] Flatten gal took : 46 ms
[2024-05-24 00:33:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 45 ms.
[2024-05-24 00:33:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3772378948866574514.gal : 5 ms
[2024-05-24 00:33:18] [INFO ] Time to serialize properties into /tmp/CTLFireability4592569300566596136.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/CTLFireability3772378948866574514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4592569300566596136.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.19718e+06,22.3971,282340,6097,1097,361136,8327,1034,914042,170,114394,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 185 transition count 365
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 134 transition count 365
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 129 transition count 345
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 144 place count 117 transition count 333
Applied a total of 144 rules in 45 ms. Remains 117 /189 variables (removed 72) and now considering 333/420 (removed 87) transitions.
[2024-05-24 00:33:48] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2024-05-24 00:33:48] [INFO ] Computed 13 invariants in 5 ms
[2024-05-24 00:33:48] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-24 00:33:48] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 00:33:48] [INFO ] Invariant cache hit.
[2024-05-24 00:33:48] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:33:48] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-05-24 00:33:48] [INFO ] Redundant transitions in 9 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-24 00:33:48] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-24 00:33:48] [INFO ] Invariant cache hit.
[2024-05-24 00:33:48] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:33:51] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:33:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 00:33:51] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:33:51] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:33:51] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:33:51] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:33:51] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:33:52] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:33:52] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:33:52] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:33:52] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:33:52] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:33:53] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:33:53] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:33:53] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:33:53] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:33:53] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:33:53] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:33:54] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:33:54] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:33:55] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:33:55] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:33:56] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:33:59] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:33:59] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:34:02] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-05-24 00:34:02] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:34:02] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 3 ms to minimize.
[2024-05-24 00:34:02] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:34:05] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (OVERLAPS) 169/286 variables, 117/160 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 76/236 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:34:14] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:34:15] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:34:15] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-24 00:34:15] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:34:15] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 5/241 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/286 variables, and 241 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:34:21] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:34:21] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:34:21] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:34:22] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:34:22] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:34:23] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:34:23] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:34:23] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (OVERLAPS) 169/286 variables, 117/173 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 76/249 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 329/578 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:34:29] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-24 00:34:30] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:34:30] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-24 00:34:31] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:34:31] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:34:31] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-24 00:34:32] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 7/585 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:34:37] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:34:37] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-24 00:34:41] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2024-05-24 00:34:43] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:34:43] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:34:44] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
[2024-05-24 00:34:44] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 5/592 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/286 variables, and 592 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 57/57 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in SI_CTL mode, iteration 1 : 117/189 places, 333/420 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60934 ms. Remains : 117/189 places, 333/420 transitions.
[2024-05-24 00:34:49] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:34:49] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:34:49] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-24 00:34:49] [INFO ] Flatten gal took : 26 ms
RANDOM walk for 11848 steps (2 resets) in 63 ms. (185 steps per ms) remains 0/1 properties
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 00:34:49] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:34:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8640642380242140588.gal : 3 ms
[2024-05-24 00:34:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13234066310753747187.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8640642380242140588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13234066310753747187.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 4 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
[2024-05-24 00:34:49] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 00:34:49] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 00:34:49] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-24 00:34:49] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:34:49] [INFO ] Invariant cache hit.
[2024-05-24 00:34:49] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:34:49] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:34:49] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:34:49] [INFO ] Invariant cache hit.
[2024-05-24 00:34:49] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:34:52] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:34:52] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-24 00:34:52] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:34:53] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 3 ms to minimize.
[2024-05-24 00:34:53] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-24 00:34:53] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:34:53] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:34:53] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:34:53] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:34:53] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:34:54] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:34:54] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:34:54] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:34:54] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:34:54] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:34:54] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:34:54] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:34:55] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:34:55] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:34:55] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:34:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:34:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:34:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:34:56] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:34:56] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:34:56] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:34:56] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:34:56] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 4 ms to minimize.
[2024-05-24 00:34:57] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:34:57] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:34:57] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:34:57] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:34:57] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:34:57] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-05-24 00:34:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:34:58] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:35:00] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-05-24 00:35:00] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:35:00] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:35:00] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:35:03] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:35:04] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:35:05] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-05-24 00:35:05] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:35:05] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:35:05] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:35:05] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:35:06] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 3 ms to minimize.
[2024-05-24 00:35:06] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:35:06] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:35:06] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:35:06] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-05-24 00:35:06] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:35:07] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:35:07] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:35:08] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:35:09] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:35:14] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 3 ms to minimize.
[2024-05-24 00:35:15] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:35:15] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:35:18] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-24 00:35:18] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:35:19] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-05-24 00:35:19] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
SMT process timed out in 30233ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30237ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 400/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30796 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-24 00:35:19] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:35:20] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:35:20] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:35:20] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:35:20] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:35:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16951778846661239735.gal : 5 ms
[2024-05-24 00:35:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7210910138229145341.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/CTLFireability16951778846661239735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7210910138229145341.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.
Detected timeout of ITS tools.
[2024-05-24 00:35:50] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:35:50] [INFO ] Applying decomposition
[2024-05-24 00:35:50] [INFO ] Flatten gal took : 12 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/graph5864110602059380946.txt' '-o' '/tmp/graph5864110602059380946.bin' '-w' '/tmp/graph5864110602059380946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5864110602059380946.bin' '-l' '-1' '-v' '-w' '/tmp/graph5864110602059380946.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:35:50] [INFO ] Decomposing Gal with order
[2024-05-24 00:35:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:35:50] [INFO ] Removed a total of 539 redundant transitions.
[2024-05-24 00:35:50] [INFO ] Flatten gal took : 44 ms
[2024-05-24 00:35:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 14 ms.
[2024-05-24 00:35:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14175441662616310019.gal : 5 ms
[2024-05-24 00:35:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8705108306923083503.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/CTLFireability14175441662616310019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8705108306923083503.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 7 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
[2024-05-24 00:36:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:36:20] [INFO ] Invariant cache hit.
[2024-05-24 00:36:20] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-24 00:36:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:36:20] [INFO ] Invariant cache hit.
[2024-05-24 00:36:20] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:36:21] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:36:21] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:36:21] [INFO ] Invariant cache hit.
[2024-05-24 00:36:21] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:36:24] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:36:24] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-24 00:36:25] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:36:25] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:36:25] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:36:25] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:36:25] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:36:26] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:36:26] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:36:26] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 1 ms to minimize.
[2024-05-24 00:36:26] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:36:26] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:36:26] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:36:26] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:36:26] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:36:27] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2024-05-24 00:36:27] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:36:27] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:36:27] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:36:27] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:36:27] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:36:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 00:36:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-24 00:36:28] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:36:28] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:36:29] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:36:29] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:36:29] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:36:29] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:36:29] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:36:29] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:36:29] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2024-05-24 00:36:30] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:36:30] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:36:30] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:36:30] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:36:32] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:36:32] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:36:32] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 3 ms to minimize.
[2024-05-24 00:36:33] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:36:36] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:36:36] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
[2024-05-24 00:36:37] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:36:37] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2024-05-24 00:36:37] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:36:37] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 4 ms to minimize.
[2024-05-24 00:36:38] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:36:38] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:36:38] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 3 ms to minimize.
[2024-05-24 00:36:38] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 2 ms to minimize.
[2024-05-24 00:36:39] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:36:39] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:36:39] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:36:40] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 2 ms to minimize.
[2024-05-24 00:36:40] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 2 ms to minimize.
[2024-05-24 00:36:40] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:36:42] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:36:47] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 2 ms to minimize.
[2024-05-24 00:36:48] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:36:48] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:36:50] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-05-24 00:36:51] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 1 ms to minimize.
(s21 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 75 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:36:52] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:36:52] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:36:52] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:36:53] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 3 ms to minimize.
[2024-05-24 00:36:53] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 2 ms to minimize.
[2024-05-24 00:36:56] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:36:56] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:37:00] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:37:00] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 236/420 variables, 184/268 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 76/344 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 396/740 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:37:12] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:37:12] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:37:12] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:37:12] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:37:15] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:37:16] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:37:17] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:37:17] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:37:17] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:37:17] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:37:19] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 751 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 82/82 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 400/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61178 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-24 00:37:21] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:37:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:37:21] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:37:21] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:37:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:37:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10896921277554901340.gal : 4 ms
[2024-05-24 00:37:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14632488484518153020.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/CTLFireability10896921277554901340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14632488484518153020.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.
Detected timeout of ITS tools.
[2024-05-24 00:37:51] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:37:51] [INFO ] Applying decomposition
[2024-05-24 00:37:51] [INFO ] Flatten gal took : 16 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/graph2359473723987504017.txt' '-o' '/tmp/graph2359473723987504017.bin' '-w' '/tmp/graph2359473723987504017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2359473723987504017.bin' '-l' '-1' '-v' '-w' '/tmp/graph2359473723987504017.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:37:51] [INFO ] Decomposing Gal with order
[2024-05-24 00:37:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:37:51] [INFO ] Removed a total of 528 redundant transitions.
[2024-05-24 00:37:51] [INFO ] Flatten gal took : 53 ms
[2024-05-24 00:37:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 12 ms.
[2024-05-24 00:37:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9604075969418429602.gal : 8 ms
[2024-05-24 00:37:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12271826613707405602.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/CTLFireability9604075969418429602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12271826613707405602.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.19718e+06,17.9918,306364,8814,1688,477831,15955,1019,972931,181,148084,0


Converting to forward existential form...Done !
original formula: AG(AX(EF(((i10.i1.u44.flag_1_waiting==1)&&(i3.u10.p09_3_1==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U ((i10.i1.u44.flag_1_waiting==1)&&(i3.u10.p09_3_1==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t...1152
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 404
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 404
Applied a total of 8 rules in 4 ms. Remains 185 /189 variables (removed 4) and now considering 404/420 (removed 16) transitions.
[2024-05-24 00:38:22] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-05-24 00:38:22] [INFO ] Computed 13 invariants in 9 ms
[2024-05-24 00:38:22] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-24 00:38:22] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 00:38:22] [INFO ] Invariant cache hit.
[2024-05-24 00:38:22] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 00:38:22] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-24 00:38:22] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 00:38:22] [INFO ] Invariant cache hit.
[2024-05-24 00:38:22] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:38:25] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-24 00:38:26] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:38:26] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:38:26] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:38:26] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:38:26] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:38:26] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:38:27] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:38:27] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:38:27] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:38:27] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:38:27] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-05-24 00:38:27] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:38:28] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:38:28] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:38:28] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:38:28] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 2 ms to minimize.
[2024-05-24 00:38:28] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:38:28] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:38:28] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:38:29] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-24 00:38:29] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-24 00:38:29] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 3 ms to minimize.
[2024-05-24 00:38:29] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
[2024-05-24 00:38:29] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:38:29] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:38:30] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:38:31] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:38:31] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-24 00:38:31] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:38:31] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:38:31] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 3 ms to minimize.
[2024-05-24 00:38:32] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:38:33] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:38:33] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:38:33] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:38:36] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:38:37] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:38:38] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:38:38] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:38:38] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:38:38] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:38:38] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-05-24 00:38:39] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:38:39] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:38:39] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:38:40] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:38:42] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:38:44] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:38:45] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:38:46] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:38:47] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-24 00:38:48] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:38:48] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:38:51] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:38:52] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:38:52] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/425 variables, and 70 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/185 constraints, ReadFeed: 0/79 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:38:54] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:38:55] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2024-05-24 00:38:55] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 3 ms to minimize.
[2024-05-24 00:38:55] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:38:55] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:38:56] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:38:56] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2024-05-24 00:38:56] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:38:56] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:38:56] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:38:57] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-05-24 00:38:57] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:38:57] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:38:57] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:38:57] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:38:57] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:38:58] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:38:58] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:38:58] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2024-05-24 00:38:58] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:38:59] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:39:00] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:39:00] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:39:00] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-05-24 00:39:01] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-05-24 00:39:02] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:39:02] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:39:02] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:39:02] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:39:04] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 4 ms to minimize.
[2024-05-24 00:39:04] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:39:05] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:39:05] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:39:05] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:39:05] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:39:05] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:39:05] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:39:06] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-05-24 00:39:06] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:39:07] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:39:07] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 2 ms to minimize.
[2024-05-24 00:39:07] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:39:08] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2024-05-24 00:39:08] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:39:09] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:39:10] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:39:11] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:39:11] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:39:11] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:39:12] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 240/425 variables, 185/305 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 79/384 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 400/784 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 784 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 185/185 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 107/107 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 404/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60877 ms. Remains : 185/189 places, 404/420 transitions.
[2024-05-24 00:39:22] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:39:22] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:39:22] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-24 00:39:22] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:39:22] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:39:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16817992076701322866.gal : 3 ms
[2024-05-24 00:39:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9338107976716420580.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/CTLFireability16817992076701322866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9338107976716420580.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.
Detected timeout of ITS tools.
[2024-05-24 00:39:53] [INFO ] Flatten gal took : 25 ms
[2024-05-24 00:39:53] [INFO ] Applying decomposition
[2024-05-24 00:39:53] [INFO ] Flatten gal took : 9 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/graph1936690034385550631.txt' '-o' '/tmp/graph1936690034385550631.bin' '-w' '/tmp/graph1936690034385550631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1936690034385550631.bin' '-l' '-1' '-v' '-w' '/tmp/graph1936690034385550631.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:39:53] [INFO ] Decomposing Gal with order
[2024-05-24 00:39:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:39:53] [INFO ] Removed a total of 509 redundant transitions.
[2024-05-24 00:39:53] [INFO ] Flatten gal took : 44 ms
[2024-05-24 00:39:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 7 ms.
[2024-05-24 00:39:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6019910090536248809.gal : 6 ms
[2024-05-24 00:39:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15513080924152734066.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/CTLFireability6019910090536248809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15513080924152734066.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.23122e+06,22.6249,415820,10454,1890,616241,29255,1045,1.21273e+06,183,213910,0


Converting to forward existential form...Done !
original formula: AG((E((!(EF((i2.u11.p08_2_1==1))) + ((i9.i2.u1.flag_2_waiting==1)&&(i9.i1.u48.p33_1_2==1))) U !(((i11.u42.turn_0==1)&&(i2.u12.p10_2_3==1)...242
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((!(E(TRUE U (i2.u11.p08_2_1==1))) + ((i9.i2.u1.flag_2_waiting==1)&&(i9.i1.u48.p33_1_2==...335
(forward)formula 0,0,23.9182,415820,1,0,616241,29255,1606,1.21273e+06,274,213910,402011
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
[2024-05-24 00:40:17] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 00:40:17] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 00:40:17] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-24 00:40:17] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:40:17] [INFO ] Invariant cache hit.
[2024-05-24 00:40:17] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:40:17] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:40:17] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:40:17] [INFO ] Invariant cache hit.
[2024-05-24 00:40:17] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:40:21] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:40:21] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:40:21] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:40:21] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 4 ms to minimize.
[2024-05-24 00:40:21] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 2 ms to minimize.
[2024-05-24 00:40:22] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:40:22] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:40:22] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-24 00:40:22] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 2 ms to minimize.
[2024-05-24 00:40:22] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:40:22] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:40:22] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:40:23] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:40:23] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:40:23] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:40:23] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-24 00:40:23] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-24 00:40:23] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:40:23] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:40:24] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:40:24] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-24 00:40:24] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:40:25] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:40:25] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 4 ms to minimize.
[2024-05-24 00:40:25] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-05-24 00:40:25] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 3 ms to minimize.
[2024-05-24 00:40:25] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 2 ms to minimize.
[2024-05-24 00:40:26] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:40:26] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 3 ms to minimize.
[2024-05-24 00:40:26] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 5 ms to minimize.
[2024-05-24 00:40:26] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:40:26] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:40:27] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-24 00:40:27] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-05-24 00:40:27] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:40:27] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:40:29] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 1 ms to minimize.
[2024-05-24 00:40:30] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:40:30] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:40:30] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:40:33] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:40:34] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:40:34] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:40:34] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:40:35] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:40:35] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 3 ms to minimize.
[2024-05-24 00:40:35] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 4 ms to minimize.
[2024-05-24 00:40:35] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:40:36] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:40:36] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:40:36] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:40:36] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:40:37] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:40:37] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:40:37] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:40:38] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:40:38] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:40:44] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:40:45] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:40:45] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:40:49] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:40:49] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:40:49] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:40:49] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 3 ms to minimize.
[2024-05-24 00:40:49] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 4 ms to minimize.
[2024-05-24 00:40:50] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:40:50] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:40:50] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 3 ms to minimize.
[2024-05-24 00:40:50] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:40:50] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:40:52] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-24 00:40:52] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:40:52] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:40:52] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:40:53] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:40:53] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:40:53] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:40:54] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:41:03] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 3 ms to minimize.
[2024-05-24 00:41:04] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:41:06] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:41:06] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:41:07] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:41:07] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:41:08] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:41:08] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:41:10] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:41:10] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:41:10] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 3 ms to minimize.
[2024-05-24 00:41:11] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:41:11] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:41:18] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 3 ms to minimize.
SMT process timed out in 60191ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 400/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60916 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-24 00:41:18] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:41:18] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:41:18] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:41:18] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:41:18] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:41:18] [INFO ] Time to serialize gal into /tmp/CTLFireability742526969853553882.gal : 4 ms
[2024-05-24 00:41:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8453357724012333.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/CTLFireability742526969853553882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8453357724012333.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 -...279
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 00:41:48] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:41:48] [INFO ] Applying decomposition
[2024-05-24 00:41:48] [INFO ] Flatten gal took : 9 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/graph6383943572259330798.txt' '-o' '/tmp/graph6383943572259330798.bin' '-w' '/tmp/graph6383943572259330798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6383943572259330798.bin' '-l' '-1' '-v' '-w' '/tmp/graph6383943572259330798.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:41:48] [INFO ] Decomposing Gal with order
[2024-05-24 00:41:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:41:48] [INFO ] Removed a total of 534 redundant transitions.
[2024-05-24 00:41:48] [INFO ] Flatten gal took : 29 ms
[2024-05-24 00:41:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 6 ms.
[2024-05-24 00:41:48] [INFO ] Time to serialize gal into /tmp/CTLFireability3562594773518290580.gal : 5 ms
[2024-05-24 00:41:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1424728683569475400.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/CTLFireability3562594773518290580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1424728683569475400.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.19718e+06,20.3109,324284,10257,1255,509591,10452,1013,944329,186,134625,0


Converting to forward existential form...Done !
original formula: EX((EF(((EG(((i11.u2.turn_2==1)&&(i10.u57.p27_0==1))) * AX((((i11.u2.turn_2==1)&&(i5.i1.u22.flag_2_idle==1))&&(i8.u0.p25_0_3==1)))) + ((!...627
=> equivalent forward existential formula: ([((EY(Init) * E(TRUE U ((EG(((i11.u2.turn_2==1)&&(i10.u57.p27_0==1))) * !(EX(!((((i11.u2.turn_2==1)&&(i5.i1.u22...1450
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t...1148
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 3 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
[2024-05-24 00:42:18] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:42:18] [INFO ] Invariant cache hit.
[2024-05-24 00:42:18] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-24 00:42:18] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:42:18] [INFO ] Invariant cache hit.
[2024-05-24 00:42:18] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:42:19] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:42:19] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:42:19] [INFO ] Invariant cache hit.
[2024-05-24 00:42:19] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:42:22] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:42:22] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:42:22] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:42:22] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:42:22] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:42:22] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:42:22] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:42:22] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:42:23] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:42:23] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:42:23] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:42:23] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:42:23] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:42:23] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-24 00:42:23] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:42:23] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:42:24] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:42:24] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-24 00:42:24] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:42:24] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:42:24] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:42:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 00:42:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-24 00:42:25] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:42:25] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:42:25] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-05-24 00:42:25] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:42:26] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:42:26] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:42:26] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:42:26] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:42:26] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:42:26] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:42:26] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:42:26] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 00:42:27] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:42:28] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:42:29] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:42:29] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:42:29] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:42:32] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:42:32] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:42:33] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:42:33] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:42:34] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:42:34] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:42:34] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:42:34] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:42:34] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:42:35] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:42:35] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:42:35] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-05-24 00:42:35] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
[2024-05-24 00:42:36] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:42:36] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 3 ms to minimize.
[2024-05-24 00:42:36] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:42:37] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:42:43] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:42:43] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 4 ms to minimize.
[2024-05-24 00:42:44] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:42:47] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-24 00:42:47] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:42:48] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:42:48] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:42:49] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 78 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:42:50] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:42:51] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 3 ms to minimize.
[2024-05-24 00:42:51] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 2 ms to minimize.
[2024-05-24 00:42:51] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/266 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/342 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/738 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:43:04] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:43:04] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:43:04] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 2 ms to minimize.
[2024-05-24 00:43:05] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:43:06] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:43:06] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:43:06] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:43:07] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:43:08] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:43:08] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:43:09] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:43:09] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:43:12] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:43:13] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 3 ms to minimize.
[2024-05-24 00:43:13] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:43:14] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:43:14] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 3 ms to minimize.
[2024-05-24 00:43:15] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:43:15] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:43:15] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 20/758 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 758 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 89/89 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 400/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60775 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-24 00:43:19] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:43:19] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:43:19] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:43:19] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:43:19] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7928581814739541840.gal : 3 ms
[2024-05-24 00:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability180104974257969980.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/CTLFireability7928581814739541840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability180104974257969980.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.
Detected timeout of ITS tools.
[2024-05-24 00:43:49] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:43:49] [INFO ] Applying decomposition
[2024-05-24 00:43:49] [INFO ] Flatten gal took : 9 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/graph8470501555570362787.txt' '-o' '/tmp/graph8470501555570362787.bin' '-w' '/tmp/graph8470501555570362787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8470501555570362787.bin' '-l' '-1' '-v' '-w' '/tmp/graph8470501555570362787.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:43:49] [INFO ] Decomposing Gal with order
[2024-05-24 00:43:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:43:49] [INFO ] Removed a total of 524 redundant transitions.
[2024-05-24 00:43:49] [INFO ] Flatten gal took : 38 ms
[2024-05-24 00:43:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 7 ms.
[2024-05-24 00:43:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7955899687228645010.gal : 11 ms
[2024-05-24 00:43:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13122977927071445563.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/CTLFireability7955899687228645010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13122977927071445563.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 4 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
[2024-05-24 00:44:19] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:44:19] [INFO ] Invariant cache hit.
[2024-05-24 00:44:19] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-24 00:44:19] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:44:19] [INFO ] Invariant cache hit.
[2024-05-24 00:44:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:44:20] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:44:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:44:20] [INFO ] Invariant cache hit.
[2024-05-24 00:44:20] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:44:23] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:44:23] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:44:23] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:44:24] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 3 ms to minimize.
[2024-05-24 00:44:24] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:44:24] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:44:24] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:44:24] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:44:24] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 3 ms to minimize.
[2024-05-24 00:44:24] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-05-24 00:44:24] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:44:25] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:44:25] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:44:25] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:44:25] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:44:25] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:44:25] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:44:25] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 00:44:25] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:44:25] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:44:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:44:26] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:44:26] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 00:44:27] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:44:27] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 4 ms to minimize.
[2024-05-24 00:44:27] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:44:27] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:44:27] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:44:27] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:44:27] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:44:28] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:44:28] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:44:28] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:44:28] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:44:28] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-05-24 00:44:28] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:44:30] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:44:30] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:44:30] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2024-05-24 00:44:31] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:44:33] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:44:34] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 2 ms to minimize.
[2024-05-24 00:44:35] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:44:35] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:44:35] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:44:35] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:44:36] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:44:36] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:44:36] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:44:36] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:44:36] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:44:37] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-24 00:44:37] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:44:38] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:44:38] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:44:38] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:44:39] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:44:45] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:44:45] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 4 ms to minimize.
[2024-05-24 00:44:45] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:44:49] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-24 00:44:49] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 1 ms to minimize.
[2024-05-24 00:44:50] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-05-24 00:44:50] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:44:50] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:44:50] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30178ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 400/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31023 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-24 00:44:50] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:44:50] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:44:50] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:44:50] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:44:50] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:44:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3605370067278418818.gal : 4 ms
[2024-05-24 00:44:50] [INFO ] Time to serialize properties into /tmp/CTLFireability1378318764136380990.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/CTLFireability3605370067278418818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1378318764136380990.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.
Detected timeout of ITS tools.
[2024-05-24 00:45:20] [INFO ] Flatten gal took : 18 ms
[2024-05-24 00:45:20] [INFO ] Applying decomposition
[2024-05-24 00:45:20] [INFO ] Flatten gal took : 16 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/graph12129354480720224323.txt' '-o' '/tmp/graph12129354480720224323.bin' '-w' '/tmp/graph12129354480720224323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12129354480720224323.bin' '-l' '-1' '-v' '-w' '/tmp/graph12129354480720224323.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:45:20] [INFO ] Decomposing Gal with order
[2024-05-24 00:45:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:45:20] [INFO ] Removed a total of 512 redundant transitions.
[2024-05-24 00:45:20] [INFO ] Flatten gal took : 50 ms
[2024-05-24 00:45:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 12 ms.
[2024-05-24 00:45:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15851416063111061447.gal : 8 ms
[2024-05-24 00:45:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12745849018874859308.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/CTLFireability15851416063111061447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12745849018874859308.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.19718e+06,18.4576,261800,8849,1927,335443,14549,1053,1.08459e+06,202,140673,0


Converting to forward existential form...Done !
original formula: EF(((AX((EX(((i9.u38.turn_2==0)||(i0.u41.p27_1==0))) * AF((i6.i0.u37.p19_3_2==1)))) * (i7.i0.u0.flag_0_active==1)) * (i12.i1.u49.p33_2_0=...160
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (i12.i1.u49.p33_2_0==1)) * (i7.i0.u0.flag_0_active==1)) * !(EX(!((EX(((i9.u38.turn_2==0)||...224
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t40, t41, t42, t43, t44, t45, t52, t53, t54, t55, t56, t57, t...1153
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,27.7539,302192,1,0,405322,53456,4615,1.65148e+06,851,304395,1473519
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 7 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
[2024-05-24 00:45:48] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:45:48] [INFO ] Invariant cache hit.
[2024-05-24 00:45:49] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-24 00:45:49] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:45:49] [INFO ] Invariant cache hit.
[2024-05-24 00:45:49] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:45:49] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:45:49] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:45:49] [INFO ] Invariant cache hit.
[2024-05-24 00:45:49] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:45:52] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:45:52] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-24 00:45:52] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-24 00:45:53] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:45:53] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:45:53] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:45:53] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:45:53] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:45:53] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:45:53] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:45:54] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:45:54] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:45:54] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:45:54] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
[2024-05-24 00:45:54] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-24 00:45:54] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 3 ms to minimize.
[2024-05-24 00:45:54] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:45:55] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:45:55] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:45:55] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:45:55] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:45:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-24 00:45:55] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 00:45:56] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 4 ms to minimize.
[2024-05-24 00:45:56] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-05-24 00:45:56] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:45:56] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 2 ms to minimize.
[2024-05-24 00:45:56] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 4 ms to minimize.
[2024-05-24 00:45:57] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:45:57] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 3 ms to minimize.
[2024-05-24 00:45:57] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:45:57] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:45:57] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:45:57] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-05-24 00:45:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:45:58] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:46:00] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:46:00] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:46:01] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:46:01] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:46:04] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:46:05] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 3 ms to minimize.
[2024-05-24 00:46:06] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2024-05-24 00:46:06] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:46:06] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 4 ms to minimize.
[2024-05-24 00:46:06] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 3 ms to minimize.
[2024-05-24 00:46:07] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 4 ms to minimize.
[2024-05-24 00:46:07] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-05-24 00:46:07] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:46:08] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:46:08] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:46:08] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 3 ms to minimize.
[2024-05-24 00:46:08] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 3 ms to minimize.
[2024-05-24 00:46:09] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:46:10] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 3 ms to minimize.
[2024-05-24 00:46:10] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:46:11] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:46:18] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 4 ms to minimize.
[2024-05-24 00:46:19] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2024-05-24 00:46:19] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:46:21] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:46:21] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 3 ms to minimize.
[2024-05-24 00:46:21] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:46:21] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:46:22] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 2 ms to minimize.
[2024-05-24 00:46:22] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:46:22] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
[2024-05-24 00:46:22] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:46:22] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:46:23] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:46:24] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:46:25] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:46:25] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:46:25] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:46:25] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:46:25] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:46:25] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:46:26] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:46:37] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:46:37] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:46:40] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:46:41] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:46:41] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:46:42] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 3 ms to minimize.
[2024-05-24 00:46:43] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 3 ms to minimize.
[2024-05-24 00:46:43] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:46:45] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
[2024-05-24 00:46:45] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:46:46] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
[2024-05-24 00:46:46] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:46:46] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 400/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60973 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-24 00:46:49] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:46:49] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:46:49] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:46:49] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:46:49] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:46:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5148477603963965521.gal : 4 ms
[2024-05-24 00:46:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14640153205636965389.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/CTLFireability5148477603963965521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14640153205636965389.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.
Detected timeout of ITS tools.
[2024-05-24 00:47:19] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:47:19] [INFO ] Applying decomposition
[2024-05-24 00:47:19] [INFO ] Flatten gal took : 10 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/graph2296298367643079144.txt' '-o' '/tmp/graph2296298367643079144.bin' '-w' '/tmp/graph2296298367643079144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2296298367643079144.bin' '-l' '-1' '-v' '-w' '/tmp/graph2296298367643079144.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:47:19] [INFO ] Decomposing Gal with order
[2024-05-24 00:47:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:47:19] [INFO ] Removed a total of 519 redundant transitions.
[2024-05-24 00:47:19] [INFO ] Flatten gal took : 21 ms
[2024-05-24 00:47:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 7 ms.
[2024-05-24 00:47:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10162375341178702310.gal : 20 ms
[2024-05-24 00:47:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2758128248823584572.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/CTLFireability10162375341178702310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2758128248823584572.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.19718e+06,11.9846,175436,5139,776,242258,4828,1074,631669,185,48568,0


Converting to forward existential form...Done !
original formula: EF(AX((i2.u11.p08_1_3==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((i2.u11.p08_1_3==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t...1289
(forward)formula 0,0,16.0126,175436,1,0,242258,20473,4317,794055,779,129186,806795
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 185 transition count 365
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 134 transition count 365
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 130 transition count 349
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 130 transition count 349
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 118 transition count 337
Applied a total of 142 rules in 40 ms. Remains 118 /189 variables (removed 71) and now considering 337/420 (removed 83) transitions.
[2024-05-24 00:47:36] [INFO ] Flow matrix only has 173 transitions (discarded 164 similar events)
// Phase 1: matrix 173 rows 118 cols
[2024-05-24 00:47:36] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:47:36] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-24 00:47:36] [INFO ] Flow matrix only has 173 transitions (discarded 164 similar events)
[2024-05-24 00:47:36] [INFO ] Invariant cache hit.
[2024-05-24 00:47:36] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 00:47:36] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-24 00:47:36] [INFO ] Redundant transitions in 3 ms returned []
Running 333 sub problems to find dead transitions.
[2024-05-24 00:47:36] [INFO ] Flow matrix only has 173 transitions (discarded 164 similar events)
[2024-05-24 00:47:36] [INFO ] Invariant cache hit.
[2024-05-24 00:47:36] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:47:39] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 2 ms to minimize.
[2024-05-24 00:47:39] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:47:39] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:47:39] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2024-05-24 00:47:39] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:47:39] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:47:40] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:47:40] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:47:40] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:47:40] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:47:40] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:47:40] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:47:40] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:47:40] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:47:41] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:47:41] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 4 ms to minimize.
[2024-05-24 00:47:41] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:47:41] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:47:41] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:47:41] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:47:42] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:47:42] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:47:42] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:47:42] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:47:42] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 00:47:43] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:47:43] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:47:43] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:47:43] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:47:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:47:44] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:47:44] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:47:44] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:47:44] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:47:44] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:47:44] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:47:45] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:47:45] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:47:45] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:47:45] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:47:48] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:47:48] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:47:48] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:47:48] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:47:49] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:47:51] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:47:51] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:47:51] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:47:51] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:47:52] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:47:52] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:47:52] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:47:53] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:47:54] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-05-24 00:47:54] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:47:54] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:47:58] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:47:58] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:47:59] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:47:59] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (OVERLAPS) 173/291 variables, 118/191 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 79/270 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/291 variables, and 270 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:48:08] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:48:08] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:48:08] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:48:08] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:48:09] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:48:09] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 2 ms to minimize.
[2024-05-24 00:48:09] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:48:11] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:48:11] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:48:12] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:48:12] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:48:13] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:48:13] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:48:15] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:48:15] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:48:16] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:48:16] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:48:16] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:48:16] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2024-05-24 00:48:16] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:48:17] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 8/94 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:48:19] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:48:21] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:48:21] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:48:21] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:48:21] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:48:21] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:48:24] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:48:27] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:48:29] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:48:29] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:48:30] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 12 (OVERLAPS) 173/291 variables, 118/223 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 79/302 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 333/635 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 635 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 92/92 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in SI_CTL mode, iteration 1 : 118/189 places, 337/420 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60857 ms. Remains : 118/189 places, 337/420 transitions.
[2024-05-24 00:48:36] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:48:36] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:48:36] [INFO ] Input system was already deterministic with 337 transitions.
[2024-05-24 00:48:36] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:48:36] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:48:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13670750832367914204.gal : 5 ms
[2024-05-24 00:48:37] [INFO ] Time to serialize properties into /tmp/CTLFireability5599421978944257704.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/CTLFireability13670750832367914204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5599421978944257704.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,160628,22.7441,534244,2,69836,5,1.26286e+06,6,0,812,1.33959e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 00:49:07] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:49:07] [INFO ] Applying decomposition
[2024-05-24 00:49:07] [INFO ] Flatten gal took : 9 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/graph2294967303565274434.txt' '-o' '/tmp/graph2294967303565274434.bin' '-w' '/tmp/graph2294967303565274434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2294967303565274434.bin' '-l' '-1' '-v' '-w' '/tmp/graph2294967303565274434.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:49:07] [INFO ] Decomposing Gal with order
[2024-05-24 00:49:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:49:07] [INFO ] Removed a total of 506 redundant transitions.
[2024-05-24 00:49:07] [INFO ] Flatten gal took : 19 ms
[2024-05-24 00:49:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 3 ms.
[2024-05-24 00:49:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10680285477292629081.gal : 3 ms
[2024-05-24 00:49:07] [INFO ] Time to serialize properties into /tmp/CTLFireability4243982502956271140.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/CTLFireability10680285477292629081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4243982502956271140.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,160628,8.49041,160540,4826,1311,216310,12484,873,567990,179,123791,0


Converting to forward existential form...Done !
original formula: EF(AG(((A(((i9.u14.flag_2_active==1)&&(i4.u15.p18_1_2==1)) U ((i9.u14.flag_2_waiting==1)&&(i4.u15.p18_1_2==1))) + (i5.u16.turn_0==0)) + (...175
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!((E(!(((i9.u14.flag_2_waiting==1)&&(i4.u15.p18_1_2==1))) U (!(((i9.u14.flag_...366
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t7, t24, t25, t26, t27, t32, t33, t34, t38, t39, t40, t41, t42, t43, ...1094
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,19.5981,363704,1,0,558914,50023,4011,1.24748e+06,752,310800,1790855
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 189 transition count 417
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 186 transition count 417
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 6 place count 186 transition count 366
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 108 place count 135 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 130 transition count 346
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 130 transition count 346
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
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 140 place count 119 transition count 335
Applied a total of 140 rules in 49 ms. Remains 119 /189 variables (removed 70) and now considering 335/420 (removed 85) transitions.
[2024-05-24 00:49:26] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
// Phase 1: matrix 171 rows 119 cols
[2024-05-24 00:49:26] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:49:27] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-24 00:49:27] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-24 00:49:27] [INFO ] Invariant cache hit.
[2024-05-24 00:49:27] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:49:27] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-05-24 00:49:27] [INFO ] Redundant transitions in 1 ms returned []
Running 331 sub problems to find dead transitions.
[2024-05-24 00:49:27] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-24 00:49:27] [INFO ] Invariant cache hit.
[2024-05-24 00:49:27] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:49:29] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:49:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:49:29] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:49:30] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:49:30] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:49:30] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:49:30] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:49:30] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:49:30] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:49:30] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:49:31] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:49:31] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:49:31] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:49:31] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:49:31] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:49:31] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:49:31] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:49:31] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:49:31] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 3 ms to minimize.
[2024-05-24 00:49:32] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:49:32] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:49:33] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:49:33] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:49:33] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:49:33] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-05-24 00:49:33] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:49:34] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:49:34] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:49:34] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2024-05-24 00:49:34] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:49:34] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:49:34] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:49:35] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-24 00:49:35] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-24 00:49:35] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:49:35] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:49:35] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:49:35] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:49:35] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:49:38] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:49:38] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:49:38] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:49:39] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:49:39] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:49:39] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:49:39] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:49:39] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:49:39] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:49:40] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:49:40] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:49:42] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 3 ms to minimize.
[2024-05-24 00:49:42] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:49:42] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:49:42] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:49:43] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:49:43] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:49:43] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:49:45] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:49:46] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:49:49] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:49:49] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:49:49] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:49:50] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:49:50] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:49:50] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 3 ms to minimize.
[2024-05-24 00:49:50] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:49:51] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:49:52] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 3 ms to minimize.
[2024-05-24 00:49:53] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:49:53] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:49:53] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:49:53] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 3 ms to minimize.
[2024-05-24 00:49:53] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:49:54] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:49:54] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:49:54] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:49:54] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:49:55] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-24 00:49:55] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:49:55] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:49:56] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:49:56] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:49:57] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/290 variables, and 96 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:49:59] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:50:00] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:50:00] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:50:02] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:50:02] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:50:02] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:50:03] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:50:05] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:50:05] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:50:05] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:50:06] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:50:06] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:50:08] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:50:08] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-05-24 00:50:09] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:50:09] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:50:10] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:50:10] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:50:13] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-05-24 00:50:14] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:50:18] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:50:19] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:50:19] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:50:19] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:50:19] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:50:20] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:50:25] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:50:26] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 119/290 variables, and 124 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 0/331 constraints, Known Traps: 111/111 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in SI_CTL mode, iteration 1 : 119/189 places, 335/420 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60648 ms. Remains : 119/189 places, 335/420 transitions.
[2024-05-24 00:50:27] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:50:27] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:50:27] [INFO ] Input system was already deterministic with 335 transitions.
[2024-05-24 00:50:27] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:50:27] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:50:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6826952432234294196.gal : 4 ms
[2024-05-24 00:50:27] [INFO ] Time to serialize properties into /tmp/CTLFireability595441392514282616.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/CTLFireability6826952432234294196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability595441392514282616.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,154121,29.0386,604932,2,78017,5,1.39486e+06,6,0,814,1.59216e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 00:50:57] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:50:57] [INFO ] Applying decomposition
[2024-05-24 00:50:57] [INFO ] Flatten gal took : 13 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/graph17295113807421038020.txt' '-o' '/tmp/graph17295113807421038020.bin' '-w' '/tmp/graph17295113807421038020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17295113807421038020.bin' '-l' '-1' '-v' '-w' '/tmp/graph17295113807421038020.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:50:57] [INFO ] Decomposing Gal with order
[2024-05-24 00:50:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:50:57] [INFO ] Removed a total of 507 redundant transitions.
[2024-05-24 00:50:57] [INFO ] Flatten gal took : 27 ms
[2024-05-24 00:50:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 4 ms.
[2024-05-24 00:50:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14287535967899951052.gal : 3 ms
[2024-05-24 00:50:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12475787185907534127.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/CTLFireability14287535967899951052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12475787185907534127.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,154121,9.51078,160876,6641,770,208459,2708,895,579030,158,41924,0


Converting to forward existential form...Done !
original formula: AF(((u4.p12_2_3==1) + EF(!(E((((i4.i1.u14.flag_3_idle==1)&&(i4.i0.u7.p33_0_3==1))||(((i7.u19.turn_3==1)&&(i0.i0.u0.flag_3_waiting==1))&&(...260
=> equivalent forward existential formula: [FwdG(Init,!(((u4.p12_2_3==1) + E(TRUE U !(E((((i4.i1.u14.flag_3_idle==1)&&(i4.i0.u7.p33_0_3==1))||(((i7.u19.tur...311
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t30, t31, t38, t39, t40, t41, t44, t45, t46, t51, t52, t53, t...1119
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,22.3151,372448,1,0,558474,24585,4261,1.45444e+06,620,141736,2225322
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 8 place count 185 transition count 367
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 106 place count 136 transition count 367
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 131 transition count 347
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 131 transition count 347
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
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 138 place count 120 transition count 336
Applied a total of 138 rules in 18 ms. Remains 120 /189 variables (removed 69) and now considering 336/420 (removed 84) transitions.
[2024-05-24 00:51:20] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
// Phase 1: matrix 172 rows 120 cols
[2024-05-24 00:51:20] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:51:20] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-24 00:51:20] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2024-05-24 00:51:20] [INFO ] Invariant cache hit.
[2024-05-24 00:51:20] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:51:20] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-05-24 00:51:20] [INFO ] Redundant transitions in 5 ms returned []
Running 332 sub problems to find dead transitions.
[2024-05-24 00:51:20] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2024-05-24 00:51:20] [INFO ] Invariant cache hit.
[2024-05-24 00:51:20] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:22] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:51:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:51:23] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:51:23] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 3 ms to minimize.
[2024-05-24 00:51:23] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:51:23] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-24 00:51:23] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:51:23] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:51:23] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-24 00:51:24] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 3 ms to minimize.
[2024-05-24 00:51:24] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:51:24] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:51:24] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:51:24] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:51:24] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 3 ms to minimize.
[2024-05-24 00:51:24] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 5 ms to minimize.
[2024-05-24 00:51:25] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 3 ms to minimize.
[2024-05-24 00:51:25] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-24 00:51:25] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:51:25] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:26] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:51:26] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:51:26] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:51:27] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-24 00:51:27] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:51:27] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 3 ms to minimize.
[2024-05-24 00:51:27] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:51:27] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:31] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:51:31] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:51:32] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-24 00:51:32] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:34] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:51:34] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:51:34] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:51:34] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:51:34] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:51:35] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:51:35] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:37] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2024-05-24 00:51:38] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-24 00:51:38] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 172/292 variables, 120/175 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 76/251 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:47] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:51:47] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:49] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/292 variables, and 254 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 120/120 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:52] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:51:53] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:51:53] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:55] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:51:55] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:57] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:51:59] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:52:02] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:52:04] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:52:04] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 3 ms to minimize.
[2024-05-24 00:52:05] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:52:05] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:52:07] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 3 ms to minimize.
[2024-05-24 00:52:08] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (OVERLAPS) 172/292 variables, 120/192 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 76/268 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 332/600 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-24 00:52:14] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-24 00:52:14] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:52:16] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:52:17] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/292 variables, 4/604 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/292 variables, and 604 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 120/120 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 63/63 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in SI_CTL mode, iteration 1 : 120/189 places, 336/420 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60875 ms. Remains : 120/189 places, 336/420 transitions.
[2024-05-24 00:52:21] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:52:21] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:52:21] [INFO ] Input system was already deterministic with 336 transitions.
[2024-05-24 00:52:21] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:52:21] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:52:21] [INFO ] Time to serialize gal into /tmp/CTLFireability18358931943298373731.gal : 2 ms
[2024-05-24 00:52:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6525692923236860337.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/CTLFireability18358931943298373731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6525692923236860337.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,168489,23.1253,549452,2,76809,5,1.26719e+06,6,0,819,1.3362e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 00:52:51] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:52:51] [INFO ] Applying decomposition
[2024-05-24 00:52:51] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11172682570067320363.txt' '-o' '/tmp/graph11172682570067320363.bin' '-w' '/tmp/graph11172682570067320363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11172682570067320363.bin' '-l' '-1' '-v' '-w' '/tmp/graph11172682570067320363.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:52:51] [INFO ] Decomposing Gal with order
[2024-05-24 00:52:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:52:51] [INFO ] Removed a total of 511 redundant transitions.
[2024-05-24 00:52:51] [INFO ] Flatten gal took : 19 ms
[2024-05-24 00:52:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 3 ms.
[2024-05-24 00:52:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14407464939561860724.gal : 23 ms
[2024-05-24 00:52:51] [INFO ] Time to serialize properties into /tmp/CTLFireability5756849257104988290.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/CTLFireability14407464939561860724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5756849257104988290.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,168489,9.11832,174276,5490,859,269223,4812,862,508571,149,34890,0


Converting to forward existential form...Done !
original formula: EF((AF(E((!(((i2.u0.flag_1_idle==1)&&(i5.u12.p18_3_1==1))) + EG((i6.u13.p19_0_2==1))) U AF(((i2.u0.flag_1_idle==1)&&(i2.u24.p33_2_1==1)))...261
=> equivalent forward existential formula: [(FwdU(((FwdU((FwdU(Init,TRUE) * !(EG(!(E((!(((i2.u0.flag_1_idle==1)&&(i5.u12.p18_3_1==1))) + EG((i6.u13.p19_0_2...339
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t33, t35, t36, t37, t38, t39, t40, t41, t42, t43, t46, t47, t...1144
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 189 transition count 417
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 186 transition count 417
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 6 place count 186 transition count 365
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 110 place count 134 transition count 365
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 130 transition count 349
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 130 transition count 349
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 118 transition count 337
Applied a total of 142 rules in 34 ms. Remains 118 /189 variables (removed 71) and now considering 337/420 (removed 83) transitions.
[2024-05-24 00:53:21] [INFO ] Flow matrix only has 173 transitions (discarded 164 similar events)
// Phase 1: matrix 173 rows 118 cols
[2024-05-24 00:53:21] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:53:21] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-24 00:53:21] [INFO ] Flow matrix only has 173 transitions (discarded 164 similar events)
[2024-05-24 00:53:21] [INFO ] Invariant cache hit.
[2024-05-24 00:53:21] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 00:53:22] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2024-05-24 00:53:22] [INFO ] Redundant transitions in 5 ms returned []
Running 333 sub problems to find dead transitions.
[2024-05-24 00:53:22] [INFO ] Flow matrix only has 173 transitions (discarded 164 similar events)
[2024-05-24 00:53:22] [INFO ] Invariant cache hit.
[2024-05-24 00:53:22] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:53:24] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:53:24] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:53:24] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:53:24] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:53:24] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:53:24] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:53:24] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:53:25] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:53:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 00:53:25] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:53:25] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:53:25] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:53:26] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:53:26] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:53:26] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:53:26] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:53:26] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:53:27] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-05-24 00:53:27] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:53:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:53:27] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:53:28] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:53:28] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:53:28] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:53:28] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:53:29] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:53:29] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:53:29] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:53:29] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:53:29] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:53:29] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:53:30] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:53:30] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:53:30] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:53:30] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:53:30] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:53:30] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:53:30] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:53:30] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:53:31] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:53:33] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:53:33] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:53:34] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:53:34] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
[2024-05-24 00:53:34] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:53:34] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:53:34] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:53:35] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:53:36] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:53:37] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:53:37] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:53:37] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:53:38] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:53:38] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:53:38] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:53:40] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:53:40] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:53:41] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (OVERLAPS) 173/291 variables, 118/194 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 79/273 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:53:51] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-24 00:53:51] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:53:51] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:53:51] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:53:51] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/291 variables, and 278 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:53:53] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-24 00:53:53] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 6 ms to minimize.
[2024-05-24 00:53:54] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:53:55] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:53:57] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:53:57] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:53:58] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:53:58] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:53:58] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (OVERLAPS) 173/291 variables, 118/208 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 79/287 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 333/620 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:54:09] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:54:16] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:54:19] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:54:21] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 624 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 81/81 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in SI_CTL mode, iteration 1 : 118/189 places, 337/420 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60995 ms. Remains : 118/189 places, 337/420 transitions.
[2024-05-24 00:54:22] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:54:22] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:54:22] [INFO ] Input system was already deterministic with 337 transitions.
[2024-05-24 00:54:22] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:54:22] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:54:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14014600342144429693.gal : 2 ms
[2024-05-24 00:54:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9823729285110170758.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/CTLFireability14014600342144429693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9823729285110170758.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,156731,24.7553,559772,2,69500,5,1.26348e+06,6,0,812,1.37984e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 00:54:52] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:54:52] [INFO ] Applying decomposition
[2024-05-24 00:54:52] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3948969374879849021.txt' '-o' '/tmp/graph3948969374879849021.bin' '-w' '/tmp/graph3948969374879849021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3948969374879849021.bin' '-l' '-1' '-v' '-w' '/tmp/graph3948969374879849021.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:54:52] [INFO ] Decomposing Gal with order
[2024-05-24 00:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:54:52] [INFO ] Removed a total of 495 redundant transitions.
[2024-05-24 00:54:52] [INFO ] Flatten gal took : 33 ms
[2024-05-24 00:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 4 ms.
[2024-05-24 00:54:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2818309273867888528.gal : 13 ms
[2024-05-24 00:54:52] [INFO ] Time to serialize properties into /tmp/CTLFireability62066673404704317.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/CTLFireability2818309273867888528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability62066673404704317.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 -...260
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,156731,10.3489,197588,5635,1250,270861,13110,877,660588,184,166971,0


Converting to forward existential form...Done !
original formula: AG(((((i4.u1.turn_2==0)||(i3.u0.flag_2_active==0))||(i4.u1.p25_1_4==0)) * ((!(E(((i0.u2.turn_1==1)&&(i1.u8.p10_2_0==1)) U AG(((i4.u1.turn...231
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((((i4.u1.turn_2==0)||(i3.u0.flag_2_active==0))||(i4.u1.p25_1_4==0))))] = FALSE * [(FwdU((...331
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t24, t25, t26, t27, t32, t33, t34, t35, t36, t38, t41, t42, t...1068
(forward)formula 0,0,14.612,197588,1,0,270861,56978,3694,806907,732,315806,1137796
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 185 transition count 364
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 133 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 128 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 116 transition count 332
Applied a total of 146 rules in 38 ms. Remains 116 /189 variables (removed 73) and now considering 332/420 (removed 88) transitions.
[2024-05-24 00:55:07] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-05-24 00:55:07] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:55:07] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-24 00:55:07] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 00:55:07] [INFO ] Invariant cache hit.
[2024-05-24 00:55:07] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:55:07] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-05-24 00:55:07] [INFO ] Redundant transitions in 2 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-24 00:55:07] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-24 00:55:07] [INFO ] Invariant cache hit.
[2024-05-24 00:55:07] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:55:10] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:55:10] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:55:10] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2024-05-24 00:55:10] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:55:10] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-05-24 00:55:10] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:55:11] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:55:11] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-05-24 00:55:11] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:55:11] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:55:11] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:55:12] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:55:12] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:55:12] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:55:12] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:55:12] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:55:12] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:55:13] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:55:13] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:55:13] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:55:13] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:55:14] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:55:14] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:55:14] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:55:14] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:55:14] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:55:15] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-05-24 00:55:16] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:55:16] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:55:16] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:55:16] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:55:20] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:55:20] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:55:22] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 168/284 variables, 116/168 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 76/244 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:55:29] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:55:29] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:55:31] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:55:36] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/284 variables, and 248 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:55:40] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:55:40] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-05-24 00:55:40] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:55:41] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 168/284 variables, 116/176 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 76/252 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 328/580 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:55:46] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:55:47] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:55:47] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:55:48] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:55:48] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:55:48] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:55:49] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:55:49] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:55:51] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 9/589 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:55:56] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:55:56] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:55:58] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-24 00:55:58] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-24 00:56:03] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-24 00:56:05] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:56:05] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 596 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 63/63 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/189 places, 332/420 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60892 ms. Remains : 116/189 places, 332/420 transitions.
[2024-05-24 00:56:08] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:56:08] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:56:08] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-24 00:56:08] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:56:08] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:56:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15749558738274167195.gal : 3 ms
[2024-05-24 00:56:08] [INFO ] Time to serialize properties into /tmp/CTLFireability7039352081858745887.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/CTLFireability15749558738274167195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7039352081858745887.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,145270,26.818,520256,2,70848,5,1.20656e+06,6,0,799,1.28994e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 00:56:38] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:56:38] [INFO ] Applying decomposition
[2024-05-24 00:56:38] [INFO ] Flatten gal took : 13 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/graph7059241033258985124.txt' '-o' '/tmp/graph7059241033258985124.bin' '-w' '/tmp/graph7059241033258985124.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7059241033258985124.bin' '-l' '-1' '-v' '-w' '/tmp/graph7059241033258985124.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:56:38] [INFO ] Decomposing Gal with order
[2024-05-24 00:56:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:56:38] [INFO ] Removed a total of 493 redundant transitions.
[2024-05-24 00:56:38] [INFO ] Flatten gal took : 33 ms
[2024-05-24 00:56:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 5 ms.
[2024-05-24 00:56:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13267053598482741434.gal : 4 ms
[2024-05-24 00:56:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14940932024887143588.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/CTLFireability13267053598482741434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14940932024887143588.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,145270,13.9411,193760,4520,1224,250473,10626,836,722116,189,127816,0


Converting to forward existential form...Done !
original formula: EF(AG(A(((i8.u19.flag_0_active==1)&&(i4.u24.p33_3_0==1)) U ((i11.u0.flag_3_idle==1)&&(i12.u31.p33_2_3==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(((i11.u0.flag_3_idle==1)&&(i12.u31.p33_2_3==1))) U (!(((i8.u19.flag_0_ac...314
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t24, t27, t28, t29, t30, t31, t32, t33, t34, t37, t38, t39, t40, ...1078
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,18.6806,194552,1,0,250473,44179,3833,871388,753,278849,748436
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-24 00:56:57] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:56:57] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:56:57] [INFO ] Applying decomposition
[2024-05-24 00:56:57] [INFO ] Flatten gal took : 9 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/graph17758055854164474190.txt' '-o' '/tmp/graph17758055854164474190.bin' '-w' '/tmp/graph17758055854164474190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17758055854164474190.bin' '-l' '-1' '-v' '-w' '/tmp/graph17758055854164474190.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:56:57] [INFO ] Decomposing Gal with order
[2024-05-24 00:56:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:56:57] [INFO ] Removed a total of 602 redundant transitions.
[2024-05-24 00:56:57] [INFO ] Flatten gal took : 20 ms
[2024-05-24 00:56:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 6 ms.
[2024-05-24 00:56:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6548297091313703389.gal : 4 ms
[2024-05-24 00:56:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10362878252381712562.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/CTLFireability6548297091313703389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10362878252381712562.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 7 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.40652e+06,11.9695,202504,7547,767,335191,5484,1151,655475,155,55605,0


Converting to forward existential form...Done !
original formula: E(!((((i9.u4.turn_3==1)&&(i5.i0.u45.flag_3_active==1))&&(i5.i0.u45.p25_0_1==1))) U (((i11.i1.u2.turn_2==1)&&(i5.i0.u45.flag_2_waiting==1)...181
=> equivalent forward existential formula: [(FwdU(Init,!((((i9.u4.turn_3==1)&&(i5.i0.u45.flag_3_active==1))&&(i5.i0.u45.p25_0_1==1)))) * (((i11.i1.u2.turn_...227
(forward)formula 0,1,30.5955,453568,1,0,787037,6327,2189,1.25877e+06,259,59822,2420609
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AG(AX(AX((((i9.u4.turn_0==0)||(i0.i0.u1.flag_0_idle==0))||(i7.i1.u3.p25_1_2==0))))))
=> equivalent forward existential formula: [(EY(EY(FwdU(EY(Init),TRUE))) * !((((i9.u4.turn_0==0)||(i0.i0.u1.flag_0_idle==0))||(i7.i1.u3.p25_1_2==0))))] = F...159
(forward)formula 1,0,41.8702,625668,1,0,1.0659e+06,8142,2602,1.78788e+06,264,70871,3418687
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EG((i1.u8.p08_3_2==1)) U E(!(AG(!(((((i9.u4.turn_0==1)&&(i7.i1.u3.flag_0_waiting==1))&&(i9.u4.p25_2_4==1))||(i2.u6.p08_1_3==1))))) U !(...313
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(!(E(TRUE U !(!(((((i9.u4.turn_0==1)&&(i7.i1.u3.flag_0_waiting==1))&&(i9.u4.p25_2_4==1))||(i...1014
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t40, t41, t44, t45, t46, t47, t48, t49, t50, t51, t54, t55, t...1306
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 2,0,70.3087,1280492,1,0,2.27477e+06,31367,6795,3.72466e+06,678,174529,7412161
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AX(EF(((i6.i1.u5.flag_1_waiting==1)&&(i1.u15.p09_3_1==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U ((i6.i1.u5.flag_1_waiting==1)&&(i1.u15.p09_3_1==1)))))] = FALSE
(forward)formula 3,1,75.4994,1412228,1,0,2.54066e+06,31714,6799,4.05932e+06,678,177703,8093991
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((EF(((EG(((i11.i1.u2.turn_2==1)&&(i9.u46.p27_0==1))) * AX((((i11.i1.u2.turn_2==1)&&(i5.i0.u22.flag_2_idle==1))&&(i5.i0.u45.p25_0_3==1)...646
=> equivalent forward existential formula: ([((EY(Init) * E(TRUE U ((EG(((i11.i1.u2.turn_2==1)&&(i9.u46.p27_0==1))) * !(EX(!((((i11.i1.u2.turn_2==1)&&(i5.i...1500
(forward)formula 4,1,79.944,1514396,1,0,2.72847e+06,33320,6984,4.31629e+06,680,186684,8599038
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((AX(((i9.u4.turn_3==1)&&(i10.u55.p37_3_1==1))) * A((AG(EX(((i7.i1.u3.flag_0_waiting==1)&&(i3.u23.p15_0==1)))) * EF(!((((i11.i1.u2.turn...288
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EX(!(((i9.u4.turn_3==1)&&(i10.u55.p37_3_1==1)))))) * !(EG(!(EX(EX(((i5.i0.u45.flag_2_wai...522
(forward)formula 5,0,87.4963,1680452,1,0,3.0454e+06,33663,7151,4.7879e+06,689,187754,9636355
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AF(E((!(((i8.i1.u41.flag_1_idle==1)&&(i6.i0.u33.p18_3_1==1))) + EG((i5.i0.u36.p19_0_2==1))) U AF(((i8.i1.u41.flag_1_idle==1)&&(i11.i0...289
=> equivalent forward existential formula: [(FwdU(((FwdU((FwdU(Init,TRUE) * !(EG(!(E((!(((i8.i1.u41.flag_1_idle==1)&&(i6.i0.u33.p18_3_1==1))) + EG((i5.i0.u...367
(forward)formula 6,1,164.348,2204492,1,0,4.06133e+06,35546,4244,6.42073e+06,482,199228,3109754
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1716512382206

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="EisenbergMcGuire-PT-04"
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 EisenbergMcGuire-PT-04, 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 r158-smll-171636266300154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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