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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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 82K 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-07-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717355722155

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 19:15:24] [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:15:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:15:25] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-06-02 19:15:25] [INFO ] Transformed 145 places.
[2024-06-02 19:15:25] [INFO ] Transformed 287 transitions.
[2024-06-02 19:15:25] [INFO ] Found NUPN structural information;
[2024-06-02 19:15:25] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-07-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 142 transition count 285
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 129 transition count 271
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 129 transition count 271
Applied a total of 27 rules in 45 ms. Remains 129 /143 variables (removed 14) and now considering 271/285 (removed 14) transitions.
// Phase 1: matrix 271 rows 129 cols
[2024-06-02 19:15:25] [INFO ] Computed 10 invariants in 35 ms
[2024-06-02 19:15:25] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-06-02 19:15:25] [INFO ] Invariant cache hit.
[2024-06-02 19:15:25] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 19:15:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/128 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 19:15:30] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 24 ms to minimize.
[2024-06-02 19:15:30] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-06-02 19:15:30] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:15:31] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:15:31] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:15:31] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:15:31] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:15:31] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 8/18 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 19:15:34] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:15:34] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
[2024-06-02 19:15:34] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:15:34] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 4/22 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 19:15:36] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-06-02 19:15:36] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 2/24 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 271/399 variables, 128/152 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 19:15:40] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 4 ms to minimize.
[2024-06-02 19:15:41] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/154 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/154 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 1/400 variables, 1/155 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 19:15:46] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-06-02 19:15:46] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2024-06-02 19:15:46] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:15:47] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:15:47] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:15:48] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 6/161 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/161 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 13 (OVERLAPS) 0/400 variables, 0/161 constraints. Problems are: Problem set: 48 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 161 constraints, problems are : Problem set: 48 solved, 222 unsolved in 29407 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 48 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 17/27 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/27 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 271/399 variables, 128/155 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 221/376 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 19:16:02] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:16:02] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 2 ms to minimize.
[2024-06-02 19:16:04] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-06-02 19:16:04] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 2 ms to minimize.
[2024-06-02 19:16:04] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:16:04] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
[2024-06-02 19:16:05] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 7/383 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 19:16:10] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:16:11] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:16:12] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 3/386 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 19:16:19] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:16:19] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:16:20] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/389 constraints. Problems are: Problem set: 48 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/400 variables, and 389 constraints, problems are : Problem set: 48 solved, 222 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 128/129 constraints, PredecessorRefiner: 221/270 constraints, Known Traps: 30/35 constraints]
After SMT, in 60382ms problems are : Problem set: 48 solved, 222 unsolved
Search for dead transitions found 48 dead transitions in 60439ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 129/143 places, 223/285 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61243 ms. Remains : 129/143 places, 223/285 transitions.
Support contains 72 out of 129 places after structural reductions.
[2024-06-02 19:16:26] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 19:16:26] [INFO ] Flatten gal took : 80 ms
FORMULA MedleyA-PT-07-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:16:26] [INFO ] Flatten gal took : 35 ms
[2024-06-02 19:16:26] [INFO ] Input system was already deterministic with 223 transitions.
Support contains 70 out of 129 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (1398 resets) in 2321 ms. (17 steps per ms) remains 23/48 properties
BEST_FIRST walk for 4003 steps (30 resets) in 62 ms. (63 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (32 resets) in 62 ms. (63 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (31 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 51 ms. (76 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (31 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4001 steps (30 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (29 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (31 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (28 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (29 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (31 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
// Phase 1: matrix 223 rows 129 cols
[2024-06-02 19:16:27] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 42/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 3 (OVERLAPS) 36/115 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 210/325 variables, 115/124 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 18/343 variables, 7/131 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 2/345 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 2/134 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 7/352 variables, 5/139 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 139 constraints, problems are : Problem set: 1 solved, 21 unsolved in 1488 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 44/77 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-06-02 19:16:29] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 38/115 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-06-02 19:16:30] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:16:30] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-02 19:16:30] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 2 ms to minimize.
[2024-06-02 19:16:30] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:16:30] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
Problem AtomicPropp4 is UNSAT
[2024-06-02 19:16:30] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-06-02 19:16:30] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 7/17 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 210/325 variables, 115/132 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 15/147 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 8/155 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 18/343 variables, 7/162 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 5/167 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 2/345 variables, 1/168 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 2/170 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 7/352 variables, 5/175 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 0/352 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 175 constraints, problems are : Problem set: 2 solved, 20 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 20/22 constraints, Known Traps: 16/16 constraints]
After SMT, in 6523ms problems are : Problem set: 2 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 223/223 transitions.
Graph (complete) has 387 edges and 129 vertex of which 125 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 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 17 rules applied. Total rules applied 18 place count 125 transition count 204
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 30 place count 114 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 113 transition count 203
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 31 place count 113 transition count 200
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 37 place count 110 transition count 200
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 46 place count 101 transition count 189
Iterating global reduction 3 with 9 rules applied. Total rules applied 55 place count 101 transition count 189
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 88 place count 84 transition count 173
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
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 98 place count 79 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 3 with 35 rules applied. Total rules applied 133 place count 79 transition count 158
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 79 transition count 152
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 145 place count 73 transition count 152
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 73 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 149 place count 71 transition count 150
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 153 place count 71 transition count 150
Applied a total of 153 rules in 143 ms. Remains 71 /129 variables (removed 58) and now considering 150/223 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 71/129 places, 150/223 transitions.
RANDOM walk for 40000 steps (2740 resets) in 1086 ms. (36 steps per ms) remains 0/20 properties
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA MedleyA-PT-07-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:16:34] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:16:35] [INFO ] Flatten gal took : 35 ms
[2024-06-02 19:16:35] [INFO ] Input system was already deterministic with 223 transitions.
Computed a total of 17 stabilizing places and 19 stable transitions
Graph (complete) has 387 edges and 129 vertex of which 123 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 111 transition count 203
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 111 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 201
Applied a total of 37 rules in 18 ms. Remains 110 /129 variables (removed 19) and now considering 201/223 (removed 22) transitions.
// Phase 1: matrix 201 rows 110 cols
[2024-06-02 19:16:35] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:16:35] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 19:16:35] [INFO ] Invariant cache hit.
[2024-06-02 19:16:35] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-02 19:16:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-02 19:16:37] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:16:38] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:16:38] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:16:38] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:16:38] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-02 19:16:38] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/311 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-02 19:16:42] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 127 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12219 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/311 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 200/327 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 327 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12118 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 7/7 constraints]
After SMT, in 24580ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 24586ms
Starting structural reductions in LTL mode, iteration 1 : 110/129 places, 201/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24918 ms. Remains : 110/129 places, 201/223 transitions.
[2024-06-02 19:17:00] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:17:00] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:17:00] [INFO ] Input system was already deterministic with 201 transitions.
[2024-06-02 19:17:00] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:17:00] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:17:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17845608380318076967.gal : 10 ms
[2024-06-02 19:17:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality12138514944082404675.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17845608380318076967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12138514944082404675.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(!(A(((p53==0)||(p80==1)) U (EG((((p44==0)||(p120==1))&&((p30==0)||(p102==1)))) * EX(EX((p6==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((EG((((p44==0)||(p120==1))&&((p30==0)||(p102==1)))) * EX(EX((p6==0))))) U (!(((p53==0)||(p80...333
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t12, t14, t15, t16, t18, t24, t25, t26, t28, t33, t34, t35, t36, t38, t39, t41, t42,...487
Detected timeout of ITS tools.
[2024-06-02 19:17:30] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:17:30] [INFO ] Applying decomposition
[2024-06-02 19:17:30] [INFO ] Flatten gal took : 14 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/graph14972979611101813684.txt' '-o' '/tmp/graph14972979611101813684.bin' '-w' '/tmp/graph14972979611101813684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14972979611101813684.bin' '-l' '-1' '-v' '-w' '/tmp/graph14972979611101813684.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:17:30] [INFO ] Decomposing Gal with order
[2024-06-02 19:17:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:17:30] [INFO ] Removed a total of 272 redundant transitions.
[2024-06-02 19:17:30] [INFO ] Flatten gal took : 117 ms
[2024-06-02 19:17:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 22 ms.
[2024-06-02 19:17:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality13179252021810429490.gal : 9 ms
[2024-06-02 19:17:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11720750663225374532.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/CTLCardinality13179252021810429490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11720750663225374532.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.85059e+07,0.289757,9628,435,84,10605,579,352,27345,71,2904,0


Converting to forward existential form...Done !
original formula: EG(!(A(((i3.u14.p53==0)||(i0.i1.u16.p80==1)) U (EG((((i3.u11.p44==0)||(i7.i0.u28.p120==1))&&((i2.u7.p30==0)||(i6.u24.p102==1)))) * EX(EX(...174
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((EG((((i3.u11.p44==0)||(i7.i0.u28.p120==1))&&((i2.u7.p30==0)||(i6.u24.p102==1)))) * EX(EX((i...458
Reverse transition relation is NOT exact ! Due to transitions t35, t66, i1.u3.t109, i1.u5.t106, i2.t97, i2.t94, i2.t93, i2.u6.t73, i2.u6.t104, i2.u6.t105, ...811
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,23.3152,574228,1,0,824754,4712,2022,3.19425e+06,345,43666,515117
FORMULA MedleyA-PT-07-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 105 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 105 transition count 195
Applied a total of 47 rules in 19 ms. Remains 105 /129 variables (removed 24) and now considering 195/223 (removed 28) transitions.
// Phase 1: matrix 195 rows 105 cols
[2024-06-02 19:17:54] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:17:54] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 19:17:54] [INFO ] Invariant cache hit.
[2024-06-02 19:17:54] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-02 19:17:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-06-02 19:17:57] [INFO ] Deduced a trap composed of 17 places in 76 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, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:18:00] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 122 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11857 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/316 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:18:11] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 3 ms to minimize.
[2024-06-02 19:18:11] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:18:12] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:18:12] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 320 constraints, problems are : Problem set: 0 solved, 194 unsolved in 15833 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 11/11 constraints]
After SMT, in 27903ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 27907ms
Starting structural reductions in LTL mode, iteration 1 : 105/129 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28292 ms. Remains : 105/129 places, 195/223 transitions.
[2024-06-02 19:18:22] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:18:22] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:18:22] [INFO ] Input system was already deterministic with 195 transitions.
[2024-06-02 19:18:22] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:18:22] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:18:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality12442325215464182618.gal : 4 ms
[2024-06-02 19:18:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality3037028608422620987.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/CTLCardinality12442325215464182618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3037028608422620987.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(EF(AG(((p61!=0)&&(p14!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(((p61!=0)&&(p14!=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...493
(forward)formula 0,0,4.97237,90212,1,0,370,392634,412,144,5110,341626,401
FORMULA MedleyA-PT-07-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 106 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 106 transition count 197
Applied a total of 45 rules in 17 ms. Remains 106 /129 variables (removed 23) and now considering 197/223 (removed 26) transitions.
// Phase 1: matrix 197 rows 106 cols
[2024-06-02 19:18:27] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:18:27] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 19:18:27] [INFO ] Invariant cache hit.
[2024-06-02 19:18:27] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-02 19:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:18:30] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:18:30] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-06-02 19:18:30] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:18:30] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-02 19:18:31] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-02 19:18:31] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:18:33] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 123 constraints, problems are : Problem set: 0 solved, 196 unsolved in 10710 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 196/319 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:18:42] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:18:43] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:18:45] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 322 constraints, problems are : Problem set: 0 solved, 196 unsolved in 15227 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 10/10 constraints]
After SMT, in 26128ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 26132ms
Starting structural reductions in LTL mode, iteration 1 : 106/129 places, 197/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26421 ms. Remains : 106/129 places, 197/223 transitions.
[2024-06-02 19:18:54] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:18:54] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:18:54] [INFO ] Input system was already deterministic with 197 transitions.
[2024-06-02 19:18:54] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:18:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:18:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality7783757337346320285.gal : 4 ms
[2024-06-02 19:18:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality17813891897865003943.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/CTLCardinality7783757337346320285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17813891897865003943.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(((p25==0)||(p141==1)) U EG(((AX(((p126==0)||(p117==1))) + (p93==1)) + ((p119!=1)||(p118==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,((p25==0)||(p141==1))),((!(EX(!(((p126==0)||(p117==1))))) + (p93==1)) + ((p119!=1)||(p118==1))))...165
Hit Full ! (commute/partial/dont) 186/0/11
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t36, t38, t39, t41, t42, t43, t46...464
(forward)formula 0,1,7.55264,159184,1,0,467,632978,426,191,5254,761490,490
FORMULA MedleyA-PT-07-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 106 transition count 198
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 106 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 105 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 105 transition count 196
Applied a total of 47 rules in 6 ms. Remains 105 /129 variables (removed 24) and now considering 196/223 (removed 27) transitions.
// Phase 1: matrix 196 rows 105 cols
[2024-06-02 19:19:01] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:19:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 19:19:01] [INFO ] Invariant cache hit.
[2024-06-02 19:19:02] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-02 19:19:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 19:19:03] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:19:04] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:19:04] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:19:04] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:19:04] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:19:04] [INFO ] Deduced a trap composed of 14 places in 59 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, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/301 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 121 constraints, problems are : Problem set: 0 solved, 195 unsolved in 8372 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/301 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 195/316 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 316 constraints, problems are : Problem set: 0 solved, 195 unsolved in 9145 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 6/6 constraints]
After SMT, in 17637ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 17640ms
Starting structural reductions in LTL mode, iteration 1 : 105/129 places, 196/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17884 ms. Remains : 105/129 places, 196/223 transitions.
[2024-06-02 19:19:19] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:19:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:19:19] [INFO ] Input system was already deterministic with 196 transitions.
[2024-06-02 19:19:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:19:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:19:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality9481706861548083344.gal : 4 ms
[2024-06-02 19:19:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality6353785561916554285.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/CTLCardinality9481706861548083344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6353785561916554285.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AF(AG(((EX((p33==0)) * EF((p104==0))) * ((p34==0)||(p97==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(((EX((p33==0)) * E(TRUE U (p104==0))) * ((p34==0)||(p97==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t35, t37, t38, t40, t41, t42, t45...458
Detected timeout of ITS tools.
[2024-06-02 19:19:49] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:19:49] [INFO ] Applying decomposition
[2024-06-02 19:19:49] [INFO ] Flatten gal took : 7 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/graph17782334914065001634.txt' '-o' '/tmp/graph17782334914065001634.bin' '-w' '/tmp/graph17782334914065001634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17782334914065001634.bin' '-l' '-1' '-v' '-w' '/tmp/graph17782334914065001634.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:19:49] [INFO ] Decomposing Gal with order
[2024-06-02 19:19:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:19:49] [INFO ] Removed a total of 275 redundant transitions.
[2024-06-02 19:19:49] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:19:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2024-06-02 19:19:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2788121511230431361.gal : 3 ms
[2024-06-02 19:19:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality10659602196743277381.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/CTLCardinality2788121511230431361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10659602196743277381.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55474e+07,0.266442,9052,384,72,10320,699,311,22504,76,2928,0


Converting to forward existential form...Done !
original formula: AX(AF(AG(((EX((i2.u6.p33==0)) * EF((i6.u24.p104==0))) * ((i2.u7.p34==0)||(i5.u19.p97==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(((EX((i2.u6.p33==0)) * E(TRUE U (i6.u24.p104==0))) * ((i2.u7.p34==0)||(i5.u19.p97=...174
Reverse transition relation is NOT exact ! Due to transitions t74, i1.u2.t105, i1.u4.t102, i2.t95, i2.t94, i2.t93, i2.t89, i2.u5.t97, i2.u5.t98, i2.u5.t99,...751
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
(forward)formula 0,0,2.25976,63964,1,0,100060,1704,2194,331680,384,10178,155121
FORMULA MedleyA-PT-07-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 110 transition count 204
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 110 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 108 transition count 200
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 108 transition count 200
Applied a total of 41 rules in 6 ms. Remains 108 /129 variables (removed 21) and now considering 200/223 (removed 23) transitions.
// Phase 1: matrix 200 rows 108 cols
[2024-06-02 19:19:52] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:19:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:19:52] [INFO ] Invariant cache hit.
[2024-06-02 19:19:52] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-06-02 19:19:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-02 19:19:54] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 5 ms to minimize.
[2024-06-02 19:19:54] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-06-02 19:19:55] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/308 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 128 constraints, problems are : Problem set: 0 solved, 199 unsolved in 10386 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/308 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 199/327 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-02 19:20:07] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-02 19:20:11] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:20:11] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-02 19:20:14] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:20:15] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 199 unsolved in 22886 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 15/15 constraints]
After SMT, in 33390ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 33393ms
Starting structural reductions in LTL mode, iteration 1 : 108/129 places, 200/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33633 ms. Remains : 108/129 places, 200/223 transitions.
[2024-06-02 19:20:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:20:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:20:25] [INFO ] Input system was already deterministic with 200 transitions.
[2024-06-02 19:20:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:20:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:20:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17095138857917601730.gal : 9 ms
[2024-06-02 19:20:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality10229121641637157165.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/CTLCardinality17095138857917601730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10229121641637157165.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.19923e+07,1.88287,48292,2,5580,5,134476,6,0,632,228964,0


Converting to forward existential form...Done !
original formula: (A(AG(AF(((p124==0)||(p19==1)))) U EF(EG((p139==0)))) + EF((AG((((p48==0)&&(p55==0))||(((p107==0)&&(p53==0))&&(p133==1)))) + AX(AX((p110=...163
=> equivalent forward existential formula: ([((Init * !(EG(!(E(TRUE U EG((p139==0))))))) * !(E(!(E(TRUE U EG((p139==0)))) U (!(!(E(TRUE U !(!(EG(!(((p124==...392
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...528
Detected timeout of ITS tools.
[2024-06-02 19:20:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:20:56] [INFO ] Applying decomposition
[2024-06-02 19:20:56] [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/graph8774452211871661314.txt' '-o' '/tmp/graph8774452211871661314.bin' '-w' '/tmp/graph8774452211871661314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8774452211871661314.bin' '-l' '-1' '-v' '-w' '/tmp/graph8774452211871661314.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:20:56] [INFO ] Decomposing Gal with order
[2024-06-02 19:20:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:20:56] [INFO ] Removed a total of 293 redundant transitions.
[2024-06-02 19:20:56] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:20:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 7 ms.
[2024-06-02 19:20:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality9247720106016571426.gal : 3 ms
[2024-06-02 19:20:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality13681878748500026183.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/CTLCardinality9247720106016571426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13681878748500026183.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.19923e+07,0.578371,19212,662,104,27289,810,383,80770,82,5545,0


Converting to forward existential form...Done !
original formula: (A(AG(AF(((i7.i0.u27.p124==0)||(i3.u3.p19==1)))) U EF(EG((i7.i1.u33.p139==0)))) + EF((AG((((i3.u9.p48==0)&&(i3.u11.p55==0))||(((i6.u23.p1...233
=> equivalent forward existential formula: ([((Init * !(EG(!(E(TRUE U EG((i7.i1.u33.p139==0))))))) * !(E(!(E(TRUE U EG((i7.i1.u33.p139==0)))) U (!(!(E(TRUE...482
Reverse transition relation is NOT exact ! Due to transitions t34, t75, i1.u2.t109, i1.u4.t105, i2.t98, i2.t93, i2.t92, i2.u5.t100, i2.u5.t101, i2.u5.t102,...903
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
(forward)formula 0,1,17.2365,450608,1,0,666316,2712,2275,2.56783e+06,379,25981,448397
FORMULA MedleyA-PT-07-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 108 transition count 201
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 108 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 106 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 106 transition count 197
Applied a total of 45 rules in 6 ms. Remains 106 /129 variables (removed 23) and now considering 197/223 (removed 26) transitions.
// Phase 1: matrix 197 rows 106 cols
[2024-06-02 19:21:13] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:21:13] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 19:21:13] [INFO ] Invariant cache hit.
[2024-06-02 19:21:13] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-02 19:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:21:15] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:21:16] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:21:16] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:21:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:21:16] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:21:16] [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, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 122 constraints, problems are : Problem set: 0 solved, 196 unsolved in 10018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 196/318 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 19:21:28] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:21:28] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 320 constraints, problems are : Problem set: 0 solved, 196 unsolved in 13214 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 8/8 constraints]
After SMT, in 23402ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 23405ms
Starting structural reductions in LTL mode, iteration 1 : 106/129 places, 197/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23740 ms. Remains : 106/129 places, 197/223 transitions.
[2024-06-02 19:21:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:21:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:21:37] [INFO ] Input system was already deterministic with 197 transitions.
[2024-06-02 19:21:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:21:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:21:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality7364930192302374160.gal : 3 ms
[2024-06-02 19:21:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16999840661123784675.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/CTLCardinality7364930192302374160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16999840661123784675.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG(AF((p102==1))) + AX(AX((((p42==0)&&(p37==1))&&(p13==0)))))
=> equivalent forward existential formula: [(EY(EY((Init * !(EG(!(EG(!((p102==1))))))))) * !((((p42==0)&&(p37==1))&&(p13==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...499
Detected timeout of ITS tools.
[2024-06-02 19:22:07] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:22:07] [INFO ] Applying decomposition
[2024-06-02 19:22:07] [INFO ] Flatten gal took : 7 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/graph14616323691762164753.txt' '-o' '/tmp/graph14616323691762164753.bin' '-w' '/tmp/graph14616323691762164753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14616323691762164753.bin' '-l' '-1' '-v' '-w' '/tmp/graph14616323691762164753.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:22:07] [INFO ] Decomposing Gal with order
[2024-06-02 19:22:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:22:07] [INFO ] Removed a total of 306 redundant transitions.
[2024-06-02 19:22:07] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:22:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2024-06-02 19:22:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality17327769472867207472.gal : 2 ms
[2024-06-02 19:22:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17210922354181577281.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/CTLCardinality17327769472867207472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17210922354181577281.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.79698e+07,0.374234,11732,479,69,15041,478,350,34906,87,2069,0


Converting to forward existential form...Done !
original formula: (EG(AF((i6.u22.p102==1))) + AX(AX((((i3.u8.p42==0)&&(i2.u6.p37==1))&&(i3.u3.p13==0)))))
=> equivalent forward existential formula: [(EY(EY((Init * !(EG(!(EG(!((i6.u22.p102==1))))))))) * !((((i3.u8.p42==0)&&(i2.u6.p37==1))&&(i3.u3.p13==0))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t34, t73, i1.u2.t106, i1.u4.t103, i2.t91, i2.t90, i2.u5.t94, i2.u5.t95, i2.u5.t96, i2.u5.t98,...884
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,11.1433,301592,1,0,467260,1588,2208,1.56165e+06,438,11127,343663
FORMULA MedleyA-PT-07-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 112 transition count 206
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 112 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 204
Applied a total of 35 rules in 5 ms. Remains 111 /129 variables (removed 18) and now considering 204/223 (removed 19) transitions.
// Phase 1: matrix 204 rows 111 cols
[2024-06-02 19:22:18] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:22:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 19:22:18] [INFO ] Invariant cache hit.
[2024-06-02 19:22:18] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-06-02 19:22:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/315 variables, 111/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 125 constraints, problems are : Problem set: 0 solved, 203 unsolved in 10023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/315 variables, 111/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 203/328 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 19:22:33] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:22:34] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 19:22:37] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:22:37] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/315 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 20114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 8/8 constraints]
After SMT, in 30258ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 30260ms
Starting structural reductions in LTL mode, iteration 1 : 111/129 places, 204/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30499 ms. Remains : 111/129 places, 204/223 transitions.
[2024-06-02 19:22:49] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:22:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:22:49] [INFO ] Input system was already deterministic with 204 transitions.
[2024-06-02 19:22:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:22:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:22:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality10419204285805810612.gal : 2 ms
[2024-06-02 19:22:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality2217822994516652753.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/CTLCardinality10419204285805810612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2217822994516652753.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,2.04667e+07,2.44415,58260,2,5842,5,164850,6,0,648,271920,0


Converting to forward existential form...Done !
original formula: AG((EF((E((((p139==1)||(p135==0))||(p108==1)) U (((p114==0)||(p135==1))&&(p63==1))) + ((AG((p137==1)) * (p118==0)) * (p42==1)))) * ((AX((...261
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (E((((p139==1)||(p135==0))||(p108==1)) U (((p114==0)||(p135==1))&&(p63==1))) + (...387
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t36, t37, t38...534
(forward)formula 0,0,6.80731,135444,1,0,439,636964,449,180,5474,618717,470
FORMULA MedleyA-PT-07-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 110 transition count 202
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 110 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 108 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 108 transition count 198
Applied a total of 41 rules in 5 ms. Remains 108 /129 variables (removed 21) and now considering 198/223 (removed 25) transitions.
// Phase 1: matrix 198 rows 108 cols
[2024-06-02 19:22:56] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:22:56] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 19:22:56] [INFO ] Invariant cache hit.
[2024-06-02 19:22:56] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-06-02 19:22:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:22:58] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:22:58] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:22:59] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:22:59] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:22:59] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:23:01] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:23:03] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:23:04] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 198/306 variables, 108/130 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 130 constraints, problems are : Problem set: 0 solved, 197 unsolved in 15290 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:23:13] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:23:14] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:23:14] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 198/306 variables, 108/133 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 197/330 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:23:22] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/306 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 331 constraints, problems are : Problem set: 0 solved, 197 unsolved in 20699 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 16/16 constraints]
After SMT, in 36108ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36111ms
Starting structural reductions in LTL mode, iteration 1 : 108/129 places, 198/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36333 ms. Remains : 108/129 places, 198/223 transitions.
[2024-06-02 19:23:32] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:23:32] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:23:32] [INFO ] Input system was already deterministic with 198 transitions.
[2024-06-02 19:23:32] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:23:32] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:23:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality6522409918542234051.gal : 2 ms
[2024-06-02 19:23:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality5282562321540378341.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/CTLCardinality6522409918542234051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5282562321540378341.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((AF(EX(EG((p73==0)))) * (AF(((((p112==0)&&(p125==1))||(p69==0))||(p135==1))) + ((p82==1) * (AX((p93==0)) + EF(((p75==0)||(p86==1))))))...157
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(EX(EG((p73==0)))))] = FALSE * ([((FwdU(Init,TRUE) * !(!(EG(!(((((p112==0)&&(p125==1))||...358
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...515
Detected timeout of ITS tools.
[2024-06-02 19:24:02] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:24:02] [INFO ] Applying decomposition
[2024-06-02 19:24:02] [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/graph7486853192090430797.txt' '-o' '/tmp/graph7486853192090430797.bin' '-w' '/tmp/graph7486853192090430797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7486853192090430797.bin' '-l' '-1' '-v' '-w' '/tmp/graph7486853192090430797.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:24:02] [INFO ] Decomposing Gal with order
[2024-06-02 19:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:24:02] [INFO ] Removed a total of 320 redundant transitions.
[2024-06-02 19:24:02] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:24:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 5 ms.
[2024-06-02 19:24:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality13249310515592088338.gal : 2 ms
[2024-06-02 19:24:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality14864904310980241343.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/CTLCardinality13249310515592088338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14864904310980241343.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.87248e+07,0.331588,13092,552,78,17020,620,372,45013,78,3170,0


Converting to forward existential form...Done !
original formula: AG((AF(EX(EG((i6.u15.p73==0)))) * (AF(((((i6.u25.p112==0)&&(i7.u28.p125==1))||(i4.u14.p69==0))||(i7.u31.p135==1))) + ((i4.u17.p82==1) * (...220
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(EX(EG((i6.u15.p73==0)))))] = FALSE * ([((FwdU(Init,TRUE) * !(!(EG(!(((((i6.u25.p112==0)...449
Reverse transition relation is NOT exact ! Due to transitions t34, t76, i1.u2.t107, i1.u4.t104, i2.t95, i2.t92, i2.t91, i2.u5.t74, i2.u5.t102, i2.u5.t103, ...862
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
(forward)formula 0,0,14.9188,322748,1,0,466636,2627,2336,1.76246e+06,373,23571,354651
FORMULA MedleyA-PT-07-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Graph (complete) has 387 edges and 129 vertex of which 123 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 122 transition count 201
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 19 rules applied. Total rules applied 38 place count 105 transition count 199
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 44 place count 104 transition count 194
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 49 place count 100 transition count 193
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 49 place count 100 transition count 190
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 55 place count 97 transition count 190
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 69 place count 83 transition count 172
Iterating global reduction 4 with 14 rules applied. Total rules applied 83 place count 83 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 83 place count 83 transition count 170
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 87 place count 81 transition count 170
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 111 place count 68 transition count 159
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 67 transition count 157
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 67 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 120 place count 67 transition count 150
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 67 transition count 147
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 126 place count 64 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 126 place count 64 transition count 145
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 130 place count 62 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 6 with 4 rules applied. Total rules applied 134 place count 60 transition count 143
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 60 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 136 place count 59 transition count 142
Applied a total of 136 rules in 87 ms. Remains 59 /129 variables (removed 70) and now considering 142/223 (removed 81) transitions.
// Phase 1: matrix 142 rows 59 cols
[2024-06-02 19:24:17] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:24:17] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 19:24:17] [INFO ] Invariant cache hit.
[2024-06-02 19:24:17] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-02 19:24:17] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-02 19:24:18] [INFO ] Redundant transitions in 35 ms returned [141]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 138 sub problems to find dead transitions.
// Phase 1: matrix 141 rows 59 cols
[2024-06-02 19:24:18] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:24:18] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-02 19:24:19] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-06-02 19:24:19] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 141/200 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 121 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4718 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 141/200 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 138/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 259 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 2/2 constraints]
After SMT, in 13859ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 13863ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/129 places, 141/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 14245 ms. Remains : 59/129 places, 141/223 transitions.
[2024-06-02 19:24:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:24:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:24:31] [INFO ] Input system was already deterministic with 141 transitions.
[2024-06-02 19:24:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:24:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:24:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality8761922207399940054.gal : 2 ms
[2024-06-02 19:24:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14983711227746633631.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/CTLCardinality8761922207399940054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14983711227746633631.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,728602,0.448429,10988,2,1036,5,26528,6,0,366,37384,0


Converting to forward existential form...Done !
original formula: E(EF((!(EF((p127==1))) * ((p140==0)||(p61==1)))) U (!(E(EG(((p65==0)||(p107==1))) U (p89!=1))) * !(AG((p52!=1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,E(TRUE U (!(E(TRUE U (p127==1))) * ((p140==0)||(p61==1))))) * !(E(EG(((p65==0)||(p107==1))) U ...197
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t17, t19, t20, t23, t24, t26, t28, t29, ...355
(forward)formula 0,1,16.1029,377868,1,0,612,2.35895e+06,318,247,3328,2.07898e+06,714
FORMULA MedleyA-PT-07-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 105 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 105 transition count 195
Applied a total of 47 rules in 7 ms. Remains 105 /129 variables (removed 24) and now considering 195/223 (removed 28) transitions.
// Phase 1: matrix 195 rows 105 cols
[2024-06-02 19:24:48] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:24:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 19:24:48] [INFO ] Invariant cache hit.
[2024-06-02 19:24:48] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-02 19:24:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:24:50] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:24:50] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:24:50] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:24:50] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:24:51] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:24:51] [INFO ] Deduced a trap composed of 14 places in 67 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, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 121 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9904 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/315 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:25:03] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:25:03] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 317 constraints, problems are : Problem set: 0 solved, 194 unsolved in 15324 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 8/8 constraints]
After SMT, in 25338ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 25340ms
Starting structural reductions in LTL mode, iteration 1 : 105/129 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25573 ms. Remains : 105/129 places, 195/223 transitions.
[2024-06-02 19:25:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:25:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:25:13] [INFO ] Input system was already deterministic with 195 transitions.
[2024-06-02 19:25:13] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:25:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:25:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality1360134637941379291.gal : 2 ms
[2024-06-02 19:25:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality17416117765614279214.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/CTLCardinality1360134637941379291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17416117765614279214.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AX(E((p122!=0) U AF(EX((p130==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E((p122!=0) U !(EG(!(EX((p130==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t12, t14, t15, t16, t18, t24, t25, t26, t28, t33, t34, t35, t36, t38, t39, t41, t42,...456
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 19:25:43] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:25:43] [INFO ] Applying decomposition
[2024-06-02 19:25:43] [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/graph1988531003920106343.txt' '-o' '/tmp/graph1988531003920106343.bin' '-w' '/tmp/graph1988531003920106343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1988531003920106343.bin' '-l' '-1' '-v' '-w' '/tmp/graph1988531003920106343.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:25:43] [INFO ] Decomposing Gal with order
[2024-06-02 19:25:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:25:43] [INFO ] Removed a total of 274 redundant transitions.
[2024-06-02 19:25:43] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:25:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 3 ms.
[2024-06-02 19:25:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3236748996600814401.gal : 6 ms
[2024-06-02 19:25:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality1186544803665376570.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/CTLCardinality3236748996600814401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1186544803665376570.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55425e+07,0.212886,9860,382,71,11027,657,316,28615,69,2982,0


Converting to forward existential form...Done !
original formula: EX(AX(E((i7.i0.u29.p122!=0) U AF(EX((i7.i0.u28.p130==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E((i7.i0.u29.p122!=0) U !(EG(!(EX((i7.i0.u28.p130==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t35, t73, i1.u2.t104, i1.u4.t101, i2.t94, i2.t93, i2.t92, i2.t88, i2.u5.t96, i2.u5.t97, i2.u5...794
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
Using 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,14.1338,347644,1,0,505954,3429,1988,1.8547e+06,344,33239,359827
FORMULA MedleyA-PT-07-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 105 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 105 transition count 195
Applied a total of 47 rules in 3 ms. Remains 105 /129 variables (removed 24) and now considering 195/223 (removed 28) transitions.
// Phase 1: matrix 195 rows 105 cols
[2024-06-02 19:25:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:25:58] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 19:25:58] [INFO ] Invariant cache hit.
[2024-06-02 19:25:58] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-02 19:25:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:26:00] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:26:00] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 3 ms to minimize.
[2024-06-02 19:26:00] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:26:00] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:26:00] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:26:00] [INFO ] Deduced a trap composed of 14 places in 66 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, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 121 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9498 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/315 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:26:17] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/300 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:26:20] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 0/300 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 317 constraints, problems are : Problem set: 0 solved, 194 unsolved in 23485 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 8/8 constraints]
After SMT, in 33093ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 33097ms
Starting structural reductions in LTL mode, iteration 1 : 105/129 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33323 ms. Remains : 105/129 places, 195/223 transitions.
[2024-06-02 19:26:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:26:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:26:31] [INFO ] Input system was already deterministic with 195 transitions.
[2024-06-02 19:26:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:26:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:26:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality6444533778809922655.gal : 3 ms
[2024-06-02 19:26:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14156493988663484389.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/CTLCardinality6444533778809922655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14156493988663484389.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG((A(((p29==0)||(p37==1)) U (p56==0)) + AG((p70==0)))) + AX(((AX((p70==1)) * AF((p88==0))) * ((p54==0)&&(p97==1)))))
=> equivalent forward existential formula: (([(EY(EY((Init * !(!(E(TRUE U !((!((E(!((p56==0)) U (!(((p29==0)||(p37==1))) * !((p56==0)))) + EG(!((p56==0))))...569
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...482
Detected timeout of ITS tools.
[2024-06-02 19:27:01] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:27:01] [INFO ] Applying decomposition
[2024-06-02 19:27:01] [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/graph5627748101665130900.txt' '-o' '/tmp/graph5627748101665130900.bin' '-w' '/tmp/graph5627748101665130900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5627748101665130900.bin' '-l' '-1' '-v' '-w' '/tmp/graph5627748101665130900.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:27:01] [INFO ] Decomposing Gal with order
[2024-06-02 19:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:27:01] [INFO ] Removed a total of 260 redundant transitions.
[2024-06-02 19:27:01] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 2 ms.
[2024-06-02 19:27:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality13726147837811676795.gal : 2 ms
[2024-06-02 19:27:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality8833044885574221108.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/CTLCardinality13726147837811676795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8833044885574221108.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55808e+07,0.145209,7720,523,81,7335,455,304,17115,85,2228,0


Converting to forward existential form...Done !
original formula: (AG((A(((i1.u6.p29==0)||(i1.u7.p37==1)) U (i2.u10.p56==0)) + AG((i3.u13.p70==0)))) + AX(((AX((i3.u13.p70==1)) * AF((i4.u17.p88==0))) * ((...190
=> equivalent forward existential formula: (([(EY(EY((Init * !(!(E(TRUE U !((!((E(!((i2.u10.p56==0)) U (!(((i1.u6.p29==0)||(i1.u7.p37==1))) * !((i2.u10.p56...717
Reverse transition relation is NOT exact ! Due to transitions t27, t34, t73, i0.u2.t104, i0.u4.t101, i1.t89, i1.t88, i1.u5.t71, i1.u5.t99, i1.u5.t100, i1.u...799
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,2.43357,69760,1,0,127388,2119,1858,271833,452,11052,180474
FORMULA MedleyA-PT-07-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 108 transition count 200
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 108 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 107 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 107 transition count 198
Applied a total of 43 rules in 4 ms. Remains 107 /129 variables (removed 22) and now considering 198/223 (removed 25) transitions.
// Phase 1: matrix 198 rows 107 cols
[2024-06-02 19:27:04] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:27:04] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 19:27:04] [INFO ] Invariant cache hit.
[2024-06-02 19:27:04] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-06-02 19:27:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:27:06] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:27:06] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:27:06] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:27:06] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-06-02 19:27:06] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-02 19:27:06] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:27:10] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 124 constraints, problems are : Problem set: 0 solved, 197 unsolved in 11659 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 197/321 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 19:27:20] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:27:20] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:27:20] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-06-02 19:27:20] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:27:20] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:27:21] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 6/327 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (OVERLAPS) 0/305 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 327 constraints, problems are : Problem set: 0 solved, 197 unsolved in 15581 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 13/13 constraints]
After SMT, in 27373ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 27376ms
Starting structural reductions in LTL mode, iteration 1 : 107/129 places, 198/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27608 ms. Remains : 107/129 places, 198/223 transitions.
[2024-06-02 19:27:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:27:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:27:31] [INFO ] Input system was already deterministic with 198 transitions.
[2024-06-02 19:27:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:27:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:27:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality7738809021011166030.gal : 1 ms
[2024-06-02 19:27:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14857328659051654479.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/CTLCardinality7738809021011166030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14857328659051654479.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,2.12021e+07,3.10669,67580,2,6797,5,204362,6,0,626,320336,0


Converting to forward existential form...Done !
original formula: (AG(!(A(!(((EX(TRUE) * (p93==0)) * (p125==1))) U EF(EG(((p144==0)||(p52==1))))))) * A(AF(!(((p41==0)||(p129==1)))) U ((p20==1)&&((p19==0)...169
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(E(TRUE U EG(((p144==0)||(p52==1)))))))) * !(E(!(E(TRUE U EG(((p144==0)||(p52==1))))...450
Hit Full ! (commute/partial/dont) 137/0/61
Hit Full ! (commute/partial/dont) 137/0/61
Hit Full ! (commute/partial/dont) 193/0/5
(forward)formula 0,0,12.6702,248384,1,0,50,983016,33,8,3907,1.07149e+06,52
FORMULA MedleyA-PT-07-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 19:27:44] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:27:44] [INFO ] Flatten gal took : 6 ms
Total runtime 739950 ms.

BK_STOP 1717356464583

--------------------
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-07"
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-07, 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-171734919900049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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