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-171636266300153.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300153
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1716510266272

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202405141337
[2024-05-24 00:24:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 00:24:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:24:29] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2024-05-24 00:24:29] [INFO ] Transformed 196 places.
[2024-05-24 00:24:29] [INFO ] Transformed 448 transitions.
[2024-05-24 00:24:29] [INFO ] Found NUPN structural information;
[2024-05-24 00:24:29] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 187 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 187 transition count 412
Applied a total of 18 rules in 104 ms. Remains 187 /196 variables (removed 9) and now considering 412/448 (removed 36) transitions.
[2024-05-24 00:24:29] [INFO ] Flow matrix only has 248 transitions (discarded 164 similar events)
// Phase 1: matrix 248 rows 187 cols
[2024-05-24 00:24:29] [INFO ] Computed 13 invariants in 38 ms
[2024-05-24 00:24:30] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-05-24 00:24:30] [INFO ] Flow matrix only has 248 transitions (discarded 164 similar events)
[2024-05-24 00:24:30] [INFO ] Invariant cache hit.
[2024-05-24 00:24:30] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-24 00:24:31] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2024-05-24 00:24:31] [INFO ] Flow matrix only has 248 transitions (discarded 164 similar events)
[2024-05-24 00:24:31] [INFO ] Invariant cache hit.
[2024-05-24 00:24:31] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-24 00:24:35] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 24 ms to minimize.
[2024-05-24 00:24:35] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:24:35] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:24:35] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-05-24 00:24:35] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:24:36] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 5 ms to minimize.
[2024-05-24 00:24:36] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 4 ms to minimize.
[2024-05-24 00:24:36] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 5 ms to minimize.
[2024-05-24 00:24:36] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:24:37] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 4 ms to minimize.
[2024-05-24 00:24:37] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 3 ms to minimize.
[2024-05-24 00:24:37] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 4 ms to minimize.
[2024-05-24 00:24:37] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:24:37] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:24:37] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:24:37] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 3 ms to minimize.
[2024-05-24 00:24:38] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:24:38] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:24:38] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:24:38] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-24 00:24:39] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:24:39] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-24 00:24:39] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:24:40] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 3 ms to minimize.
[2024-05-24 00:24:40] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:24:42] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:24:42] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:24:43] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-05-24 00:24:43] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 3 ms to minimize.
[2024-05-24 00:24:43] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
[2024-05-24 00:24:44] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 3 ms to minimize.
[2024-05-24 00:24:44] [INFO ] Deduced a trap composed of 60 places in 187 ms of which 3 ms to minimize.
[2024-05-24 00:24:44] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-24 00:24:48] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 5 ms to minimize.
[2024-05-24 00:24:48] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 3 ms to minimize.
[2024-05-24 00:24:48] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-24 00:24:49] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:24:49] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:24:49] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:24:50] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:24:50] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:24:50] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:24:50] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:24:51] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:24:51] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:24:51] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:24:51] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:24:52] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:24:52] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-05-24 00:24:52] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 4 ms to minimize.
[2024-05-24 00:24:52] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:24:52] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 3 ms to minimize.
[2024-05-24 00:24:53] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-24 00:24:53] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 3 ms to minimize.
[2024-05-24 00:24:54] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 7 ms to minimize.
[2024-05-24 00:24:54] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:24:55] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 13 ms to minimize.
[2024-05-24 00:24:57] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:24:58] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:24:58] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 187/435 variables, and 73 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/187 constraints, ReadFeed: 0/85 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-24 00:25:03] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:25:04] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 3 ms to minimize.
[2024-05-24 00:25:04] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 2 ms to minimize.
[2024-05-24 00:25:04] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 3 ms to minimize.
[2024-05-24 00:25:05] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 4 ms to minimize.
[2024-05-24 00:25:05] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:25:05] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:25:05] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:25:06] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-24 00:25:09] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-24 00:25:14] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-05-24 00:25:15] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 3 ms to minimize.
[2024-05-24 00:25:15] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:25:15] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:25:15] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-24 00:25:15] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:25:16] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 3 ms to minimize.
[2024-05-24 00:25:16] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:25:16] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:25:16] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:25:16] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:25:17] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 2 ms to minimize.
[2024-05-24 00:25:17] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:25:18] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:25:18] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:25:18] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-24 00:25:20] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:25:22] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-24 00:25:27] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:25:27] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 3 ms to minimize.
[2024-05-24 00:25:28] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
[2024-05-24 00:25:28] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/435 variables, and 105 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/187 constraints, ReadFeed: 0/85 constraints, PredecessorRefiner: 0/408 constraints, Known Traps: 92/92 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60422ms
Starting structural reductions in LTL mode, iteration 1 : 187/196 places, 412/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61931 ms. Remains : 187/196 places, 412/448 transitions.
Support contains 58 out of 187 places after structural reductions.
[2024-05-24 00:25:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-24 00:25:31] [INFO ] Flatten gal took : 118 ms
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 00:25:32] [INFO ] Flatten gal took : 66 ms
[2024-05-24 00:25:32] [INFO ] Input system was already deterministic with 412 transitions.
Support contains 51 out of 187 places (down from 58) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2441 ms. (16 steps per ms) remains 12/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
[2024-05-24 00:25:33] [INFO ] Flow matrix only has 248 transitions (discarded 164 similar events)
[2024-05-24 00:25:33] [INFO ] Invariant cache hit.
[2024-05-24 00:25:33] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 153/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 7/183 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 248/431 variables, 183/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 85/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4/435 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/435 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 285 constraints, problems are : Problem set: 0 solved, 10 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 187/187 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 153/176 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 7/183 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 3 ms to minimize.
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Problem AtomicPropp21 is UNSAT
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:25:35] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:25:36] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 9/21 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 248/431 variables, 183/204 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 85/289 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/295 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 00:25:36] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:25:36] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:25:36] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 3/298 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/298 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/302 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 1/303 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 2/305 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/435 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 305 constraints, problems are : Problem set: 2 solved, 8 unsolved in 2481 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 187/187 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 12/12 constraints]
After SMT, in 3446ms problems are : Problem set: 2 solved, 8 unsolved
Parikh walk visited 4 properties in 2997 ms.
Support contains 8 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 412/412 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 187 transition count 409
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 184 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 183 transition count 408
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 8 place count 183 transition count 364
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 96 place count 139 transition count 364
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 136 transition count 352
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 136 transition count 352
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 3 with 24 rules applied. Total rules applied 126 place count 124 transition count 340
Applied a total of 126 rules in 79 ms. Remains 124 /187 variables (removed 63) and now considering 340/412 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 124/187 places, 340/412 transitions.
RANDOM walk for 40000 steps (8 resets) in 454 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 4528 steps, run visited all 4 properties in 97 ms. (steps per millisecond=46 )
Probabilistic random walk after 4528 steps, saw 2175 distinct states, run finished after 113 ms. (steps per millisecond=40 ) properties seen :4
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2024-05-24 00:25:41] [INFO ] Flatten gal took : 40 ms
[2024-05-24 00:25:41] [INFO ] Flatten gal took : 47 ms
[2024-05-24 00:25:41] [INFO ] Input system was already deterministic with 412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 400
Applied a total of 6 rules in 32 ms. Remains 184 /187 variables (removed 3) and now considering 400/412 (removed 12) transitions.
[2024-05-24 00:25:41] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 00:25:41] [INFO ] Computed 13 invariants in 8 ms
[2024-05-24 00:25:41] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-24 00:25:41] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:25:41] [INFO ] Invariant cache hit.
[2024-05-24 00:25:41] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:25:42] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:25:42] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:25:42] [INFO ] Invariant cache hit.
[2024-05-24 00:25:42] [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:25:45] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 3 ms to minimize.
[2024-05-24 00:25:45] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:25:46] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:25:46] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 4 ms to minimize.
[2024-05-24 00:25:46] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:25:46] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:25:47] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2024-05-24 00:25:47] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-05-24 00:25:47] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:25:47] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:25:47] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 3 ms to minimize.
[2024-05-24 00:25:47] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 3 ms to minimize.
[2024-05-24 00:25:47] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-24 00:25:47] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:25:48] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:25:48] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:25:48] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:25:48] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:25:48] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 3 ms to minimize.
[2024-05-24 00:25:49] [INFO ] Deduced a trap composed of 53 places in 145 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:25:49] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:25:49] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:25:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-05-24 00:25:50] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-05-24 00:25:50] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-05-24 00:25:50] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
[2024-05-24 00:25:50] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:25:51] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 4 ms to minimize.
[2024-05-24 00:25:51] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 3 ms to minimize.
[2024-05-24 00:25:51] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2024-05-24 00:25:51] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2024-05-24 00:25:51] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
[2024-05-24 00:25:52] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 4 ms to minimize.
[2024-05-24 00:25:52] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2024-05-24 00:25:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:25:52] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:25:55] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2024-05-24 00:25:55] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:25:55] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 5 ms to minimize.
[2024-05-24 00:25:55] [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:25:59] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:25:59] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:26:00] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:26:01] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 2 ms to minimize.
[2024-05-24 00:26:01] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-05-24 00:26:01] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 4 ms to minimize.
[2024-05-24 00:26:01] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 4 ms to minimize.
[2024-05-24 00:26:02] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
[2024-05-24 00:26:02] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:26:02] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:26:03] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:26:03] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:26:03] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 2 ms to minimize.
[2024-05-24 00:26:04] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:26:04] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2024-05-24 00:26:05] [INFO ] Deduced a trap composed of 44 places in 148 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:26:06] [INFO ] Deduced a trap composed of 45 places in 152 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
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 30019 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:26:14] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:26:14] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:26:14] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-05-24 00:26:14] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 3 ms to minimize.
[2024-05-24 00:26:15] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 4 ms to minimize.
[2024-05-24 00:26:15] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-24 00:26:15] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 3 ms to minimize.
[2024-05-24 00:26:15] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:26:15] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:26:18] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 3 ms to minimize.
[2024-05-24 00:26:19] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 4 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:26:20] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:26:21] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 3 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:26:33] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:26:33] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:26:33] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:26:33] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
[2024-05-24 00:26:34] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-05-24 00:26:34] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 3 ms to minimize.
[2024-05-24 00:26:34] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:26:34] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:26:34] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:26:35] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:26:38] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:26:38] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:26:38] [INFO ] Deduced a trap composed of 71 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:26:38] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 3 ms to minimize.
[2024-05-24 00:26:39] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:26:40] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-24 00:26:40] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:26:41] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:26:41] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:26:41] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 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 30021 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 60267ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Starting structural reductions in LTL mode, iteration 1 : 184/187 places, 400/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61312 ms. Remains : 184/187 places, 400/412 transitions.
[2024-05-24 00:26:42] [INFO ] Flatten gal took : 36 ms
[2024-05-24 00:26:42] [INFO ] Flatten gal took : 36 ms
[2024-05-24 00:26:42] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:26:42] [INFO ] Flatten gal took : 32 ms
[2024-05-24 00:26:42] [INFO ] Flatten gal took : 31 ms
[2024-05-24 00:26:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2512964404439729445.gal : 26 ms
[2024-05-24 00:26:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality11149432879472049474.ctl : 5 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/CTLCardinality2512964404439729445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11149432879472049474.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:27:13] [INFO ] Flatten gal took : 20 ms
[2024-05-24 00:27:13] [INFO ] Applying decomposition
[2024-05-24 00:27:13] [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/graph2368851834257879609.txt' '-o' '/tmp/graph2368851834257879609.bin' '-w' '/tmp/graph2368851834257879609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2368851834257879609.bin' '-l' '-1' '-v' '-w' '/tmp/graph2368851834257879609.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:27:13] [INFO ] Decomposing Gal with order
[2024-05-24 00:27:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:27:13] [INFO ] Removed a total of 528 redundant transitions.
[2024-05-24 00:27:13] [INFO ] Flatten gal took : 130 ms
[2024-05-24 00:27:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 33 ms.
[2024-05-24 00:27:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality8184357333395145447.gal : 15 ms
[2024-05-24 00:27:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality1684508942812781521.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/CTLCardinality8184357333395145447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1684508942812781521.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,17.6821,347548,8271,1633,563979,23083,1051,1.03311e+06,185,189184,0


Converting to forward existential form...Done !
original formula: EF(((i9.i0.u33.p19_2_1==1) + EF(AX(FALSE))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (i9.i0.u33.p19_2_1==1))] != FALSE + [(FwdU(FwdU(Init,TRUE),TRUE) * !(EX(!(FALSE))))] != FAL...158
(forward)formula 0,1,17.7656,347548,1,0,563979,23083,1056,1.03311e+06,188,189184,223
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 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 187 transition count 409
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 184 transition count 409
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 6 place count 184 transition count 360
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 104 place count 135 transition count 360
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 133 transition count 352
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 133 transition count 352
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 132 place count 121 transition count 340
Applied a total of 132 rules in 70 ms. Remains 121 /187 variables (removed 66) and now considering 340/412 (removed 72) transitions.
[2024-05-24 00:27:31] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
// Phase 1: matrix 176 rows 121 cols
[2024-05-24 00:27:31] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:27:31] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-24 00:27:31] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
[2024-05-24 00:27:31] [INFO ] Invariant cache hit.
[2024-05-24 00:27:31] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 00:27:31] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-05-24 00:27:31] [INFO ] Redundant transitions in 22 ms returned []
Running 336 sub problems to find dead transitions.
[2024-05-24 00:27:31] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
[2024-05-24 00:27:31] [INFO ] Invariant cache hit.
[2024-05-24 00:27:31] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:27:33] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 3 ms to minimize.
[2024-05-24 00:27:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:27:34] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:27:34] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 6 ms to minimize.
[2024-05-24 00:27:34] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:27:34] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:27:34] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-24 00:27:34] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:27:35] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:27:35] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:27:35] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:27:35] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:27:35] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-24 00:27:35] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:27:36] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:27:36] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 3 ms to minimize.
[2024-05-24 00:27:36] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:27:36] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:27:36] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:27:36] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:27:38] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:27:38] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:27:38] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:27:38] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:27:39] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:27:39] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-24 00:27:39] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:27:43] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:27:43] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:27:43] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:27:43] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:27:44] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:27:44] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:27:46] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:27:46] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:27:46] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 4 ms to minimize.
[2024-05-24 00:27:47] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:27:49] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:27:49] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:27:50] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:27:53] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:27:54] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 176/297 variables, 121/176 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 79/255 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:28:01] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:28:01] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/297 variables, and 257 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 121/121 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:28:04] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-24 00:28:04] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:28:04] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:28:04] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:28:04] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 3 ms to minimize.
[2024-05-24 00:28:05] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:28:05] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:28:06] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:28:06] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:28:08] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:28:08] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:28:10] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 3 ms to minimize.
[2024-05-24 00:28:10] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:28:11] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:28:12] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:28:12] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:28:12] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:28:12] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (OVERLAPS) 176/297 variables, 121/196 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 79/275 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 336/611 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-24 00:28:22] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:28:22] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:28:25] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 3/614 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/297 variables, and 614 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 121/121 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 65/65 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in SI_CTL mode, iteration 1 : 121/187 places, 340/412 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60721 ms. Remains : 121/187 places, 340/412 transitions.
[2024-05-24 00:28:32] [INFO ] Flatten gal took : 22 ms
[2024-05-24 00:28:32] [INFO ] Flatten gal took : 25 ms
[2024-05-24 00:28:32] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-24 00:28:32] [INFO ] Flatten gal took : 23 ms
[2024-05-24 00:28:32] [INFO ] Flatten gal took : 22 ms
[2024-05-24 00:28:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality11419619838397892274.gal : 8 ms
[2024-05-24 00:28:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality11010420067277992012.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/CTLCardinality11419619838397892274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11010420067277992012.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:29:02] [INFO ] Flatten gal took : 23 ms
[2024-05-24 00:29:02] [INFO ] Applying decomposition
[2024-05-24 00:29:02] [INFO ] Flatten gal took : 23 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/graph2595223461273018283.txt' '-o' '/tmp/graph2595223461273018283.bin' '-w' '/tmp/graph2595223461273018283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2595223461273018283.bin' '-l' '-1' '-v' '-w' '/tmp/graph2595223461273018283.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:29:02] [INFO ] Decomposing Gal with order
[2024-05-24 00:29:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:29:02] [INFO ] Removed a total of 494 redundant transitions.
[2024-05-24 00:29:02] [INFO ] Flatten gal took : 72 ms
[2024-05-24 00:29:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 21 ms.
[2024-05-24 00:29:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality2146184688650216612.gal : 8 ms
[2024-05-24 00:29:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality13879059444756660776.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/CTLCardinality2146184688650216612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13879059444756660776.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,186393,11.0522,178388,5974,944,254397,4005,884,571939,164,76757,0


Converting to forward existential form...Done !
original formula: E(AG((((i10.i0.u33.p27_0==0) + AF((i10.i0.u17.p19_0_1==0))) + (EG((i2.u9.p10_3_1!=1)) * ((i9.u1.p25_0_1==0)||(i5.u16.p18_1_1==1))))) U !(...233
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !((((i10.i0.u33.p27_0==0) + !(EG(!((i10.i0.u17.p19_0_1==0))))) + (EG((i2.u9.p10_3_1!=1)) ...297
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t24, t25, t26, t27, t43, t44, t45, t46, t47, t55, t56, t57, t...1202
Fast SCC detection found an SCC at level 3
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
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,27.1676,385248,1,0,571842,31526,4795,1.31932e+06,711,197624,2580615
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 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 187 transition count 410
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 185 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 183 transition count 408
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 8 place count 183 transition count 364
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 96 place count 139 transition count 364
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 137 transition count 356
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 137 transition count 356
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 3 with 24 rules applied. Total rules applied 124 place count 125 transition count 344
Applied a total of 124 rules in 50 ms. Remains 125 /187 variables (removed 62) and now considering 344/412 (removed 68) transitions.
[2024-05-24 00:29:29] [INFO ] Flow matrix only has 180 transitions (discarded 164 similar events)
// Phase 1: matrix 180 rows 125 cols
[2024-05-24 00:29:29] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:29:30] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-24 00:29:30] [INFO ] Flow matrix only has 180 transitions (discarded 164 similar events)
[2024-05-24 00:29:30] [INFO ] Invariant cache hit.
[2024-05-24 00:29:30] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 00:29:30] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-24 00:29:30] [INFO ] Redundant transitions in 11 ms returned []
Running 340 sub problems to find dead transitions.
[2024-05-24 00:29:30] [INFO ] Flow matrix only has 180 transitions (discarded 164 similar events)
[2024-05-24 00:29:30] [INFO ] Invariant cache hit.
[2024-05-24 00:29:30] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-24 00:29:32] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 2 ms to minimize.
[2024-05-24 00:29:32] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 00:29:32] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:29:33] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:29:33] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:29:33] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:29:33] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:29:33] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:29:33] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:29:33] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:29:34] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:29:34] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:29:34] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:29:34] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:29:34] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:29:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
[2024-05-24 00:29:34] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:29:34] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:29:35] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-24 00:29:35] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-24 00:29:35] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:29:35] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:29:36] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:29:36] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:29:36] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-05-24 00:29:36] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-05-24 00:29:37] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-05-24 00:29:37] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:29:37] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:29:37] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:29:37] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 2 ms to minimize.
[2024-05-24 00:29:37] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2024-05-24 00:29:38] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:29:38] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-05-24 00:29:38] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:29:38] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:29:38] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-24 00:29:38] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:29:38] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:29:39] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-24 00:29:41] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-24 00:29:41] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-24 00:29:43] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:29:43] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 180/305 variables, 125/182 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 79/261 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-24 00:29:51] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
[2024-05-24 00:29:51] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:29:51] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-24 00:29:58] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/305 variables, and 265 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 125/125 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-24 00:30:01] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-24 00:30:01] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-24 00:30:02] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 5 ms to minimize.
[2024-05-24 00:30:02] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:30:03] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-24 00:30:03] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:30:03] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:30:03] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:30:04] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-24 00:30:06] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-24 00:30:06] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:30:06] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:30:07] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:30:07] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:30:08] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-05-24 00:30:08] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 180/305 variables, 125/202 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 79/281 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 340/621 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-24 00:30:18] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 622 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 125/125 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 65/65 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Starting structural reductions in SI_CTL mode, iteration 1 : 125/187 places, 344/412 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60779 ms. Remains : 125/187 places, 344/412 transitions.
[2024-05-24 00:30:30] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:30:30] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:30:30] [INFO ] Input system was already deterministic with 344 transitions.
[2024-05-24 00:30:30] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:30:30] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:30:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality18116425653554751090.gal : 4 ms
[2024-05-24 00:30:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality8783719407749925045.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/CTLCardinality18116425653554751090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8783719407749925045.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,185305,27.3797,572012,2,78071,5,1.30238e+06,6,0,847,1.4341e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 00:31:00] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:31:00] [INFO ] Applying decomposition
[2024-05-24 00:31:00] [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/graph7791083177255471063.txt' '-o' '/tmp/graph7791083177255471063.bin' '-w' '/tmp/graph7791083177255471063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7791083177255471063.bin' '-l' '-1' '-v' '-w' '/tmp/graph7791083177255471063.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:31:00] [INFO ] Decomposing Gal with order
[2024-05-24 00:31:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:31:00] [INFO ] Removed a total of 516 redundant transitions.
[2024-05-24 00:31:00] [INFO ] Flatten gal took : 31 ms
[2024-05-24 00:31:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 12 ms.
[2024-05-24 00:31:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality11242712044122289688.gal : 5 ms
[2024-05-24 00:31:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality13126368610186532792.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/CTLCardinality11242712044122289688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13126368610186532792.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,185305,12.6987,228300,9585,1382,289617,9151,930,1.01162e+06,172,129280,0


Converting to forward existential form...Done !
original formula: E((EF(((i4.u11.p34_0_2==0)||(i10.u15.p33_3_3==1))) * ((i8.i0.u20.p18_3_1==1) + (AG(((i8.i0.u18.p18_3_0==0)||(i9.i0.u3.flag_0_waiting==1))...337
=> equivalent forward existential formula: [((FwdU((FwdU(Init,(E(TRUE U ((i4.u11.p34_0_2==0)||(i10.u15.p33_3_3==1))) * ((i8.i0.u20.p18_3_1==1) + (!(E(TRUE ...423
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t24, t25, t26, t27, t44, t45, t46, t57, t58, t59, t60, t61, t63, ...1147
(forward)formula 0,0,19.5629,252496,1,0,289617,35320,3992,1.244e+06,694,224606,1711933
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 400
Applied a total of 6 rules in 16 ms. Remains 184 /187 variables (removed 3) and now considering 400/412 (removed 12) transitions.
[2024-05-24 00:31:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 00:31:20] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:31:20] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-24 00:31:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:31:20] [INFO ] Invariant cache hit.
[2024-05-24 00:31:21] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:31:21] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:31:21] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:31:21] [INFO ] Invariant cache hit.
[2024-05-24 00:31: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:31:24] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:31:24] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-24 00:31:24] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-24 00:31:24] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:31:24] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:31:24] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:31:25] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:31:25] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:31:25] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2024-05-24 00:31:25] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 3 ms to minimize.
[2024-05-24 00:31:25] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2024-05-24 00:31:25] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:31:25] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:31:25] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:31:26] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:31:26] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:31:26] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 4 ms to minimize.
[2024-05-24 00:31:26] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:31:26] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:31:26] [INFO ] Deduced a trap composed of 53 places in 148 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:27] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:31:27] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-05-24 00:31:27] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-24 00:31:27] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:31:28] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:31:28] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2024-05-24 00:31:28] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-24 00:31:28] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:31:28] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 3 ms to minimize.
[2024-05-24 00:31:28] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2024-05-24 00:31:28] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:31:29] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:31:29] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:31:29] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2024-05-24 00:31:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:31:29] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:31:31] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:31:32] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:31:32] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:31:32] [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:31:35] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:31:35] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2024-05-24 00:31:36] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-24 00:31:36] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:31:37] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 2 ms to minimize.
[2024-05-24 00:31:37] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:31:37] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:31:37] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2024-05-24 00:31:37] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:31:38] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:31:38] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:31:38] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:31:38] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:31:39] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:31:39] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 2 ms to minimize.
[2024-05-24 00:31:39] [INFO ] Deduced a trap composed of 44 places in 129 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:31:40] [INFO ] Deduced a trap composed of 45 places in 129 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:31:46] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:31:47] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2024-05-24 00:31:47] [INFO ] Deduced a trap composed of 48 places in 162 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:31:51] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:31:51] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 3 ms to minimize.
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 30019 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:31:53] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:31:53] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:31:53] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 3 ms to minimize.
[2024-05-24 00:31:53] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 3 ms to minimize.
[2024-05-24 00:31:54] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:31:57] [INFO ] Deduced a trap composed of 47 places in 103 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:31:58] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 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:32:02] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:32:02] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 3 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:32:16] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 4 ms to minimize.
[2024-05-24 00:32:16] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:32:17] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2024-05-24 00:32:17] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:32:19] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:32:20] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:32:21] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:32:21] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:32:21] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 4 ms to minimize.
SMT process timed out in 60365ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Starting structural reductions in LTL mode, iteration 1 : 184/187 places, 400/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61114 ms. Remains : 184/187 places, 400/412 transitions.
[2024-05-24 00:32:21] [INFO ] Flatten gal took : 19 ms
[2024-05-24 00:32:21] [INFO ] Flatten gal took : 19 ms
[2024-05-24 00:32:21] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:32:21] [INFO ] Flatten gal took : 19 ms
[2024-05-24 00:32:21] [INFO ] Flatten gal took : 19 ms
[2024-05-24 00:32:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4203924692618206035.gal : 5 ms
[2024-05-24 00:32:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13629745219665216097.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/CTLCardinality4203924692618206035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13629745219665216097.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:32:52] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:32:52] [INFO ] Applying decomposition
[2024-05-24 00:32:52] [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/graph8989713597953797357.txt' '-o' '/tmp/graph8989713597953797357.bin' '-w' '/tmp/graph8989713597953797357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8989713597953797357.bin' '-l' '-1' '-v' '-w' '/tmp/graph8989713597953797357.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:32:52] [INFO ] Decomposing Gal with order
[2024-05-24 00:32:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:32:52] [INFO ] Removed a total of 523 redundant transitions.
[2024-05-24 00:32:52] [INFO ] Flatten gal took : 31 ms
[2024-05-24 00:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 13 ms.
[2024-05-24 00:32:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14545642886438003748.gal : 13 ms
[2024-05-24 00:32:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality15727360262912680937.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/CTLCardinality14545642886438003748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15727360262912680937.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,21.3871,308132,8071,982,463396,7553,949,924303,190,81467,0


Converting to forward existential form...Done !
original formula: ((AG(EF(((i3.u6.p09_2_1==0)||(i0.u1.flag_3_waiting==1)))) + EF(EX((i2.u13.p12_1_2==1)))) + (AG(EX((((i9.u31.p19_1_3==0)||(i4.u8.p08_3_2==...231
=> equivalent forward existential formula: [FwdG(((Init * !((!(E(TRUE U !(E(TRUE U ((i3.u6.p09_2_1==0)||(i0.u1.flag_3_waiting==1)))))) + E(TRUE U EX((i2.u1...318
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...1201
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
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,26.829,308396,1,0,463396,40907,4444,1.04846e+06,874,205415,1589574
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 404
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 404
Applied a total of 4 rules in 15 ms. Remains 185 /187 variables (removed 2) and now considering 404/412 (removed 8) transitions.
[2024-05-24 00:33:19] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-05-24 00:33:19] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 00:33:19] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-24 00:33:19] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 00:33:19] [INFO ] Invariant cache hit.
[2024-05-24 00:33:19] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-24 00:33:19] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-24 00:33:19] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-24 00:33:19] [INFO ] Invariant cache hit.
[2024-05-24 00:33:19] [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:33:22] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-24 00:33:22] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:33:22] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:33:23] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:33:23] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:33:23] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 4 ms to minimize.
[2024-05-24 00:33:23] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:33:23] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:33:24] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:33:24] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:33:24] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:33:24] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 3 ms to minimize.
[2024-05-24 00:33:24] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:33:24] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:33:24] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:33:25] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:33:25] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 3 ms to minimize.
[2024-05-24 00:33:25] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:33:25] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:33:25] [INFO ] Deduced a trap composed of 3 places in 32 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:33:25] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:33:26] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 00:33:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-24 00:33:26] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:33:26] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:33:26] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:33:27] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:33:27] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:33:27] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2024-05-24 00:33:27] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:33:28] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:33:28] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:33:28] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:33:28] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-24 00:33:29] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:33:29] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2024-05-24 00:33:30] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:33:30] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:33:30] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:33:30] [INFO ] Deduced a trap composed of 66 places in 97 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:33:34] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:33:34] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:33:34] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:33:34] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:33:34] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-24 00:33:35] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-05-24 00:33:35] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:33:35] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:33:35] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:33:36] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:33:36] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:33:37] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 3 ms to minimize.
[2024-05-24 00:33:37] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:33:40] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
[2024-05-24 00:33:40] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:33:41] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:33:41] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-24 00:33:41] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:33:41] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:33:42] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 3 ms to minimize.
[2024-05-24 00:33:42] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:33:43] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:33:43] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-24 00:33:43] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:33:48] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 3 ms to minimize.
[2024-05-24 00:33:48] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 3 ms to minimize.
[2024-05-24 00:33:48] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-05-24 00:33:49] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:33:49] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/425 variables, and 82 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 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: 69/69 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, 69/82 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:33:51] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:33:53] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:33:53] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:33:54] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:33:54] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-05-24 00:33:54] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 3 ms to minimize.
[2024-05-24 00:33:54] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 3 ms to minimize.
[2024-05-24 00:33:54] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
[2024-05-24 00:33:55] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:33:55] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:33:55] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 4 ms to minimize.
[2024-05-24 00:33:55] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 4 ms to minimize.
[2024-05-24 00:33:56] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 3 ms to minimize.
[2024-05-24 00:33:56] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2024-05-24 00:33:56] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:33:56] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:33:56] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:33:57] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 4 ms to minimize.
[2024-05-24 00:33:57] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 4 ms to minimize.
[2024-05-24 00:33:57] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:33:58] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:34:00] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 3 ms to minimize.
[2024-05-24 00:34:00] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:34:00] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 4 ms to minimize.
[2024-05-24 00:34:00] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:34:01] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-05-24 00:34:01] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 3 ms to minimize.
[2024-05-24 00:34:01] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:34:02] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-05-24 00:34:02] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:34:03] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 11/113 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:34:07] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:34:09] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:34:09] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 3 ms to minimize.
[2024-05-24 00:34:10] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:34:11] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
[2024-05-24 00:34:11] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 3 ms to minimize.
[2024-05-24 00:34:12] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:34:12] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 4 ms to minimize.
[2024-05-24 00:34:12] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:34:12] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:34:13] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 3 ms to minimize.
[2024-05-24 00:34:14] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:34:14] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-24 00:34:16] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-05-24 00:34:17] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-05-24 00:34:17] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 2 ms to minimize.
[2024-05-24 00:34:17] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 3 ms to minimize.
[2024-05-24 00:34:17] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/425 variables, and 131 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30027 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: 0/400 constraints, Known Traps: 118/118 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in LTL mode, iteration 1 : 185/187 places, 404/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61014 ms. Remains : 185/187 places, 404/412 transitions.
[2024-05-24 00:34:20] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:34:20] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:34:20] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-24 00:34:20] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:34:20] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:34:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality1056529041245336657.gal : 5 ms
[2024-05-24 00:34:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality10096583537279268316.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/CTLCardinality1056529041245336657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10096583537279268316.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:34:50] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:34:50] [INFO ] Applying decomposition
[2024-05-24 00:34:50] [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/graph157673852484044643.txt' '-o' '/tmp/graph157673852484044643.bin' '-w' '/tmp/graph157673852484044643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph157673852484044643.bin' '-l' '-1' '-v' '-w' '/tmp/graph157673852484044643.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:34:50] [INFO ] Decomposing Gal with order
[2024-05-24 00:34:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:34:50] [INFO ] Removed a total of 510 redundant transitions.
[2024-05-24 00:34:50] [INFO ] Flatten gal took : 30 ms
[2024-05-24 00:34:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 12 ms.
[2024-05-24 00:34:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality13051157477987597032.gal : 19 ms
[2024-05-24 00:34:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7783532732670886360.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/CTLCardinality13051157477987597032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7783532732670886360.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.23871e+06,14.0659,257740,8473,1616,382532,13938,1017,843598,190,179179,0


Converting to forward existential form...Done !
original formula: EF((AG(EF(((i8.i1.u32.p19_2_0==0)&&(i5.u46.p33_1_0==1)))) * A(E(EX((i1.u4.p09_0_2==0)) U (i8.i0.u29.p17_1==1)) U (AF(((i5.u20.p34_1_0==0)...204
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U ((i8.i1.u32.p19_2_0==0)&&(i5.u46.p33_1_0==1))))))) * !(EG(!((!(EG(!(...464
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...1271
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 3
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 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 187 transition count 408
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 183 transition count 408
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 183 transition count 357
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 132 transition count 357
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 129 transition count 345
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 129 transition count 345
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 118 transition count 334
Applied a total of 138 rules in 36 ms. Remains 118 /187 variables (removed 69) and now considering 334/412 (removed 78) transitions.
[2024-05-24 00:35:20] [INFO ] Flow matrix only has 170 transitions (discarded 164 similar events)
// Phase 1: matrix 170 rows 118 cols
[2024-05-24 00:35:20] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 00:35:20] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-24 00:35:20] [INFO ] Flow matrix only has 170 transitions (discarded 164 similar events)
[2024-05-24 00:35:20] [INFO ] Invariant cache hit.
[2024-05-24 00:35:20] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:35:21] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-24 00:35:21] [INFO ] Redundant transitions in 6 ms returned []
Running 330 sub problems to find dead transitions.
[2024-05-24 00:35:21] [INFO ] Flow matrix only has 170 transitions (discarded 164 similar events)
[2024-05-24 00:35:21] [INFO ] Invariant cache hit.
[2024-05-24 00:35:21] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:35:23] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:35:23] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:35:23] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:35:23] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:35:23] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:35:23] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:35:23] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2024-05-24 00:35:24] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:35:24] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:35:24] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:35:24] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-24 00:35:24] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-05-24 00:35:24] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-24 00:35:24] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:35:24] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-24 00:35:25] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-24 00:35:25] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-24 00:35:25] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:35:25] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 2 ms to minimize.
[2024-05-24 00:35:25] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:35:26] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:35:26] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:35:27] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:35:27] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-24 00:35:27] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:35:27] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:35:27] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-24 00:35:27] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:35:27] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:35:27] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 1 ms to minimize.
[2024-05-24 00:35:28] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-24 00:35:28] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:35:28] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:35:28] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:35:31] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:35:31] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:35:31] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:35:32] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:35:32] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:35:32] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:35:32] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:35:32] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:35:35] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:35:36] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-24 00:35:37] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:35:37] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:35:37] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:35:37] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:35:41] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:35:41] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:35:41] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:35:41] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:35:41] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:35:42] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 170/288 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 76/261 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 288/288 variables, and 261 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:35:53] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-24 00:35:54] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:35:54] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:35:56] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:35:58] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-24 00:35:58] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:35:58] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-24 00:35:58] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-24 00:35:59] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:35:59] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:35:59] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-24 00:35:59] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-24 00:35:59] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 170/288 variables, 118/198 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 76/274 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 330/604 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:36:07] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-24 00:36:13] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/288 variables, and 606 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 69/69 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in SI_CTL mode, iteration 1 : 118/187 places, 334/412 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60759 ms. Remains : 118/187 places, 334/412 transitions.
[2024-05-24 00:36:21] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:36:21] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:36:21] [INFO ] Input system was already deterministic with 334 transitions.
[2024-05-24 00:36:21] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:36:21] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:36:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality6485388466646578439.gal : 5 ms
[2024-05-24 00:36:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality3764855296371437712.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/CTLCardinality6485388466646578439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3764855296371437712.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:36:51] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:36:51] [INFO ] Applying decomposition
[2024-05-24 00:36:51] [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/graph12250398948638784822.txt' '-o' '/tmp/graph12250398948638784822.bin' '-w' '/tmp/graph12250398948638784822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12250398948638784822.bin' '-l' '-1' '-v' '-w' '/tmp/graph12250398948638784822.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:36:51] [INFO ] Decomposing Gal with order
[2024-05-24 00:36:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:36:51] [INFO ] Removed a total of 496 redundant transitions.
[2024-05-24 00:36:51] [INFO ] Flatten gal took : 26 ms
[2024-05-24 00:36:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 7 ms.
[2024-05-24 00:36:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality18095797125752983161.gal : 3 ms
[2024-05-24 00:36:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality10897158048807942042.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/CTLCardinality18095797125752983161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10897158048807942042.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,153983,16.8527,206016,6798,1027,245633,5132,939,813523,177,62536,0


Converting to forward existential form...Done !
original formula: EF((AG(EF(AG((i8.u25.p34_2_3!=0)))) * EG(EF((i1.u8.p12_2_1==0)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(E(TRUE U !((i8.u25.p34_2_3!=0))))))))),E(TRUE U (i1.u8.p12_2_1=...170
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t...1099
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
(forward)formula 0,0,22.0578,206808,1,0,245633,22653,4393,966358,735,134647,1233193
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 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 187 transition count 408
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 183 transition count 408
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 8 place count 183 transition count 360
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 104 place count 135 transition count 360
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 132 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 132 transition count 348
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 132 place count 121 transition count 337
Applied a total of 132 rules in 21 ms. Remains 121 /187 variables (removed 66) and now considering 337/412 (removed 75) transitions.
[2024-05-24 00:37:13] [INFO ] Flow matrix only has 173 transitions (discarded 164 similar events)
// Phase 1: matrix 173 rows 121 cols
[2024-05-24 00:37:13] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 00:37:14] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-24 00:37:14] [INFO ] Flow matrix only has 173 transitions (discarded 164 similar events)
[2024-05-24 00:37:14] [INFO ] Invariant cache hit.
[2024-05-24 00:37:14] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:37:14] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2024-05-24 00:37:14] [INFO ] Redundant transitions in 5 ms returned []
Running 333 sub problems to find dead transitions.
[2024-05-24 00:37:14] [INFO ] Flow matrix only has 173 transitions (discarded 164 similar events)
[2024-05-24 00:37:14] [INFO ] Invariant cache hit.
[2024-05-24 00:37:14] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:16] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:37:17] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:37:17] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-24 00:37:17] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:37:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:37:17] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:37:18] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:37:18] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:37:18] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:37:18] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:37:18] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:37:19] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:37:19] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:37:19] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:37:19] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 3 ms to minimize.
[2024-05-24 00:37:19] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-24 00:37:19] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-05-24 00:37:20] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:37:20] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:37:20] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:20] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:37:20] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:37:21] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-24 00:37:21] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-24 00:37:22] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:37:22] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:37:22] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-24 00:37:22] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:37:22] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:25] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-24 00:37:26] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:27] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:37:27] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:37:28] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:37:28] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:37:28] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:37:28] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:30] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:37:30] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-24 00:37:30] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:34] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:37:34] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:37:35] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:36] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:39] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:37:39] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:43] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/294 variables, and 60 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/121 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:45] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:37:46] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-24 00:37:46] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:37:46] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:49] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:37:49] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:37:49] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (OVERLAPS) 173/294 variables, 121/188 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 76/264 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 333/597 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:37:57] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-24 00:37:58] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:37:59] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:37:59] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-24 00:38:02] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:38:04] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-24 00:38:05] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-24 00:38:05] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 3/605 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-24 00:38:14] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-24 00:38:14] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/294 variables, and 607 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 121/121 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 64/64 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in SI_CTL mode, iteration 1 : 121/187 places, 337/412 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60982 ms. Remains : 121/187 places, 337/412 transitions.
[2024-05-24 00:38:14] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:38:14] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:38:14] [INFO ] Input system was already deterministic with 337 transitions.
[2024-05-24 00:38:14] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:38:14] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:38:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality7099127090971545286.gal : 2 ms
[2024-05-24 00:38:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality10607271086789214932.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/CTLCardinality7099127090971545286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10607271086789214932.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,183955,25.9855,548492,2,73622,5,1.23271e+06,6,0,824,1.37143e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 00:38:44] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:38:44] [INFO ] Applying decomposition
[2024-05-24 00:38:44] [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/graph7212408180276672990.txt' '-o' '/tmp/graph7212408180276672990.bin' '-w' '/tmp/graph7212408180276672990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7212408180276672990.bin' '-l' '-1' '-v' '-w' '/tmp/graph7212408180276672990.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:38:45] [INFO ] Decomposing Gal with order
[2024-05-24 00:38:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:38:45] [INFO ] Removed a total of 484 redundant transitions.
[2024-05-24 00:38:45] [INFO ] Flatten gal took : 27 ms
[2024-05-24 00:38:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 7 ms.
[2024-05-24 00:38:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality14001651607888885345.gal : 3 ms
[2024-05-24 00:38:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality9954217085494121604.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14001651607888885345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9954217085494121604.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,183955,11.7221,224772,5930,2153,302885,25003,881,873332,207,236226,0


Converting to forward existential form...Done !
original formula: AF((AG((((i0.u2.p18_2_3==0)||(i6.u1.flag_3_active==1))||((i1.u14.p15_1==0)||(i8.u31.p34_3_0==1)))) * (i2.u8.p08_3_3==0)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((i0.u2.p18_2_3==0)||(i6.u1.flag_3_active==1))||((i1.u14.p15_1==0)||(i8.u31.p34_3_0=...196
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t27, t28, t33, t35, t36, t39, t40, t41, t42, t43, t48, t49, t...1069
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 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 187 transition count 408
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 183 transition count 408
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 183 transition count 359
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 106 place count 134 transition count 359
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 131 transition count 347
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 131 transition count 347
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 136 place count 119 transition count 335
Applied a total of 136 rules in 40 ms. Remains 119 /187 variables (removed 68) and now considering 335/412 (removed 77) transitions.
[2024-05-24 00:39:15] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
// Phase 1: matrix 171 rows 119 cols
[2024-05-24 00:39:15] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 00:39:15] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-24 00:39:15] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-24 00:39:15] [INFO ] Invariant cache hit.
[2024-05-24 00:39:15] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:39:15] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2024-05-24 00:39:15] [INFO ] Redundant transitions in 3 ms returned []
Running 331 sub problems to find dead transitions.
[2024-05-24 00:39:15] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-24 00:39:15] [INFO ] Invariant cache hit.
[2024-05-24 00:39:15] [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:39:17] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:39:17] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 3 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:39:18] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-05-24 00:39:19] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:39:19] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:39:19] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:39:19] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 3 ms to minimize.
[2024-05-24 00:39:19] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-24 00:39:19] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-05-24 00:39:19] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 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:39:20] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:39:20] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:39:21] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-24 00:39:21] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:39:21] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-24 00:39:21] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-24 00:39:21] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-05-24 00:39:21] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-24 00:39:22] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:39:22] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:39:22] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:39:22] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:39:22] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:39:22] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:39:22] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:39:23] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-24 00:39:23] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:39:26] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-24 00:39:26] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:39:26] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-05-24 00:39:26] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-24 00:39:27] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:39:27] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-24 00:39:27] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-24 00:39:27] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:39:29] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:39:30] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:39:31] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-24 00:39:32] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (OVERLAPS) 171/290 variables, 119/181 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 76/257 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:39:39] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:39:40] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:39:40] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:39:40] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:39:40] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-24 00:39:40] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:39:40] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 7/264 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:39:43] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/290 variables, and 265 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 57/57 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, 57/70 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:39:47] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-24 00:39:47] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:39:47] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:39:47] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:39:47] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:39:48] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (OVERLAPS) 171/290 variables, 119/195 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 76/271 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 331/602 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:39:56] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-24 00:40:09] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/290 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 604 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 65/65 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in SI_CTL mode, iteration 1 : 119/187 places, 335/412 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60960 ms. Remains : 119/187 places, 335/412 transitions.
[2024-05-24 00:40:16] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:40:16] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:40:16] [INFO ] Input system was already deterministic with 335 transitions.
[2024-05-24 00:40:16] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:40:16] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:40:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality2533787885077207647.gal : 5 ms
[2024-05-24 00:40:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15219838417388012056.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/CTLCardinality2533787885077207647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15219838417388012056.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,158914,23.0746,481544,2,71352,5,1.13426e+06,6,0,814,1.20135e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 00:40:46] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:40:46] [INFO ] Applying decomposition
[2024-05-24 00:40:46] [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/graph8502243965836776081.txt' '-o' '/tmp/graph8502243965836776081.bin' '-w' '/tmp/graph8502243965836776081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8502243965836776081.bin' '-l' '-1' '-v' '-w' '/tmp/graph8502243965836776081.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:40:46] [INFO ] Decomposing Gal with order
[2024-05-24 00:40:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:40:46] [INFO ] Removed a total of 500 redundant transitions.
[2024-05-24 00:40:46] [INFO ] Flatten gal took : 41 ms
[2024-05-24 00:40:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 8 ms.
[2024-05-24 00:40:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15691788359881831214.gal : 18 ms
[2024-05-24 00:40:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1157783663323989680.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/CTLCardinality15691788359881831214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1157783663323989680.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,158914,13.8582,197556,5192,1491,242427,7044,849,652610,162,87862,0


Converting to forward existential form...Done !
original formula: AG(A(((i6.u2.flag_3_waiting==0)||(u6.p08_2_3==1)) U AG(((EG((i2.i1.u17.p19_0_2==1)) + (i7.u33.critical_section_3==1)) + ((i6.u2.p25_2_0==...183
=> equivalent forward existential formula: ([(((FwdU((FwdU(FwdU(Init,TRUE),!(!(E(TRUE U !(((EG((i2.i1.u17.p19_0_2==1)) + (i7.u33.critical_section_3==1)) + ...548
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t25, t26, t32, t33, t34, t35, t36, t40, t41, t42, t43, t44, t...1092
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
(forward)formula 0,0,28.6693,380060,1,0,485490,45382,4639,1.45634e+06,669,268850,2104278
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 400
Applied a total of 6 rules in 4 ms. Remains 184 /187 variables (removed 3) and now considering 400/412 (removed 12) transitions.
[2024-05-24 00:41:15] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-24 00:41:15] [INFO ] Computed 13 invariants in 5 ms
[2024-05-24 00:41:15] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-24 00:41:15] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:41:15] [INFO ] Invariant cache hit.
[2024-05-24 00:41:15] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:41:15] [INFO ] Implicit Places using invariants and state equation in 608 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:41:15] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:41:15] [INFO ] Invariant cache hit.
[2024-05-24 00:41:15] [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:41:19] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-24 00:41:19] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-24 00:41:19] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:41:19] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-24 00:41:19] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:41:19] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:41:20] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2024-05-24 00:41:20] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:41:20] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:41:20] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:41:20] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
[2024-05-24 00:41:20] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 2 ms to minimize.
[2024-05-24 00:41:20] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-24 00:41:20] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:41:20] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-24 00:41:21] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-24 00:41:21] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 3 ms to minimize.
[2024-05-24 00:41:21] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-24 00:41:21] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-24 00:41:21] [INFO ] Deduced a trap composed of 53 places in 138 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:41:21] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:41:22] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:41:22] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:41:22] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 3 ms to minimize.
[2024-05-24 00:41:22] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 3 ms to minimize.
[2024-05-24 00:41:23] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 4 ms to minimize.
[2024-05-24 00:41:23] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:41:23] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 4 ms to minimize.
[2024-05-24 00:41:23] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-05-24 00:41:23] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:41:23] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:41:24] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:41:24] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-24 00:41:24] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-05-24 00:41:24] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-05-24 00:41:24] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-24 00:41:26] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 3 ms to minimize.
[2024-05-24 00:41:26] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:41:27] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2024-05-24 00:41:27] [INFO ] Deduced a trap composed of 40 places in 143 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:41:29] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-24 00:41:30] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:41:30] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:41:30] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:41:31] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 3 ms to minimize.
[2024-05-24 00:41:31] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:41:31] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:41:31] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:41:32] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 3 ms to minimize.
[2024-05-24 00:41:32] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:41:32] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 3 ms to minimize.
[2024-05-24 00:41:32] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-24 00:41:32] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-05-24 00:41:33] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:41:33] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:41:34] [INFO ] Deduced a trap composed of 44 places in 148 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:41:35] [INFO ] Deduced a trap composed of 45 places in 118 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:41:40] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2024-05-24 00:41:40] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-24 00:41:40] [INFO ] Deduced a trap composed of 48 places in 124 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:41:43] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-05-24 00:41:43] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2024-05-24 00:41:44] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2024-05-24 00:41:45] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-24 00:41:45] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 3 ms to minimize.
[2024-05-24 00:41:45] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 3 ms to minimize.
[2024-05-24 00:41:45] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 3 ms to minimize.
[2024-05-24 00:41:46] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 14 ms to minimize.
SMT process timed out in 30148ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30155ms
Starting structural reductions in LTL mode, iteration 1 : 184/187 places, 400/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30939 ms. Remains : 184/187 places, 400/412 transitions.
[2024-05-24 00:41:46] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:41:46] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:41:46] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:41:46] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:41:46] [INFO ] Flatten gal took : 16 ms
[2024-05-24 00:41:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality753278707747082025.gal : 3 ms
[2024-05-24 00:41:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality14839500456153161485.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/CTLCardinality753278707747082025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14839500456153161485.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:42:16] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:42:16] [INFO ] Applying decomposition
[2024-05-24 00:42:16] [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/graph3400377243251362573.txt' '-o' '/tmp/graph3400377243251362573.bin' '-w' '/tmp/graph3400377243251362573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3400377243251362573.bin' '-l' '-1' '-v' '-w' '/tmp/graph3400377243251362573.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:42:16] [INFO ] Decomposing Gal with order
[2024-05-24 00:42:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:42:16] [INFO ] Removed a total of 534 redundant transitions.
[2024-05-24 00:42:16] [INFO ] Flatten gal took : 26 ms
[2024-05-24 00:42:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 7 ms.
[2024-05-24 00:42:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality14453984377180598856.gal : 4 ms
[2024-05-24 00:42:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality6029109917185867490.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/CTLCardinality14453984377180598856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6029109917185867490.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,13.4111,252156,8577,2178,370217,18046,1045,812848,187,224526,0


Converting to forward existential form...Done !
original formula: AX((EF(EG((i2.u5.p08_0_2==1))) * (i2.u5.p08_0_2==0)))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U EG((i2.u5.p08_0_2==1)))))] = FALSE * [(EY(Init) * !((i2.u5.p08_0_2==0)))] = 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...1144
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
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 400
Applied a total of 6 rules in 5 ms. Remains 184 /187 variables (removed 3) and now considering 400/412 (removed 12) transitions.
[2024-05-24 00:42:46] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:42:46] [INFO ] Invariant cache hit.
[2024-05-24 00:42:46] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-24 00:42:46] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:42:46] [INFO ] Invariant cache hit.
[2024-05-24 00:42:46] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-24 00:42:47] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-24 00:42:47] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-24 00:42:47] [INFO ] Invariant cache hit.
[2024-05-24 00:42: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:42:50] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-24 00:42:50] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:42:50] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 3 ms to minimize.
[2024-05-24 00:42:51] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 3 ms to minimize.
[2024-05-24 00:42:51] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:42:51] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:42:51] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-05-24 00:42:51] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2024-05-24 00:42:52] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 3 ms to minimize.
[2024-05-24 00:42:52] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2024-05-24 00:42:52] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:42:52] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 2 ms to minimize.
[2024-05-24 00:42:52] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:42:52] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:42:52] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-24 00:42:53] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2024-05-24 00:42:53] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:42:53] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:42:53] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 3 ms to minimize.
[2024-05-24 00:42:53] [INFO ] Deduced a trap composed of 53 places in 157 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:54] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-24 00:42:54] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:42:54] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:42:55] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 4 ms to minimize.
[2024-05-24 00:42:55] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-05-24 00:42:55] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 3 ms to minimize.
[2024-05-24 00:42:55] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:42:55] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 4 ms to minimize.
[2024-05-24 00:42:56] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 4 ms to minimize.
[2024-05-24 00:42:56] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 3 ms to minimize.
[2024-05-24 00:42:56] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-24 00:42:56] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 3 ms to minimize.
[2024-05-24 00:42:56] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-05-24 00:42:57] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2024-05-24 00:42:57] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:42:57] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-24 00:42:59] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-05-24 00:42:59] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-24 00:43:00] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:43:00] [INFO ] Deduced a trap composed of 40 places in 88 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:43:03] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:43:03] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 3 ms to minimize.
[2024-05-24 00:43:04] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 3 ms to minimize.
[2024-05-24 00:43:05] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-24 00:43:05] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 3 ms to minimize.
[2024-05-24 00:43:05] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 3 ms to minimize.
[2024-05-24 00:43:05] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 3 ms to minimize.
[2024-05-24 00:43:06] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-05-24 00:43:06] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 3 ms to minimize.
[2024-05-24 00:43:06] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-05-24 00:43:07] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-24 00:43:07] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2024-05-24 00:43:07] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 3 ms to minimize.
[2024-05-24 00:43:08] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-24 00:43:08] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 3 ms to minimize.
[2024-05-24 00:43:08] [INFO ] Deduced a trap composed of 44 places in 151 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:43:10] [INFO ] Deduced a trap composed of 45 places in 148 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:43:16] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-05-24 00:43:17] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 72 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30014 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: 59/59 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, 59/72 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:43:18] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2024-05-24 00:43:18] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-05-24 00:43:19] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-24 00:43:21] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-24 00:43:21] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-24 00:43:21] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-05-24 00:43:22] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2024-05-24 00:43:22] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2024-05-24 00:43:22] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 2 ms to minimize.
[2024-05-24 00:43:22] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2024-05-24 00:43:22] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:43:23] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:43:28] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-05-24 00:43:28] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 3 ms to minimize.
[2024-05-24 00:43:28] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2024-05-24 00:43:29] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:43:29] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 3 ms to minimize.
[2024-05-24 00:43:29] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-24 00:43:29] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:43:31] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 3 ms to minimize.
[2024-05-24 00:43:32] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-05-24 00:43:33] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-24 00:43:35] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (OVERLAPS) 236/420 variables, 184/279 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 76/355 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 396/751 constraints. Problems are: Problem set: 0 solved, 396 unsolved
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 420/420 variables, and 751 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: 82/82 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 184/187 places, 400/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60873 ms. Remains : 184/187 places, 400/412 transitions.
[2024-05-24 00:43:47] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:43:47] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:43:47] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 00:43:47] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:43:47] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:43:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality2476697452607163303.gal : 13 ms
[2024-05-24 00:43:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality12733428983815199703.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/CTLCardinality2476697452607163303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12733428983815199703.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:44:17] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:44:17] [INFO ] Applying decomposition
[2024-05-24 00:44:17] [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/graph1702488215270963119.txt' '-o' '/tmp/graph1702488215270963119.bin' '-w' '/tmp/graph1702488215270963119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1702488215270963119.bin' '-l' '-1' '-v' '-w' '/tmp/graph1702488215270963119.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:44:17] [INFO ] Decomposing Gal with order
[2024-05-24 00:44:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:44:17] [INFO ] Removed a total of 528 redundant transitions.
[2024-05-24 00:44:17] [INFO ] Flatten gal took : 25 ms
[2024-05-24 00:44:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 6 ms.
[2024-05-24 00:44:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality15774053218385899693.gal : 5 ms
[2024-05-24 00:44:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality17545529732268729975.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/CTLCardinality15774053218385899693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17545529732268729975.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,19.0567,349064,12508,3417,501178,61687,1018,1.18686e+06,195,427551,0


Converting to forward existential form...Done !
original formula: AX(EX((i10.i2.u2.p25_2_4==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EX((i10.i2.u2.p25_2_4==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...1193
(forward)formula 0,0,26.4188,349064,1,0,501178,114483,4366,1.21248e+06,860,528835,2304945
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 00:44:44] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:44:44] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:44:44] [INFO ] Applying decomposition
[2024-05-24 00:44:44] [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/graph4638462525454559612.txt' '-o' '/tmp/graph4638462525454559612.bin' '-w' '/tmp/graph4638462525454559612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4638462525454559612.bin' '-l' '-1' '-v' '-w' '/tmp/graph4638462525454559612.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:44:44] [INFO ] Decomposing Gal with order
[2024-05-24 00:44:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:44:44] [INFO ] Removed a total of 543 redundant transitions.
[2024-05-24 00:44:44] [INFO ] Flatten gal took : 26 ms
[2024-05-24 00:44:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 6 ms.
[2024-05-24 00:44:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality14775289188711508694.gal : 4 ms
[2024-05-24 00:44:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1812714260929323006.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/CTLCardinality14775289188711508694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1812714260929323006.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 3 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.3247e+06,16.0278,263924,8946,1451,421349,8326,1079,805967,193,98736,0


Converting to forward existential form...Done !
original formula: EF((AG(EF(((i8.i0.u38.p19_2_0==0)&&(i6.u47.p33_1_0==1)))) * A(E(EX((i0.u6.p09_0_2==0)) U (i7.i1.u24.p17_1==1)) U (AF(((i6.u20.p34_1_0==0)...204
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U ((i8.i0.u38.p19_2_0==0)&&(i6.u47.p33_1_0==1))))))) * !(EG(!((!(EG(!(...464
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t42, t43, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t...1177
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,38.5577,587516,1,0,996525,71364,5265,2.05223e+06,802,428216,3749748
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((AG((((i8.i1.u32.p18_2_3==0)||(i0.u1.flag_3_active==1))||((i3.u7.p15_1==0)||(i11.i0.u50.p34_3_0==1)))) * (i4.u0.p08_3_3==0)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((i8.i1.u32.p18_2_3==0)||(i0.u1.flag_3_active==1))||((i3.u7.p15_1==0)||(i11.i0.u50.p...203
(forward)formula 1,0,63.9188,1050044,1,0,1.83224e+06,76137,6026,3.24925e+06,823,486256,6628634
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((EF(EG((i0.u6.p08_0_2==1))) * (i0.u6.p08_0_2==0)))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U EG((i0.u6.p08_0_2==1)))))] = FALSE * [(EY(Init) * !((i0.u6.p08_0_2==0)))] = FALSE)
(forward)formula 2,1,72.8732,1214308,1,0,2.12873e+06,79919,6045,3.65439e+06,824,517011,7458288
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1288609 ms.

BK_STOP 1716511557503

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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