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.r576-smll-171734919900065.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 MedleyA-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 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 MedleyA-PT-09-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717357898147

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 19:51:40] [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-06-02 19:51:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:51:40] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2024-06-02 19:51:40] [INFO ] Transformed 147 places.
[2024-06-02 19:51:40] [INFO ] Transformed 315 transitions.
[2024-06-02 19:51:40] [INFO ] Found NUPN structural information;
[2024-06-02 19:51:40] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 481 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 103 ms.
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-09-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 126 transition count 295
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 126 transition count 295
Applied a total of 36 rules in 71 ms. Remains 126 /145 variables (removed 19) and now considering 295/313 (removed 18) transitions.
// Phase 1: matrix 295 rows 126 cols
[2024-06-02 19:51:41] [INFO ] Computed 10 invariants in 35 ms
[2024-06-02 19:51:41] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-06-02 19:51:41] [INFO ] Invariant cache hit.
[2024-06-02 19:51:42] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-06-02 19:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/126 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 19:51:46] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 38 ms to minimize.
[2024-06-02 19:51:46] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 4 ms to minimize.
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 4/27 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/27 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 295/421 variables, 126/153 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 19:51:55] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 4 ms to minimize.
[2024-06-02 19:51:55] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 2 ms to minimize.
[2024-06-02 19:51:56] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:51:56] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:51:56] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:51:56] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:51:57] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:51:57] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:51:57] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:51:57] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 10/163 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 0/421 variables, 0/163 constraints. Problems are: Problem set: 64 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 163 constraints, problems are : Problem set: 64 solved, 230 unsolved in 23432 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 64 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 27/37 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/38 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/38 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 295/421 variables, 126/164 constraints. Problems are: Problem set: 64 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 230/394 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 19:52:15] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 3/397 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 19:52:23] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:52:24] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-06-02 19:52:24] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 3 ms to minimize.
[2024-06-02 19:52:26] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-06-02 19:52:26] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 2 ms to minimize.
[2024-06-02 19:52:26] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 6/403 constraints. Problems are: Problem set: 64 solved, 230 unsolved
[2024-06-02 19:52:34] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 404 constraints, problems are : Problem set: 64 solved, 230 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 230/294 constraints, Known Traps: 38/38 constraints]
After SMT, in 54505ms problems are : Problem set: 64 solved, 230 unsolved
Search for dead transitions found 64 dead transitions in 54555ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 126/145 places, 231/313 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55467 ms. Remains : 126/145 places, 231/313 transitions.
Support contains 67 out of 126 places after structural reductions.
[2024-06-02 19:52:37] [INFO ] Flatten gal took : 101 ms
[2024-06-02 19:52:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-09-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:52:37] [INFO ] Flatten gal took : 48 ms
[2024-06-02 19:52:37] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 66 out of 126 places (down from 67) after GAL structural reductions.
RANDOM walk for 40000 steps (1313 resets) in 2720 ms. (14 steps per ms) remains 16/41 properties
BEST_FIRST walk for 4002 steps (28 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (20 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (33 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (29 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (29 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
// Phase 1: matrix 231 rows 126 cols
[2024-06-02 19:52:38] [INFO ] Computed 10 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/74 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 33/107 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 218/325 variables, 107/116 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 19:52:39] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:52:39] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/118 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 23/348 variables, 14/132 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 9/357 variables, 5/138 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 19:52:39] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/357 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 139 constraints, problems are : Problem set: 1 solved, 15 unsolved in 1472 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 48/74 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 33/107 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 19:52:40] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:52:40] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 19:52:40] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 218/325 variables, 107/122 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 12/134 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 19:52:40] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:52:40] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-02 19:52:41] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:52:41] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 4/138 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 19:52:41] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2024-06-02 19:52:41] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:52:41] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 3 ms to minimize.
[2024-06-02 19:52:41] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 4/142 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 23/348 variables, 14/156 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 3/160 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 9/357 variables, 5/165 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2024-06-02 19:52:43] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 2/167 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 19:52:43] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/357 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 168 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 17/17 constraints]
After SMT, in 6503ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 124 transition count 217
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 113 transition count 213
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 110 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 32 place count 110 transition count 210
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 108 transition count 210
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 45 place count 99 transition count 198
Iterating global reduction 3 with 9 rules applied. Total rules applied 54 place count 99 transition count 198
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 99 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 98 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 56 place count 98 transition count 196
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 58 place count 97 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 96 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 96 transition count 194
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 37 rules applied. Total rules applied 97 place count 77 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 99 place count 77 transition count 173
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 109 place count 72 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 122 place count 72 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 124 place count 71 transition count 187
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 128 place count 71 transition count 183
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 132 place count 67 transition count 183
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 133 place count 67 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 134 place count 66 transition count 182
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 138 place count 66 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 139 place count 65 transition count 181
Applied a total of 139 rules in 189 ms. Remains 65 /126 variables (removed 61) and now considering 181/231 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 65/126 places, 181/231 transitions.
RANDOM walk for 40000 steps (3067 resets) in 730 ms. (54 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40003 steps (694 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (709 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
[2024-06-02 19:52:45] [INFO ] Flow matrix only has 177 transitions (discarded 4 similar events)
// Phase 1: matrix 177 rows 65 cols
[2024-06-02 19:52:45] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:52:45] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/53 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 164/217 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 47/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/237 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/240 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/242 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/242 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 130 constraints, problems are : Problem set: 0 solved, 2 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:52:45] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/53 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 164/217 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/237 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:52:45] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/237 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/240 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/240 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/242 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/242 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/242 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 134 constraints, problems are : Problem set: 0 solved, 2 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 519ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1100 steps, including 43 resets, run visited all 2 properties in 5 ms. (steps per millisecond=220 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 12 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-06-02 19:52:46] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:52:46] [INFO ] Flatten gal took : 37 ms
[2024-06-02 19:52:46] [INFO ] Input system was already deterministic with 231 transitions.
Computed a total of 15 stabilizing places and 17 stable transitions
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 123 transition count 216
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 111 transition count 213
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 34 place count 110 transition count 208
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 39 place count 106 transition count 207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 39 place count 106 transition count 204
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 45 place count 103 transition count 204
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 56 place count 92 transition count 188
Iterating global reduction 4 with 11 rules applied. Total rules applied 67 place count 92 transition count 188
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 92 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 91 transition count 187
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 70 place count 90 transition count 185
Iterating global reduction 6 with 1 rules applied. Total rules applied 71 place count 90 transition count 185
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 29 rules applied. Total rules applied 100 place count 75 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 106 place count 75 transition count 165
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 6 with 2 rules applied. Total rules applied 108 place count 75 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 110 place count 73 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 110 place count 73 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 114 place count 71 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 118 place count 69 transition count 159
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 120 place count 69 transition count 159
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 122 place count 67 transition count 157
Applied a total of 122 rules in 102 ms. Remains 67 /126 variables (removed 59) and now considering 157/231 (removed 74) transitions.
// Phase 1: matrix 157 rows 67 cols
[2024-06-02 19:52:46] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 19:52:46] [INFO ] Implicit Places using invariants in 97 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/126 places, 157/231 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 212 ms. Remains : 66/126 places, 157/231 transitions.
[2024-06-02 19:52:46] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:52:46] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:52:46] [INFO ] Input system was already deterministic with 157 transitions.
[2024-06-02 19:52:46] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:52:46] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:52:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15962423667087511905.gal : 9 ms
[2024-06-02 19:52:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality12903843623859371674.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/CTLCardinality15962423667087511905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12903843623859371674.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31464e+06,0.794992,25872,2,2960,5,75407,6,0,419,76191,0


Converting to forward existential form...Done !
original formula: E(AF((!(((((p119==1)&&((p105==0)||(p75==1)))||(p50==1))||(p20==1))) + A(E(((p31==0)||(p103==1)) U ((p142==0)||(p78==1))) U (((p145==1)||(...288
=> equivalent forward existential formula: [((FwdU(Init,!(EG(!((!(((((p119==1)&&((p105==0)||(p75==1)))||(p50==1))||(p20==1))) + !((E(!((((p145==1)||(p115==...528
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t7, t8, t10, t11, t14, t16, t17, t19, t20, t22, t23, t24, t25, t26, t27, t28,...457
Detected timeout of ITS tools.
[2024-06-02 19:53:16] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:53:16] [INFO ] Applying decomposition
[2024-06-02 19:53:16] [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/graph16779174443823904007.txt' '-o' '/tmp/graph16779174443823904007.bin' '-w' '/tmp/graph16779174443823904007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16779174443823904007.bin' '-l' '-1' '-v' '-w' '/tmp/graph16779174443823904007.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:53:16] [INFO ] Decomposing Gal with order
[2024-06-02 19:53:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:53:16] [INFO ] Removed a total of 384 redundant transitions.
[2024-06-02 19:53:16] [INFO ] Flatten gal took : 73 ms
[2024-06-02 19:53:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2024-06-02 19:53:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality14639752572313446257.gal : 5 ms
[2024-06-02 19:53:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5762599606820862105.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/CTLCardinality14639752572313446257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5762599606820862105.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,2.31464e+06,0.244938,9088,415,42,9231,171,363,30385,58,626,0


Converting to forward existential form...Done !
original formula: E(AF((!(((((i4.u15.p119==1)&&((i4.u16.p105==0)||(i3.u9.p75==1)))||(i1.u6.p50==1))||(i1.u1.p20==1))) + A(E(((i0.u3.p31==0)||(i4.u15.p103==...412
=> equivalent forward existential formula: [((FwdU(Init,!(EG(!((!(((((i4.u15.p119==1)&&((i4.u16.p105==0)||(i3.u9.p75==1)))||(i1.u6.p50==1))||(i1.u1.p20==1)...716
Reverse transition relation is NOT exact ! Due to transitions t8, t45, t46, t47, t48, t69, t70, t73, t74, t88, t89, t92, t93, t108, t109, t110, t112, t113,...601
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,0,3.95394,104392,1,0,141234,429,2231,579639,260,1130,153895
FORMULA MedleyA-PT-09-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 110 transition count 212
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 110 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 109 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 109 transition count 210
Applied a total of 34 rules in 9 ms. Remains 109 /126 variables (removed 17) and now considering 210/231 (removed 21) transitions.
// Phase 1: matrix 210 rows 109 cols
[2024-06-02 19:53:20] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:53:21] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 19:53:21] [INFO ] Invariant cache hit.
[2024-06-02 19:53:21] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-06-02 19:53:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 19:53:23] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-06-02 19:53:24] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:53:24] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:53:24] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:53:24] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 3 ms to minimize.
[2024-06-02 19:53:24] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:53:24] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:53:24] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/319 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 19:53:27] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 3 ms to minimize.
[2024-06-02 19:53:27] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-02 19:53:27] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 19:53:31] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 19:53:34] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 136 constraints, problems are : Problem set: 0 solved, 209 unsolved in 18716 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 19:53:42] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 210/319 variables, 109/137 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 209/346 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 19:53:46] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:53:46] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:53:46] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 349 constraints, problems are : Problem set: 0 solved, 209 unsolved in 17483 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 21/21 constraints]
After SMT, in 36565ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 36571ms
Starting structural reductions in LTL mode, iteration 1 : 109/126 places, 210/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36902 ms. Remains : 109/126 places, 210/231 transitions.
[2024-06-02 19:53:57] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:53:57] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:53:57] [INFO ] Input system was already deterministic with 210 transitions.
[2024-06-02 19:53:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:53:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:53:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality16755064051713866434.gal : 13 ms
[2024-06-02 19:53:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4002522160591691456.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/CTLCardinality16755064051713866434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4002522160591691456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AX(AG((p119==0))) + EG(((AF(((p119==0)&&(p49==1))) + ((EX(((p20==0)||(p129==1))) + (((p94==0)&&(p3==0))&&(p89==1))) * EF(((p40==0)&&(p66...219
=> equivalent forward existential formula: [(FwdU(EY((Init * !(EG(((!(EG(!(((p119==0)&&(p49==1))))) + ((EX(((p20==0)||(p129==1))) + (((p94==0)&&(p3==0))&&(...300
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t17, t23, t24, t25, t26, t28, t29, t31, t32, t33, t36, t38, t40, t41, t44, t45,...462
Detected timeout of ITS tools.
[2024-06-02 19:54:28] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:54:28] [INFO ] Applying decomposition
[2024-06-02 19:54:28] [INFO ] Flatten gal took : 11 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/graph13837611550304254556.txt' '-o' '/tmp/graph13837611550304254556.bin' '-w' '/tmp/graph13837611550304254556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13837611550304254556.bin' '-l' '-1' '-v' '-w' '/tmp/graph13837611550304254556.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:54:28] [INFO ] Decomposing Gal with order
[2024-06-02 19:54:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:54:28] [INFO ] Removed a total of 338 redundant transitions.
[2024-06-02 19:54:28] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 9 ms.
[2024-06-02 19:54:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13324222538187029002.gal : 15 ms
[2024-06-02 19:54:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10418322814418643782.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/CTLCardinality13324222538187029002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10418322814418643782.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,5.8826e+07,0.664058,20400,941,316,24076,2019,422,87718,114,17173,0


Converting to forward existential form...Done !
original formula: (AX(AG((i4.i1.u26.p119==0))) + EG(((AF(((i4.i1.u26.p119==0)&&(i2.u13.p49==1))) + ((EX(((i6.u3.p20==0)||(i7.u30.p129==1))) + (((i5.u20.p94...321
=> equivalent forward existential formula: [(FwdU(EY((Init * !(EG(((!(EG(!(((i4.i1.u26.p119==0)&&(i2.u13.p49==1))))) + ((EX(((i6.u3.p20==0)||(i7.u30.p129==...402
Reverse transition relation is NOT exact ! Due to transitions t25, t59, t65, t97, i0.u1.t99, i0.u5.t95, i1.t86, i1.t83, i1.t82, i1.u6.t90, i1.u6.t91, i1.u6...746
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 123 transition count 210
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 22 rules applied. Total rules applied 41 place count 105 transition count 206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 103 transition count 204
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 45 place count 103 transition count 198
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 57 place count 97 transition count 198
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 71 place count 83 transition count 181
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 83 transition count 181
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 85 place count 83 transition count 179
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 81 transition count 179
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 121 place count 64 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 62 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 62 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 131 place count 62 transition count 154
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 62 transition count 153
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 61 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 135 place count 60 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 135 place count 60 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 137 place count 59 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 139 place count 58 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 141 place count 56 transition count 148
Applied a total of 141 rules in 47 ms. Remains 56 /126 variables (removed 70) and now considering 148/231 (removed 83) transitions.
// Phase 1: matrix 148 rows 56 cols
[2024-06-02 19:54:58] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:54:58] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 19:54:58] [INFO ] Invariant cache hit.
[2024-06-02 19:54:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 19:54:58] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 19:54:58] [INFO ] Redundant transitions in 5 ms returned []
Running 144 sub problems to find dead transitions.
[2024-06-02 19:54:58] [INFO ] Invariant cache hit.
[2024-06-02 19:54:58] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-06-02 19:55:00] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 148/204 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 81 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6003 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 148/204 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 144/225 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-06-02 19:55:07] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:55:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 227 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9892 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
After SMT, in 16106ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 16108ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/126 places, 148/231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16352 ms. Remains : 56/126 places, 148/231 transitions.
[2024-06-02 19:55:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:55:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:55:14] [INFO ] Input system was already deterministic with 148 transitions.
[2024-06-02 19:55:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:55:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:55:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality15472764323725765870.gal : 2 ms
[2024-06-02 19:55:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality16024264232669263228.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/CTLCardinality15472764323725765870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16024264232669263228.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,627954,0.174053,8628,2,617,5,19312,6,0,367,20352,0


Converting to forward existential form...Done !
original formula: E(AG(((p87==0)||(p35==1))) U !(EF(((p41==0)&&((p37==0)||(p111==1))))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(((p87==0)||(p35==1)))))) * !(E(TRUE U ((p41==0)&&((p37==0)||(p111==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t7, t8, t11, t13, t16, t18, t25, t29, t33, t38, t99, t100, t102, t117, t118, ...279
(forward)formula 0,0,0.534921,14700,1,0,229,52422,317,70,3507,43604,309
FORMULA MedleyA-PT-09-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 106 transition count 208
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 106 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 105 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 105 transition count 206
Applied a total of 42 rules in 9 ms. Remains 105 /126 variables (removed 21) and now considering 206/231 (removed 25) transitions.
// Phase 1: matrix 206 rows 105 cols
[2024-06-02 19:55:15] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:55:15] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 19:55:15] [INFO ] Invariant cache hit.
[2024-06-02 19:55:15] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-02 19:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 19:55:18] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:55:18] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:55:18] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:55:18] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:55:18] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:55:18] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 19:55:21] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:55:22] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-02 19:55:22] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-06-02 19:55:22] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:55:22] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:55:22] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 127 constraints, problems are : Problem set: 0 solved, 205 unsolved in 13009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 205/332 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 333 constraints, problems are : Problem set: 0 solved, 205 unsolved in 17987 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 13/13 constraints]
After SMT, in 31254ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 31258ms
Starting structural reductions in LTL mode, iteration 1 : 105/126 places, 206/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31620 ms. Remains : 105/126 places, 206/231 transitions.
[2024-06-02 19:55:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:55:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:55:46] [INFO ] Input system was already deterministic with 206 transitions.
[2024-06-02 19:55:46] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:55:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:55:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6338901956571488479.gal : 3 ms
[2024-06-02 19:55:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality10076811087721832520.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/CTLCardinality6338901956571488479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10076811087721832520.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(EX(EF(AG((p49==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U !(E(TRUE U !((p49==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...442
(forward)formula 0,0,5.10806,102160,1,0,369,465483,434,136,5789,399044,426
FORMULA MedleyA-PT-09-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 108 transition count 209
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 108 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 107 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 107 transition count 207
Applied a total of 38 rules in 7 ms. Remains 107 /126 variables (removed 19) and now considering 207/231 (removed 24) transitions.
// Phase 1: matrix 207 rows 107 cols
[2024-06-02 19:55:52] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:55:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 19:55:52] [INFO ] Invariant cache hit.
[2024-06-02 19:55:52] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-06-02 19:55:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:55:54] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:55:54] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:55:55] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:55:55] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:55:55] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/314 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:55:58] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:55:58] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:55:58] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:55:58] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:55:59] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:55:59] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 128 constraints, problems are : Problem set: 0 solved, 206 unsolved in 13482 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/314 variables, 107/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 206/334 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:56:10] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:56:11] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:56:11] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:56:17] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 338 constraints, problems are : Problem set: 0 solved, 206 unsolved in 24226 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 15/15 constraints]
After SMT, in 37859ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 37861ms
Starting structural reductions in LTL mode, iteration 1 : 107/126 places, 207/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38079 ms. Remains : 107/126 places, 207/231 transitions.
[2024-06-02 19:56:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:56:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:56:30] [INFO ] Input system was already deterministic with 207 transitions.
[2024-06-02 19:56:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:56:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:56:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality2008008147871654439.gal : 3 ms
[2024-06-02 19:56:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11591611257017093063.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/CTLCardinality2008008147871654439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11591611257017093063.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX(AF((((p81==0)&&(p68==1))&&((p43==0)||(p138==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!((((p81==0)&&(p68==1))&&((p43==0)||(p138==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...432
Detected timeout of ITS tools.
[2024-06-02 19:57:00] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:57:00] [INFO ] Applying decomposition
[2024-06-02 19:57:00] [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/graph5098429310976718260.txt' '-o' '/tmp/graph5098429310976718260.bin' '-w' '/tmp/graph5098429310976718260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5098429310976718260.bin' '-l' '-1' '-v' '-w' '/tmp/graph5098429310976718260.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:57:00] [INFO ] Decomposing Gal with order
[2024-06-02 19:57:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:57:00] [INFO ] Removed a total of 348 redundant transitions.
[2024-06-02 19:57:00] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 5 ms.
[2024-06-02 19:57:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality14945848011809557723.gal : 3 ms
[2024-06-02 19:57:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality4653830656485981187.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/CTLCardinality14945848011809557723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4653830656485981187.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,5.2048e+07,0.253376,11696,633,77,15196,850,360,34328,87,3419,0


Converting to forward existential form...Done !
original formula: EF(AX(AF((((i5.u18.p81==0)&&(i5.u15.p68==1))&&((i1.u12.p43==0)||(i0.i1.u27.p138==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!((((i5.u18.p81==0)&&(i5.u15.p68==1))&&((i1.u12.p43==0)||(i0.i1.u27.p138==1)))))...170
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t64, t72, t78, i0.i1.t15, i0.i1.u28.t14, i1.t77, i1.u3.t94, i1.u26.t16, i1.u26.t144,...683
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 123 transition count 207
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 25 rules applied. Total rules applied 47 place count 102 transition count 203
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 100 transition count 201
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 51 place count 100 transition count 196
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 61 place count 95 transition count 196
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 76 place count 80 transition count 177
Iterating global reduction 3 with 15 rules applied. Total rules applied 91 place count 80 transition count 177
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 80 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 79 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 93 place count 79 transition count 174
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 97 place count 77 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 76 transition count 172
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 76 transition count 172
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 131 place count 59 transition count 157
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 58 transition count 155
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 58 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 139 place count 58 transition count 149
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 5 with 2 rules applied. Total rules applied 141 place count 58 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 143 place count 56 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 143 place count 56 transition count 145
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 147 place count 54 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 151 place count 52 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 153 place count 50 transition count 141
Applied a total of 153 rules in 50 ms. Remains 50 /126 variables (removed 76) and now considering 141/231 (removed 90) transitions.
// Phase 1: matrix 141 rows 50 cols
[2024-06-02 19:57:30] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:57:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 19:57:30] [INFO ] Invariant cache hit.
[2024-06-02 19:57:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 19:57:30] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-06-02 19:57:30] [INFO ] Redundant transitions in 4 ms returned []
Running 135 sub problems to find dead transitions.
[2024-06-02 19:57:30] [INFO ] Invariant cache hit.
[2024-06-02 19:57:30] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 141/191 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 74 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3915 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 141/191 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 135/209 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 209 constraints, problems are : Problem set: 0 solved, 135 unsolved in 5963 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 9984ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 9985ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/126 places, 141/231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10199 ms. Remains : 50/126 places, 141/231 transitions.
[2024-06-02 19:57:40] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:57:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:57:40] [INFO ] Input system was already deterministic with 141 transitions.
[2024-06-02 19:57:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:57:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:57:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality11895738847806882468.gal : 2 ms
[2024-06-02 19:57:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality567968153749290314.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/CTLCardinality11895738847806882468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality567968153749290314.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,389454,0.240504,8604,2,657,5,19845,6,0,337,19927,0


Converting to forward existential form...Done !
original formula: EG(((p106==0)||(p116==1)))
=> equivalent forward existential formula: [FwdG(Init,((p106==0)||(p116==1)))] != FALSE
Hit Full ! (commute/partial/dont) 128/0/13
(forward)formula 0,1,0.614237,14148,1,0,10,46601,19,4,2338,43772,8
FORMULA MedleyA-PT-09-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 106 transition count 207
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 106 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 105 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 105 transition count 205
Applied a total of 42 rules in 8 ms. Remains 105 /126 variables (removed 21) and now considering 205/231 (removed 26) transitions.
// Phase 1: matrix 205 rows 105 cols
[2024-06-02 19:57:41] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:57:41] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 19:57:41] [INFO ] Invariant cache hit.
[2024-06-02 19:57:41] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-06-02 19:57:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:57:44] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:57:44] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:57:44] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:57:44] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:57:44] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:57:44] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:57:47] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:57:48] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-06-02 19:57:48] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:57:48] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 125 constraints, problems are : Problem set: 0 solved, 204 unsolved in 12510 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:57:59] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:58:04] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 331 constraints, problems are : Problem set: 0 solved, 204 unsolved in 28293 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 12/12 constraints]
After SMT, in 41084ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 41088ms
Starting structural reductions in LTL mode, iteration 1 : 105/126 places, 205/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41405 ms. Remains : 105/126 places, 205/231 transitions.
[2024-06-02 19:58:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:58:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:58:22] [INFO ] Input system was already deterministic with 205 transitions.
[2024-06-02 19:58:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:58:22] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:58:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality10375931481671685688.gal : 2 ms
[2024-06-02 19:58:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality5317903190366073255.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/CTLCardinality10375931481671685688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5317903190366073255.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(EX((((p51==0)&&(p91==1))||(((p53==0)&&(p38==1))&&((p19==0)||(p88==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (((p51==0)&&(p91==1))||(((p53==0)&&(p38==1))&&((p19==0)||(p88==1)))))] != FALSE
(forward)formula 0,1,2.58804,47900,1,0,8,139873,8,1,1181,197712,2
FORMULA MedleyA-PT-09-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 107 transition count 209
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 107 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 106 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 106 transition count 207
Applied a total of 40 rules in 7 ms. Remains 106 /126 variables (removed 20) and now considering 207/231 (removed 24) transitions.
// Phase 1: matrix 207 rows 106 cols
[2024-06-02 19:58:25] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:58:25] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 19:58:25] [INFO ] Invariant cache hit.
[2024-06-02 19:58:25] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-06-02 19:58:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/313 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:58:31] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:58:31] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:58:31] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:58:31] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:58:31] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 127 constraints, problems are : Problem set: 0 solved, 206 unsolved in 12439 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/313 variables, 106/127 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 206/333 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:58:44] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-02 19:58:44] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/313 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 335 constraints, problems are : Problem set: 0 solved, 206 unsolved in 20338 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 13/13 constraints]
After SMT, in 33024ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 33028ms
Starting structural reductions in LTL mode, iteration 1 : 106/126 places, 207/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33402 ms. Remains : 106/126 places, 207/231 transitions.
[2024-06-02 19:58:58] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:58:58] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:58:58] [INFO ] Input system was already deterministic with 207 transitions.
[2024-06-02 19:58:58] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:58:58] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:58:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality15543349449009781828.gal : 2 ms
[2024-06-02 19:58:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality644992085242670911.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/CTLCardinality15543349449009781828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality644992085242670911.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EX((EF(AX((p41==1))) * (AF(AX((p88==0))) + (p143==0)))) + AG(AF((AG(AF((p65==1))) * (p132==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EX((E(TRUE U !(EX(!((p41==1))))) * (!(EG(!(!(EX(!((p88==0))))))) + (p143==0)))))),TRUE),!((...213
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...437
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 19:59:28] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:59:28] [INFO ] Applying decomposition
[2024-06-02 19:59:28] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10201388478574505457.txt' '-o' '/tmp/graph10201388478574505457.bin' '-w' '/tmp/graph10201388478574505457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10201388478574505457.bin' '-l' '-1' '-v' '-w' '/tmp/graph10201388478574505457.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:59:28] [INFO ] Decomposing Gal with order
[2024-06-02 19:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:59:29] [INFO ] Removed a total of 413 redundant transitions.
[2024-06-02 19:59:29] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:59:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 6 ms.
[2024-06-02 19:59:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11075852345291071348.gal : 3 ms
[2024-06-02 19:59:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12438429039062400660.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/CTLCardinality11075852345291071348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12438429039062400660.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,5.54684e+07,0.353212,15248,603,110,19991,943,399,57763,95,4320,0


Converting to forward existential form...Done !
original formula: (EX((EF(AX((i4.u12.p41==1))) * (AF(AX((i6.u20.p88==0))) + (i3.u35.p143==0)))) + AG(AF((AG(AF((i7.u16.p65==1))) * (i0.i1.u31.p132==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EX((E(TRUE U !(EX(!((i4.u12.p41==1))))) * (!(EG(!(!(EX(!((i6.u20.p88==0))))))) + (i3.u35.p1...251
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t71, t78, i0.i1.t15, i0.i1.u31.t14, i1.u2.t96, i1.u4.t93, i2.t86, i2.t85, i2.t84, i2...701
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 112 transition count 216
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 112 transition count 216
Applied a total of 28 rules in 2 ms. Remains 112 /126 variables (removed 14) and now considering 216/231 (removed 15) transitions.
// Phase 1: matrix 216 rows 112 cols
[2024-06-02 19:59:59] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:59:59] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 19:59:59] [INFO ] Invariant cache hit.
[2024-06-02 19:59:59] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-02 19:59:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 20:00:02] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:00:02] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:00:02] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-06-02 20:00:02] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/328 variables, 112/126 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 20:00:06] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 3 ms to minimize.
[2024-06-02 20:00:06] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-06-02 20:00:06] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:00:06] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 3 ms to minimize.
[2024-06-02 20:00:06] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:00:06] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-02 20:00:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 133 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14360 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/328 variables, 112/133 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 215/348 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 20:00:19] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:00:19] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:00:19] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-06-02 20:00:20] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:00:20] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 353 constraints, problems are : Problem set: 0 solved, 215 unsolved in 20364 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 16/16 constraints]
After SMT, in 34888ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 34892ms
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 216/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35135 ms. Remains : 112/126 places, 216/231 transitions.
[2024-06-02 20:00:34] [INFO ] Flatten gal took : 27 ms
[2024-06-02 20:00:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:00:34] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-02 20:00:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:00:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:00:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality5600357374812368600.gal : 3 ms
[2024-06-02 20:00:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4498312027158040895.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/CTLCardinality5600357374812368600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4498312027158040895.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(((EX(EX(AF(((p139==0)||(p57==1))))) * (p111==1)) * ((EX((p90!=1)) + EG(EF(((p40==0)||(p141==1))))) * ((p43==0)||(p100==1)))) U !(((((p1...282
=> equivalent forward existential formula: (([(FwdU(Init,((EX(EX(!(EG(!(((p139==0)||(p57==1))))))) * (p111==1)) * ((EX((p90!=1)) + EG(E(TRUE U ((p40==0)||(...682
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t17, t23, t24, t26, t27, t28, t30, t31, t33, t35, t36, t37, t39, t40, t41, t43,...487
Detected timeout of ITS tools.
[2024-06-02 20:01:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:01:04] [INFO ] Applying decomposition
[2024-06-02 20:01:04] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9984349512506344371.txt' '-o' '/tmp/graph9984349512506344371.bin' '-w' '/tmp/graph9984349512506344371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9984349512506344371.bin' '-l' '-1' '-v' '-w' '/tmp/graph9984349512506344371.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:01:04] [INFO ] Decomposing Gal with order
[2024-06-02 20:01:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:01:04] [INFO ] Removed a total of 385 redundant transitions.
[2024-06-02 20:01:04] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:01:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 6 ms.
[2024-06-02 20:01:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality6260496053803331626.gal : 2 ms
[2024-06-02 20:01:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7543976361341593000.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/CTLCardinality6260496053803331626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7543976361341593000.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,6.77024e+07,0.709656,20268,867,212,29096,2309,408,76580,128,10515,0


Converting to forward existential form...Done !
original formula: E(((EX(EX(AF(((i1.u2.p139==0)||(i4.u12.p57==1))))) * (i7.u20.p111==1)) * ((EX((i6.u18.p90!=1)) + EG(EF(((i3.u8.p40==0)||(i7.u29.p141==1))...407
=> equivalent forward existential formula: (([(FwdU(Init,((EX(EX(!(EG(!(((i1.u2.p139==0)||(i4.u12.p57==1))))))) * (i7.u20.p111==1)) * ((EX((i6.u18.p90!=1))...913
Reverse transition relation is NOT exact ! Due to transitions t69, t81, i0.i1.t16, i0.i1.u25.t8, i0.i1.u26.t14, i1.t86, i1.t82, i1.u2.t103, i1.u9.t88, i1.u...787
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 105 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 105 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 104 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 104 transition count 204
Applied a total of 44 rules in 3 ms. Remains 104 /126 variables (removed 22) and now considering 204/231 (removed 27) transitions.
// Phase 1: matrix 204 rows 104 cols
[2024-06-02 20:01:34] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 20:01:34] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 20:01:34] [INFO ] Invariant cache hit.
[2024-06-02 20:01:34] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-06-02 20:01:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:01:37] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:01:37] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-02 20:01:37] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:01:37] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:01:41] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-06-02 20:01:41] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 2 ms to minimize.
[2024-06-02 20:01:41] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:01:41] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:01:41] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:01:42] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:01:42] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 127 constraints, problems are : Problem set: 0 solved, 203 unsolved in 13380 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:01:53] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:01:54] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 17289 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 15/15 constraints]
After SMT, in 30943ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 30948ms
Starting structural reductions in LTL mode, iteration 1 : 104/126 places, 204/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31284 ms. Remains : 104/126 places, 204/231 transitions.
[2024-06-02 20:02:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:02:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:02:05] [INFO ] Input system was already deterministic with 204 transitions.
[2024-06-02 20:02:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:02:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:02:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality14038517786554272039.gal : 2 ms
[2024-06-02 20:02:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15498902561879813863.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/CTLCardinality14038517786554272039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15498902561879813863.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((AX(((p37==0)||(p120==1))) * EX(AF(((p112==0)&&((p93==0)||(p117==1)))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(((p37==0)||(p120==1))))) * EX(!(EG(!(((p112==0)&&((p93==0)||(p117==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...417
(forward)formula 0,1,25.3099,603688,1,0,1125,3.27614e+06,437,527,5803,3.2359e+06,1201
FORMULA MedleyA-PT-09-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Graph (complete) has 420 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 123 transition count 208
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 24 rules applied. Total rules applied 45 place count 103 transition count 204
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 101 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 100 transition count 201
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 51 place count 100 transition count 196
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 61 place count 95 transition count 196
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 77 place count 79 transition count 175
Iterating global reduction 4 with 16 rules applied. Total rules applied 93 place count 79 transition count 175
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 79 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 78 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 95 place count 78 transition count 172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 99 place count 76 transition count 172
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 100 place count 75 transition count 170
Iterating global reduction 6 with 1 rules applied. Total rules applied 101 place count 75 transition count 170
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 133 place count 58 transition count 155
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 57 transition count 153
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 57 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 141 place count 57 transition count 147
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 6 with 2 rules applied. Total rules applied 143 place count 57 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 145 place count 55 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 145 place count 55 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 149 place count 53 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 153 place count 51 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 155 place count 49 transition count 139
Applied a total of 155 rules in 45 ms. Remains 49 /126 variables (removed 77) and now considering 139/231 (removed 92) transitions.
// Phase 1: matrix 139 rows 49 cols
[2024-06-02 20:02:31] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:02:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:02:31] [INFO ] Invariant cache hit.
[2024-06-02 20:02:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 20:02:31] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-02 20:02:31] [INFO ] Redundant transitions in 4 ms returned []
Running 133 sub problems to find dead transitions.
[2024-06-02 20:02:31] [INFO ] Invariant cache hit.
[2024-06-02 20:02:31] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 2/49 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 139/188 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 73 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3908 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 2/49 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 139/188 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 133/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 206 constraints, problems are : Problem set: 0 solved, 133 unsolved in 7942 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 11997ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 12000ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/126 places, 139/231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12219 ms. Remains : 49/126 places, 139/231 transitions.
[2024-06-02 20:02:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:02:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:02:43] [INFO ] Input system was already deterministic with 139 transitions.
[2024-06-02 20:02:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:02:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:02:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality14152500572063446647.gal : 2 ms
[2024-06-02 20:02:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality2995154194541360500.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/CTLCardinality14152500572063446647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2995154194541360500.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,357570,0.213249,7276,2,409,5,15237,6,0,331,14588,0


Converting to forward existential form...Done !
original formula: AG(AF((p144==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p144==0)))] = FALSE
Hit Full ! (commute/partial/dont) 128/0/11
(forward)formula 0,0,0.461677,10444,1,0,11,35006,20,3,2228,29171,8
FORMULA MedleyA-PT-09-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 231/231 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 106 transition count 207
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 106 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 105 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 105 transition count 205
Applied a total of 42 rules in 4 ms. Remains 105 /126 variables (removed 21) and now considering 205/231 (removed 26) transitions.
// Phase 1: matrix 205 rows 105 cols
[2024-06-02 20:02:44] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:02:44] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 20:02:44] [INFO ] Invariant cache hit.
[2024-06-02 20:02:44] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-06-02 20:02:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:02:46] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-06-02 20:02:46] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:02:47] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-06-02 20:02:47] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:02:47] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:02:47] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:02:50] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:02:50] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:02:50] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:02:50] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:02:51] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:02:51] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 127 constraints, problems are : Problem set: 0 solved, 204 unsolved in 13081 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/331 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:03:02] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:03:03] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:03:03] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 334 constraints, problems are : Problem set: 0 solved, 204 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 15/15 constraints]
After SMT, in 33394ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 33398ms
Starting structural reductions in LTL mode, iteration 1 : 105/126 places, 205/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33728 ms. Remains : 105/126 places, 205/231 transitions.
[2024-06-02 20:03:17] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:03:17] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:03:17] [INFO ] Input system was already deterministic with 205 transitions.
[2024-06-02 20:03:17] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:03:17] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:03:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality4093171519786123630.gal : 1 ms
[2024-06-02 20:03:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality7397006382920787092.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/CTLCardinality4093171519786123630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7397006382920787092.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(((p10==0) * EF(AG((p95==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !((p10==0)))] = FALSE * [(EY(Init) * !(E(TRUE U !(E(TRUE U !((p95==1)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...427
(forward)formula 0,1,24.9103,549744,1,0,442,2.97731e+06,434,176,5736,1.97336e+06,521
FORMULA MedleyA-PT-09-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 20:03:42] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:03:42] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:03:42] [INFO ] Applying decomposition
[2024-06-02 20:03:42] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8295662745595877678.txt' '-o' '/tmp/graph8295662745595877678.bin' '-w' '/tmp/graph8295662745595877678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8295662745595877678.bin' '-l' '-1' '-v' '-w' '/tmp/graph8295662745595877678.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:03:42] [INFO ] Decomposing Gal with order
[2024-06-02 20:03:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:03:42] [INFO ] Removed a total of 475 redundant transitions.
[2024-06-02 20:03:42] [INFO ] Flatten gal took : 42 ms
[2024-06-02 20:03:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 8 ms.
[2024-06-02 20:03:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality5992804067802729108.gal : 3 ms
[2024-06-02 20:03:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality10384362152267871218.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/CTLCardinality5992804067802729108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10384362152267871218.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 4 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.37219e+08,0.468649,12980,695,69,16583,248,488,36744,77,1032,0


Converting to forward existential form...Done !
original formula: (AX(AG((i7.u26.p119==0))) + EG(((AF(((i7.u26.p119==0)&&(i3.u15.p49==1))) + ((EX(((i0.u1.p20==0)||(i9.i0.u32.p129==1))) + (((i6.u24.p94==0...317
=> equivalent forward existential formula: [(FwdU(EY((Init * !(EG(((!(EG(!(((i7.u26.p119==0)&&(i3.u15.p49==1))))) + ((EX(((i0.u1.p20==0)||(i9.i0.u32.p129==...398
Reverse transition relation is NOT exact ! Due to transitions i0.t121, i0.t116, i0.u3.t120, i0.u4.t117, i1.u2.t118, i1.u2.t119, i1.u5.t113, i1.u5.t114, i2....964
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,26.5537,741856,1,0,1.26642e+06,1286,3187,2.6112e+06,386,5462,1202787
FORMULA MedleyA-PT-09-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AX(AF((((i5.u21.p81==0)&&(i5.u18.p68==1))&&((i3.u13.p43==0)||(i9.i0.u35.p138==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!((((i5.u21.p81==0)&&(i5.u18.p68==1))&&((i3.u13.p43==0)||(i9.i0.u35.p138==1)))))...170
(forward)formula 1,1,38.7052,1031792,1,0,1.74401e+06,1294,3225,3.48624e+06,387,5590,1657067
FORMULA MedleyA-PT-09-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX((EF(AX((i3.u14.p41==1))) * (AF(AX((i6.u23.p88==0))) + (i8.u38.p143==0)))) + AG(AF((AG(AF((i4.u17.p65==1))) * (i9.i0.u32.p132==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EX((E(TRUE U !(EX(!((i3.u14.p41==1))))) * (!(EG(!(!(EX(!((i6.u23.p88==0))))))) + (i8.u38.p1...251
Using saturation style SCC detection
(forward)formula 2,1,46.6743,1275728,1,0,2.177e+06,1313,3270,4.23638e+06,392,5729,2073512
FORMULA MedleyA-PT-09-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((EX(EX(AF(((i8.u36.p139==0)||(i3.u15.p57==1))))) * (i7.u30.p111==1)) * ((EX((i6.u23.p90!=1)) + EG(EF(((i2.u11.p40==0)||(i8.u37.p141==1...411
=> equivalent forward existential formula: (([(FwdU(Init,((EX(EX(!(EG(!(((i8.u36.p139==0)||(i3.u15.p57==1))))))) * (i7.u30.p111==1)) * ((EX((i6.u23.p90!=1)...923
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 3,1,68.3149,1876592,1,0,3.22033e+06,1373,3665,6.25211e+06,434,6112,3005817
FORMULA MedleyA-PT-09-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 791077 ms.

BK_STOP 1717358691568

--------------------
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="MedleyA-PT-09"
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 MedleyA-PT-09, 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 r576-smll-171734919900065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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