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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K 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 107K 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-10-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717359436186

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 20:17:18] [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 20:17:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:17:18] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-06-02 20:17:18] [INFO ] Transformed 149 places.
[2024-06-02 20:17:18] [INFO ] Transformed 340 transitions.
[2024-06-02 20:17:18] [INFO ] Found NUPN structural information;
[2024-06-02 20:17:18] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Support contains 90 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 340
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 136 transition count 327
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 136 transition count 327
Applied a total of 24 rules in 77 ms. Remains 136 /149 variables (removed 13) and now considering 327/340 (removed 13) transitions.
// Phase 1: matrix 327 rows 136 cols
[2024-06-02 20:17:19] [INFO ] Computed 10 invariants in 38 ms
[2024-06-02 20:17:19] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-06-02 20:17:19] [INFO ] Invariant cache hit.
[2024-06-02 20:17:20] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2024-06-02 20:17:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/135 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 20:17:25] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 46 ms to minimize.
[2024-06-02 20:17:25] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-06-02 20:17:25] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 3 ms to minimize.
[2024-06-02 20:17:26] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-06-02 20:17:26] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:17:26] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:17:26] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:17:26] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 2 ms to minimize.
[2024-06-02 20:17:27] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 2 ms to minimize.
[2024-06-02 20:17:27] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 2 ms to minimize.
[2024-06-02 20:17:27] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:17:28] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 12/22 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 20:17:30] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-06-02 20:17:31] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-06-02 20:17:31] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-06-02 20:17:31] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:17:31] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:17:31] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:17:31] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:17:31] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 12/34 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/34 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 327/462 variables, 135/169 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 2 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 3 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 9/178 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 20:17:41] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 1/179 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 20:17:45] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 10 ms to minimize.
[2024-06-02 20:17:45] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:17:45] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:17:46] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 4/183 constraints. Problems are: Problem set: 64 solved, 262 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/463 variables, and 183 constraints, problems are : Problem set: 64 solved, 262 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/136 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 64 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 38/48 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/48 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 327/462 variables, 135/183 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 261/444 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 20:18:00] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:18:00] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 3/447 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 20:18:10] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:18:11] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 2/449 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 20:18:18] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/463 variables, and 450 constraints, problems are : Problem set: 64 solved, 262 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/136 constraints, PredecessorRefiner: 261/326 constraints, Known Traps: 44/44 constraints]
After SMT, in 61262ms problems are : Problem set: 64 solved, 262 unsolved
Search for dead transitions found 64 dead transitions in 61300ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/149 places, 263/340 transitions.
Applied a total of 0 rules in 6 ms. Remains 136 /136 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62429 ms. Remains : 136/149 places, 263/340 transitions.
Support contains 90 out of 136 places after structural reductions.
[2024-06-02 20:18:21] [INFO ] Flatten gal took : 116 ms
[2024-06-02 20:18:21] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA MedleyA-PT-10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:18:22] [INFO ] Flatten gal took : 35 ms
[2024-06-02 20:18:22] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 84 out of 136 places (down from 90) after GAL structural reductions.
RANDOM walk for 40000 steps (1744 resets) in 3397 ms. (11 steps per ms) remains 36/65 properties
BEST_FIRST walk for 4004 steps (41 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (42 resets) in 110 ms. (36 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (41 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (41 resets) in 49 ms. (80 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (41 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (41 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (40 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (41 resets) in 64 ms. (61 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (40 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (41 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (39 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (39 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (43 resets) in 43 ms. (90 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (43 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (42 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (36 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (42 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (42 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (42 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (41 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (42 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (44 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (38 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (44 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (42 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (42 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (41 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
// Phase 1: matrix 263 rows 136 cols
[2024-06-02 20:18:23] [INFO ] Computed 10 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/90 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 25/115 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 250/365 variables, 115/123 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 22/387 variables, 14/137 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 2/139 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 10/397 variables, 6/145 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 2/399 variables, 1/146 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/399 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 146 constraints, problems are : Problem set: 1 solved, 35 unsolved in 2450 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 42/89 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-06-02 20:18:26] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:18:26] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:18:26] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 26/115 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-06-02 20:18:27] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-06-02 20:18:27] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:18:27] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:18:27] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 3 ms to minimize.
[2024-06-02 20:18:27] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:18:27] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:18:27] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:18:27] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:18:27] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 3 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 15 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 6 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 3 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
Problem AtomicPropp64 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 20/31 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:18:30] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:18:31] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:18:31] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:18:31] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 7554ms, After SMT, problems are : Problem set: 2 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 133 transition count 250
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 123 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 122 transition count 248
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 25 place count 122 transition count 244
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 33 place count 118 transition count 244
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 43 place count 108 transition count 228
Iterating global reduction 3 with 10 rules applied. Total rules applied 53 place count 108 transition count 228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 place count 108 transition count 227
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 107 transition count 227
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 81 place count 94 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 94 transition count 213
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 92 transition count 211
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 92 transition count 211
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 96 place count 87 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 4 with 38 rules applied. Total rules applied 134 place count 87 transition count 224
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 87 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 85 transition count 227
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 85 transition count 227
Applied a total of 139 rules in 131 ms. Remains 85 /136 variables (removed 51) and now considering 227/263 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 85/136 places, 227/263 transitions.
RANDOM walk for 40000 steps (5918 resets) in 788 ms. (50 steps per ms) remains 2/34 properties
BEST_FIRST walk for 40004 steps (1609 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1585 resets) in 74 ms. (533 steps per ms) remains 1/2 properties
// Phase 1: matrix 227 rows 85 cols
[2024-06-02 20:18:31] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 20:18:31] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/51 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/83 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 226/309 variables, 83/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 66/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/312 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 10/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/312 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/51 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/83 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:18:32] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 226/309 variables, 83/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 66/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/312 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 10/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/312 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 792 steps, including 156 resets, run visited all 1 properties in 8 ms. (steps per millisecond=99 )
Parikh walk visited 1 properties in 20 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:18:32] [INFO ] Flatten gal took : 33 ms
[2024-06-02 20:18:32] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:18:32] [INFO ] Input system was already deterministic with 263 transitions.
Computed a total of 13 stabilizing places and 15 stable transitions
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 132 transition count 244
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 38 place count 116 transition count 239
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 114 transition count 238
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 41 place count 114 transition count 235
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 111 transition count 235
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 71 place count 87 transition count 202
Iterating global reduction 3 with 24 rules applied. Total rules applied 95 place count 87 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 95 place count 87 transition count 200
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 85 transition count 200
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 79 transition count 183
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 79 transition count 183
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 77 transition count 179
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 77 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 76 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 76 transition count 176
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 143 place count 62 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 59 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 59 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 59 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 152 place count 59 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 58 transition count 155
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 3 with 4 rules applied. Total rules applied 158 place count 56 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 54 transition count 151
Applied a total of 160 rules in 71 ms. Remains 54 /136 variables (removed 82) and now considering 151/263 (removed 112) transitions.
// Phase 1: matrix 151 rows 54 cols
[2024-06-02 20:18:32] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:18:32] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 20:18:32] [INFO ] Invariant cache hit.
[2024-06-02 20:18:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 20:18:32] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-06-02 20:18:32] [INFO ] Redundant transitions in 7 ms returned []
Running 143 sub problems to find dead transitions.
[2024-06-02 20:18:32] [INFO ] Invariant cache hit.
[2024-06-02 20:18:32] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 150/203 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 2/205 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/205 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 78 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3868 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 150/203 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 142/219 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 2/205 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 221 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 10047ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 10050ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/136 places, 151/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10384 ms. Remains : 54/136 places, 151/263 transitions.
[2024-06-02 20:18:42] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:18:43] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:18:43] [INFO ] Input system was already deterministic with 151 transitions.
[2024-06-02 20:18:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:18:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:18:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality7972025502761543417.gal : 7 ms
[2024-06-02 20:18:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4087885355403570479.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/CTLCardinality7972025502761543417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4087885355403570479.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,695216,0.893303,21224,2,1962,5,59419,6,0,362,64747,0


Converting to forward existential form...Done !
original formula: E((p30==1) U AF(((p116==1) + (!(((p70==0)||(p33==1))) * !(AG(((p43==0)||(p134==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,(p30==1)) * !(EG(!(((p116==1) + (!(((p70==0)||(p33==1))) * !(!(E(TRUE U !(((p43==0)||(p134==1)))))))...170
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t16, t18, t19, t20, t21, t22, t23, t24, t...328
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 149/0/2
(forward)formula 0,0,23.5926,532624,1,0,492,3.05064e+06,342,232,3602,2.32904e+06,560
FORMULA MedleyA-PT-10-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 132 transition count 246
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 20 rules applied. Total rules applied 35 place count 118 transition count 240
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 115 transition count 239
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 39 place count 115 transition count 236
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 45 place count 112 transition count 236
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 62 place count 95 transition count 213
Iterating global reduction 3 with 17 rules applied. Total rules applied 79 place count 95 transition count 213
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 92 transition count 202
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 92 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 91 transition count 200
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 91 transition count 200
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 109 place count 80 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 80 transition count 188
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 78 transition count 186
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 78 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 78 transition count 182
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 118 place count 78 transition count 180
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 122 place count 76 transition count 180
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 126 place count 74 transition count 178
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 72 transition count 176
Applied a total of 128 rules in 57 ms. Remains 72 /136 variables (removed 64) and now considering 176/263 (removed 87) transitions.
// Phase 1: matrix 176 rows 72 cols
[2024-06-02 20:19:06] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 20:19:06] [INFO ] Implicit Places using invariants in 65 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/136 places, 176/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 71 /71 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 130 ms. Remains : 71/136 places, 176/263 transitions.
[2024-06-02 20:19:07] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:19:07] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:19:07] [INFO ] Input system was already deterministic with 176 transitions.
[2024-06-02 20:19:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:19:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:19:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality937332871742820274.gal : 11 ms
[2024-06-02 20:19:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality8051921203064879982.ctl : 3 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/CTLCardinality937332871742820274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8051921203064879982.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.54997e+06,1.05778,30364,2,4048,5,79264,6,0,456,113170,0


Converting to forward existential form...Done !
original formula: EF((E(((((EF(((p51==0)||(p52==1))) + (p31==0)) + (p18==1)) * AF(((p19==0)||(p115==1)))) * !((((p65==0)||(p58==1))&&(p72==1)))) U AG(((p11...266
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),((((E(TRUE U ((p51==0)||(p52==1))) + (p31==0)) + (p18==1)) * !(EG(!(((p19==0)||(p115==1)...609
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t23, t24, ...453
(forward)formula 0,1,11.6953,275200,1,0,552,1.4961e+06,391,201,4470,1.1072e+06,648
FORMULA MedleyA-PT-10-CTLCardinality-2024-01 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 : 136/136 places, 263/263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 111 transition count 230
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 111 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 111 transition count 227
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 107 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 107 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 106 transition count 217
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 106 transition count 217
Applied a total of 63 rules in 13 ms. Remains 106 /136 variables (removed 30) and now considering 217/263 (removed 46) transitions.
// Phase 1: matrix 217 rows 106 cols
[2024-06-02 20:19:18] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:19:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 20:19:18] [INFO ] Invariant cache hit.
[2024-06-02 20:19:19] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-02 20:19:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:19:23] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-06-02 20:19:23] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-02 20:19:23] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/322 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:19:26] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 0/323 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 125 constraints, problems are : Problem set: 0 solved, 216 unsolved in 13981 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/322 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 215/339 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 1/323 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:19:44] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:19:45] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:19:45] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:19:47] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:19:54] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/323 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/323 variables, and 346 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 14/14 constraints]
After SMT, in 44227ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 44230ms
Starting structural reductions in LTL mode, iteration 1 : 106/136 places, 217/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44484 ms. Remains : 106/136 places, 217/263 transitions.
[2024-06-02 20:20:03] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:20:03] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:20:03] [INFO ] Input system was already deterministic with 217 transitions.
[2024-06-02 20:20:03] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:20:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:20:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality784980066139602690.gal : 6 ms
[2024-06-02 20:20:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality16760079873903362368.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality784980066139602690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16760079873903362368.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,3.3792e+07,6.76862,141412,2,20622,5,374134,6,0,638,629397,0


Converting to forward existential form...Done !
original formula: E(!(((!(((p73==0)||(p17==1))) + AF(((p126==1)&&(p42==1)))) * ((p124==0)||(p98==1)))) U ((E(((p29==0)||(p104==1)) U !(EG((p132==0)))) * AG...326
=> equivalent forward existential formula: (([(((FwdU(Init,!(((!(((p73==0)||(p17==1))) + !(EG(!(((p126==1)&&(p42==1)))))) * ((p124==0)||(p98==1))))) * (E((...862
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t10, t11, t16, t17, t18, t19, t20, t22, t24, t25, t26, t27, t28, t29, t30, t31, t33, ...580
Detected timeout of ITS tools.
[2024-06-02 20:20:33] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:20:33] [INFO ] Applying decomposition
[2024-06-02 20:20:33] [INFO ] Flatten gal took : 17 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/graph5388703723533366247.txt' '-o' '/tmp/graph5388703723533366247.bin' '-w' '/tmp/graph5388703723533366247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5388703723533366247.bin' '-l' '-1' '-v' '-w' '/tmp/graph5388703723533366247.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:20:33] [INFO ] Decomposing Gal with order
[2024-06-02 20:20:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:20:33] [INFO ] Removed a total of 406 redundant transitions.
[2024-06-02 20:20:34] [INFO ] Flatten gal took : 117 ms
[2024-06-02 20:20:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 23 ms.
[2024-06-02 20:20:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality7011107377447102769.gal : 7 ms
[2024-06-02 20:20:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4827356700499856900.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/CTLCardinality7011107377447102769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4827356700499856900.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,3.3792e+07,0.545201,15520,943,526,17352,3117,401,60073,160,20377,0


Converting to forward existential form...Done !
original formula: E(!(((!(((i3.u10.p73==0)||(i0.u1.p17==1))) + AF(((i1.i1.u20.p126==1)&&(i0.u9.p42==1)))) * ((i6.i0.u0.p124==0)||(i4.u14.p98==1)))) U ((E((...479
=> equivalent forward existential formula: (([(((FwdU(Init,!(((!(((i3.u10.p73==0)||(i0.u1.p17==1))) + !(EG(!(((i1.i1.u20.p126==1)&&(i0.u9.p42==1)))))) * ((...1193
Reverse transition relation is NOT exact ! Due to transitions t18, t62, t95, t100, t189, t190, t191, t192, t203, t204, t205, t206, i0.u1.t90, i0.u1.t91, i0...954
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 102 transition count 221
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 102 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 102 transition count 219
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 95 transition count 201
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 95 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 93 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 93 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 91 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 91 transition count 191
Applied a total of 91 rules in 28 ms. Remains 91 /136 variables (removed 45) and now considering 191/263 (removed 72) transitions.
// Phase 1: matrix 191 rows 91 cols
[2024-06-02 20:21:04] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:21:04] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 20:21:04] [INFO ] Invariant cache hit.
[2024-06-02 20:21:04] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-06-02 20:21:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-02 20:21:06] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 7 ms to minimize.
[2024-06-02 20:21:06] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/282 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-02 20:21:08] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 104 constraints, problems are : Problem set: 0 solved, 190 unsolved in 8334 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/282 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 190/294 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-02 20:21:19] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/282 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 295 constraints, problems are : Problem set: 0 solved, 190 unsolved in 15449 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 4/4 constraints]
After SMT, in 23979ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 23982ms
Starting structural reductions in LTL mode, iteration 1 : 91/136 places, 191/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24318 ms. Remains : 91/136 places, 191/263 transitions.
[2024-06-02 20:21:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:21:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:21:28] [INFO ] Input system was already deterministic with 191 transitions.
[2024-06-02 20:21:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:21:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:21:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality8074907908647632762.gal : 3 ms
[2024-06-02 20:21:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality18183524929114121950.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/CTLCardinality8074907908647632762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18183524929114121950.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.41432e+07,2.25151,51944,2,6337,5,142954,6,0,555,216340,0


Converting to forward existential form...Done !
original formula: A(EX(!(EG(AF((p55==0))))) U (A(((p90==0)||(p53==1)) U AF(EG((p114==1)))) + EX(TRUE)))
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(EG(!(EG((p114==1)))))) U (!(((p90==0)||(p53==1))) * !(!(EG(!(EG((p114==1)))))))) + EG...541
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t27, t28, t29, t30, t31, t32, t33, ...427
Detected timeout of ITS tools.
[2024-06-02 20:21:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:21:58] [INFO ] Applying decomposition
[2024-06-02 20:21:58] [INFO ] Flatten gal took : 38 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/graph7044347794609600547.txt' '-o' '/tmp/graph7044347794609600547.bin' '-w' '/tmp/graph7044347794609600547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7044347794609600547.bin' '-l' '-1' '-v' '-w' '/tmp/graph7044347794609600547.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:21:58] [INFO ] Decomposing Gal with order
[2024-06-02 20:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:21:58] [INFO ] Removed a total of 360 redundant transitions.
[2024-06-02 20:21:58] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:21:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 8 ms.
[2024-06-02 20:21:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality3871018264882315434.gal : 21 ms
[2024-06-02 20:21:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality14119991322884309015.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/CTLCardinality3871018264882315434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14119991322884309015.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.41432e+07,0.200433,8828,420,202,8322,1222,353,20159,105,10001,0


Converting to forward existential form...Done !
original formula: A(EX(!(EG(AF((i0.u9.p55==0))))) U (A(((i4.u14.p90==0)||(i0.u9.p53==1)) U AF(EG((i5.u18.p114==1)))) + EX(TRUE)))
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(EG(!(EG((i5.u18.p114==1)))))) U (!(((i4.u14.p90==0)||(i0.u9.p53==1))) * !(!(EG(!(EG((...649
Reverse transition relation is NOT exact ! Due to transitions t17, t51, t81, t85, i0.u9.t50, i0.u9.t52, i0.u9.t53, i0.u9.t54, i0.u9.t56, i0.u9.t57, i0.u9.t...719
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,6.91963,162212,1,0,256136,16365,2119,723800,604,152616,321757
FORMULA MedleyA-PT-10-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 134 transition count 241
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 45 place count 114 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 45 place count 114 transition count 235
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 112 transition count 235
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 73 place count 88 transition count 202
Iterating global reduction 2 with 24 rules applied. Total rules applied 97 place count 88 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 97 place count 88 transition count 200
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 86 transition count 200
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 80 transition count 187
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 80 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 79 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 79 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 78 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 78 transition count 182
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 142 place count 65 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 65 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 63 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 63 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 63 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 151 place count 63 transition count 159
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 61 transition count 159
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 3 with 4 rules applied. Total rules applied 159 place count 59 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 57 transition count 155
Applied a total of 161 rules in 77 ms. Remains 57 /136 variables (removed 79) and now considering 155/263 (removed 108) transitions.
// Phase 1: matrix 155 rows 57 cols
[2024-06-02 20:22:05] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:22:06] [INFO ] Implicit Places using invariants in 99 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/136 places, 155/263 transitions.
Applied a total of 0 rules in 7 ms. Remains 56 /56 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 186 ms. Remains : 56/136 places, 155/263 transitions.
[2024-06-02 20:22:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:22:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:22:06] [INFO ] Input system was already deterministic with 155 transitions.
[2024-06-02 20:22:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:22:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:22:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16674104672054200136.gal : 3 ms
[2024-06-02 20:22:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality11441875062379029122.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/CTLCardinality16674104672054200136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11441875062379029122.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,954168,0.617636,17696,2,1688,5,44456,6,0,373,64812,0


Converting to forward existential form...Done !
original formula: EG(EF((((p14==1) + EF((p104==0))) + A(((p147==0)||(p126==1)) U ((p127==0)||(p47==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p14==1) + E(TRUE U (p104==0))) + !((E(!(((p127==0)||(p47==1))) U (!(((p147==0)||(p126==1)...232
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t16, t17, t19, t21, t22, t23, t24, t25, t...404
(forward)formula 0,1,5.44815,129772,1,0,463,697662,346,172,3812,646344,556
FORMULA MedleyA-PT-10-CTLCardinality-2024-05 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 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 222
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 103 transition count 218
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 97 transition count 203
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 97 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 95 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 95 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 94 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 94 transition count 195
Applied a total of 87 rules in 11 ms. Remains 94 /136 variables (removed 42) and now considering 195/263 (removed 68) transitions.
// Phase 1: matrix 195 rows 94 cols
[2024-06-02 20:22:11] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:22:11] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:22:11] [INFO ] Invariant cache hit.
[2024-06-02 20:22:11] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-02 20:22:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 20:22:13] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-06-02 20:22:13] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:22:14] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:22:14] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/289 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 20:22:16] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 20:22:18] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-06-02 20:22:18] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 111 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11219 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 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/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/289 variables, 94/111 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 194/305 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 20:22:27] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 307 constraints, problems are : Problem set: 0 solved, 194 unsolved in 20553 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 9/9 constraints]
After SMT, in 31981ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 31985ms
Starting structural reductions in LTL mode, iteration 1 : 94/136 places, 195/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32302 ms. Remains : 94/136 places, 195/263 transitions.
[2024-06-02 20:22:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:22:43] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:22:43] [INFO ] Input system was already deterministic with 195 transitions.
[2024-06-02 20:22:43] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:22:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:22:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality18394421507917494810.gal : 4 ms
[2024-06-02 20:22:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality10308494881359156566.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/CTLCardinality18394421507917494810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10308494881359156566.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.6895e+07,4.87546,108480,2,13752,5,300512,6,0,570,439240,0


Converting to forward existential form...Done !
original formula: AG(E(E((!(EX(((p108==0)||(p138==1)))) + AF(((p129==0)||(p71==1)))) U !(AX((p134==1)))) U EG(EF((p23==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E((!(EX(((p108==0)||(p138==1)))) + !(EG(!(((p129==0)||(p71==1)))))) U !(!(EX(!((p134==1)...197
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t26, t27, t29, t31, t32, t35, t36, ...451
Detected timeout of ITS tools.
[2024-06-02 20:23:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:23:14] [INFO ] Applying decomposition
[2024-06-02 20:23:14] [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/graph13396247454913926695.txt' '-o' '/tmp/graph13396247454913926695.bin' '-w' '/tmp/graph13396247454913926695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13396247454913926695.bin' '-l' '-1' '-v' '-w' '/tmp/graph13396247454913926695.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:23:14] [INFO ] Decomposing Gal with order
[2024-06-02 20:23:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:23:14] [INFO ] Removed a total of 401 redundant transitions.
[2024-06-02 20:23:14] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:23:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 8 ms.
[2024-06-02 20:23:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality16338780451848574488.gal : 2 ms
[2024-06-02 20:23:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality6825334162159135173.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/CTLCardinality16338780451848574488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6825334162159135173.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.6895e+07,0.316685,14168,693,274,17772,1706,411,48718,101,10127,0


Converting to forward existential form...Done !
original formula: AG(E(E((!(EX(((i6.u20.p108==0)||(i7.i1.u25.p138==1)))) + AF(((i7.i0.u22.p129==0)||(i4.u12.p71==1)))) U !(AX((i7.i0.u24.p134==1)))) U EG(E...175
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E((!(EX(((i6.u20.p108==0)||(i7.i1.u25.p138==1)))) + !(EG(!(((i7.i0.u22.p129==0)||(i4.u12...247
Reverse transition relation is NOT exact ! Due to transitions t17, t51, t78, t84, t179, t180, t181, t182, i1.u5.t72, i1.u5.t73, i2.t65, i2.t62, i2.t61, i2....631
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,5.38506,150700,1,0,200914,11362,2388,888986,516,89441,290665
FORMULA MedleyA-PT-10-CTLCardinality-2024-07 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 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 223
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 103 transition count 219
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 96 transition count 203
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 96 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 95 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 95 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 94 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 94 transition count 198
Applied a total of 87 rules in 7 ms. Remains 94 /136 variables (removed 42) and now considering 198/263 (removed 65) transitions.
// Phase 1: matrix 198 rows 94 cols
[2024-06-02 20:23:19] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:23:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 20:23:19] [INFO ] Invariant cache hit.
[2024-06-02 20:23:19] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-06-02 20:23:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 20:23:21] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:23:21] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:23:21] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:23:21] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/292 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 20:23:23] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 0/292 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 109 constraints, problems are : Problem set: 0 solved, 197 unsolved in 8935 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/292 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 197/306 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 0/292 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 306 constraints, problems are : Problem set: 0 solved, 197 unsolved in 10387 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints]
After SMT, in 19521ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 19523ms
Starting structural reductions in LTL mode, iteration 1 : 94/136 places, 198/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19782 ms. Remains : 94/136 places, 198/263 transitions.
[2024-06-02 20:23:39] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:23:39] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:23:39] [INFO ] Input system was already deterministic with 198 transitions.
[2024-06-02 20:23:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:23:39] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:23:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality12987027584210293018.gal : 2 ms
[2024-06-02 20:23:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality2512564520910127593.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/CTLCardinality12987027584210293018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2512564520910127593.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.63598e+07,2.13276,52908,2,7236,5,151458,6,0,574,205649,0


Converting to forward existential form...Done !
original formula: AX(((p117==0) * ((EG((p9==0)) + (p29==1)) + (((p45==0)&&(p85==0))&&(p32==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !((p117==0)))] = FALSE * [(((EY(Init) * !((((p45==0)&&(p85==0))&&(p32==1)))) * !((p29==1))) * !(EG...176
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t25, t26, t28, t29, t31, t33, t34, ...456
Detected timeout of ITS tools.
[2024-06-02 20:24:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:24:09] [INFO ] Applying decomposition
[2024-06-02 20:24:09] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17657983578598422007.txt' '-o' '/tmp/graph17657983578598422007.bin' '-w' '/tmp/graph17657983578598422007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17657983578598422007.bin' '-l' '-1' '-v' '-w' '/tmp/graph17657983578598422007.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:24:09] [INFO ] Decomposing Gal with order
[2024-06-02 20:24:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:24:09] [INFO ] Removed a total of 387 redundant transitions.
[2024-06-02 20:24:09] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:24:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 7 ms.
[2024-06-02 20:24:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality4923372401898062065.gal : 2 ms
[2024-06-02 20:24:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality1619292993713727007.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/CTLCardinality4923372401898062065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1619292993713727007.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.63598e+07,0.303865,12836,545,352,15394,2610,388,33842,132,21649,0


Converting to forward existential form...Done !
original formula: AX(((i6.u19.p117==0) * ((EG((i3.u2.p9==0)) + (i2.u6.p29==1)) + (((i3.u10.p45==0)&&(i4.u13.p85==0))&&(i2.u8.p32==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !((i6.u19.p117==0)))] = FALSE * [(((EY(Init) * !((((i3.u10.p45==0)&&(i4.u13.p85==0))&&(i2.u8.p32==...215
Reverse transition relation is NOT exact ! Due to transitions t17, t53, t81, t87, t88, t178, t179, t180, t181, i1.u5.t77, i2.t70, i2.t67, i2.t66, i2.u6.t51...745
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,1,9.27394,237284,1,0,309012,28919,2235,1.25058e+06,728,320111,384983
FORMULA MedleyA-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 225
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 103 transition count 222
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 96 transition count 204
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 96 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 94 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 94 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 93 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 93 transition count 197
Applied a total of 88 rules in 8 ms. Remains 93 /136 variables (removed 43) and now considering 197/263 (removed 66) transitions.
// Phase 1: matrix 197 rows 93 cols
[2024-06-02 20:24:18] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:24:19] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 20:24:19] [INFO ] Invariant cache hit.
[2024-06-02 20:24:19] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-02 20:24:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 20:24:21] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:24:21] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/290 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 20:24:24] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/290 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 106 constraints, problems are : Problem set: 0 solved, 196 unsolved in 10800 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/290 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 196/302 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 20:24:33] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/290 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 303 constraints, problems are : Problem set: 0 solved, 196 unsolved in 16183 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 4/4 constraints]
After SMT, in 27277ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 27281ms
Starting structural reductions in LTL mode, iteration 1 : 93/136 places, 197/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27595 ms. Remains : 93/136 places, 197/263 transitions.
[2024-06-02 20:24:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:24:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:24:46] [INFO ] Input system was already deterministic with 197 transitions.
[2024-06-02 20:24:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:24:46] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:24:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality12299189391194733777.gal : 9 ms
[2024-06-02 20:24:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality16098444130070501774.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/CTLCardinality12299189391194733777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16098444130070501774.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.58065e+07,1.92349,49500,2,5760,5,134864,6,0,569,203478,0


Converting to forward existential form...Done !
original formula: !(A(!(AX(!(((p53==0)||(p59==1))))) U !((!(EX(((p45==0)||(p98==1)))) + AF((EG((p103==1)) * EF((p32==1))))))))
=> equivalent forward existential formula: (([((FwdU(Init,!(!((!(EX(((p45==0)||(p98==1)))) + !(EG(!((EG((p103==1)) * E(TRUE U (p32==1)))))))))) * !(!(!(EX(...542
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t25, t26, t27, t28, t30, t31, t34, t35, t37, ...485
Detected timeout of ITS tools.
[2024-06-02 20:25:16] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:25:16] [INFO ] Applying decomposition
[2024-06-02 20:25:16] [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/graph7567594219776524919.txt' '-o' '/tmp/graph7567594219776524919.bin' '-w' '/tmp/graph7567594219776524919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7567594219776524919.bin' '-l' '-1' '-v' '-w' '/tmp/graph7567594219776524919.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:25:16] [INFO ] Decomposing Gal with order
[2024-06-02 20:25:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:25:16] [INFO ] Removed a total of 422 redundant transitions.
[2024-06-02 20:25:16] [INFO ] Flatten gal took : 28 ms
[2024-06-02 20:25:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2024-06-02 20:25:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality8080504572410212861.gal : 2 ms
[2024-06-02 20:25:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5317847196515222590.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/CTLCardinality8080504572410212861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5317847196515222590.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.58065e+07,0.117062,7320,520,171,6069,833,400,13698,106,3752,0


Converting to forward existential form...Done !
original formula: !(A(!(AX(!(((i2.u11.p53==0)||(i2.u12.p59==1))))) U !((!(EX(((i2.u9.p45==0)||(i5.u19.p98==1)))) + AF((EG((i4.u22.p103==1)) * EF((i1.u7.p32...166
=> equivalent forward existential formula: (([((FwdU(Init,!(!((!(EX(((i2.u9.p45==0)||(i5.u19.p98==1)))) + !(EG(!((EG((i4.u22.p103==1)) * E(TRUE U (i1.u7.p3...674
Reverse transition relation is NOT exact ! Due to transitions t17, t49, t87, t173, t174, t175, t176, i0.u3.t79, i1.t73, i1.t69, i1.t68, i1.u5.t47, i1.u5.t7...729
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 5
Fast SCC detection found an SCC at level 6
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,13.1899,347016,1,0,483489,10925,2476,2.01821e+06,562,88893,438593
FORMULA MedleyA-PT-10-CTLCardinality-2024-09 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 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 223
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 103 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 98 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 98 transition count 213
Applied a total of 77 rules in 3 ms. Remains 98 /136 variables (removed 38) and now considering 213/263 (removed 50) transitions.
// Phase 1: matrix 213 rows 98 cols
[2024-06-02 20:25:30] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:25:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:25:30] [INFO ] Invariant cache hit.
[2024-06-02 20:25:30] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-06-02 20:25:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 20:25:32] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:25:32] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2024-06-02 20:25:32] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:25:32] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/311 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 20:25:35] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 113 constraints, problems are : Problem set: 0 solved, 212 unsolved in 11513 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/311 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 212/325 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 20:25:47] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 326 constraints, problems are : Problem set: 0 solved, 212 unsolved in 18541 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 6/6 constraints]
After SMT, in 30279ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 30282ms
Starting structural reductions in LTL mode, iteration 1 : 98/136 places, 213/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30547 ms. Remains : 98/136 places, 213/263 transitions.
[2024-06-02 20:26:00] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:26:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:26:00] [INFO ] Input system was already deterministic with 213 transitions.
[2024-06-02 20:26:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:26:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:26:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality6413624087399456233.gal : 4 ms
[2024-06-02 20:26:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality6252450086647818750.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/CTLCardinality6413624087399456233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6252450086647818750.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,2.14248e+07,2.78568,54928,2,6705,5,152813,6,0,605,215427,0


Converting to forward existential form...Done !
original formula: A(((p105==1) * EG((p54!=0))) U !(EX((AG((((p56==1)||(p118==0))||(p119==1))) + (p93==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX((!(E(TRUE U !((((p56==1)||(p118==0))||(p119==1))))) + (p93==1)))))))) * !(E(!(!(EX((!(E(TR...337
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t25, t26, t27, t29, t30, t32, t33, ...549
Detected timeout of ITS tools.
[2024-06-02 20:26:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:26:30] [INFO ] Applying decomposition
[2024-06-02 20:26:30] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14526180770879865852.txt' '-o' '/tmp/graph14526180770879865852.bin' '-w' '/tmp/graph14526180770879865852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14526180770879865852.bin' '-l' '-1' '-v' '-w' '/tmp/graph14526180770879865852.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:26:30] [INFO ] Decomposing Gal with order
[2024-06-02 20:26:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:26:30] [INFO ] Removed a total of 403 redundant transitions.
[2024-06-02 20:26:30] [INFO ] Flatten gal took : 30 ms
[2024-06-02 20:26:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 14 ms.
[2024-06-02 20:26:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16978553299078727668.gal : 3 ms
[2024-06-02 20:26:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality3086014709449909277.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/CTLCardinality16978553299078727668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3086014709449909277.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.14248e+07,0.33555,10164,500,423,10024,2279,348,23620,157,18213,0


Converting to forward existential form...Done !
original formula: A(((i3.u18.p105==1) * EG((i0.u9.p54!=0))) U !(EX((AG((((i0.u9.p56==1)||(i3.u18.p118==0))||(i3.u18.p119==1))) + (i5.u15.p93==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX((!(E(TRUE U !((((i0.u9.p56==1)||(i3.u18.p118==0))||(i3.u18.p119==1))))) + (i5.u15.p93==1))...431
Reverse transition relation is NOT exact ! Due to transitions t17, t55, t91, t97, t185, t186, t187, t188, t203, t204, t205, t206, i0.u9.t54, i0.u9.t56, i0....866
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 5
Fast SCC detection found an SCC at level 6
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,12.4916,296264,1,0,370669,50322,2172,1.47268e+06,895,588314,410914
FORMULA MedleyA-PT-10-CTLCardinality-2024-10 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 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 101 transition count 223
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 101 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 101 transition count 219
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 80 place count 94 transition count 201
Iterating global reduction 2 with 7 rules applied. Total rules applied 87 place count 94 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 91 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 91 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 89 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 89 transition count 188
Applied a total of 97 rules in 5 ms. Remains 89 /136 variables (removed 47) and now considering 188/263 (removed 75) transitions.
// Phase 1: matrix 188 rows 89 cols
[2024-06-02 20:26:43] [INFO ] Computed 10 invariants in 10 ms
[2024-06-02 20:26:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:26:43] [INFO ] Invariant cache hit.
[2024-06-02 20:26:43] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-06-02 20:26:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-02 20:26:45] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:26:45] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/277 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-02 20:26:47] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 102 constraints, problems are : Problem set: 0 solved, 187 unsolved in 7203 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/277 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 187/289 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 289 constraints, problems are : Problem set: 0 solved, 187 unsolved in 9785 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 3/3 constraints]
After SMT, in 17294ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 17297ms
Starting structural reductions in LTL mode, iteration 1 : 89/136 places, 188/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17597 ms. Remains : 89/136 places, 188/263 transitions.
[2024-06-02 20:27:01] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:27:01] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:27:01] [INFO ] Input system was already deterministic with 188 transitions.
[2024-06-02 20:27:01] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:27:01] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:27:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality13570412463319394797.gal : 2 ms
[2024-06-02 20:27:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality701544872517741759.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/CTLCardinality13570412463319394797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality701544872517741759.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.22067e+07,1.67039,40264,2,5509,5,113763,6,0,544,147693,0


Converting to forward existential form...Done !
original formula: AG(EF(EX(AG((p103==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(!(E(TRUE U !((p103==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t25, t26, t27, t28, t30, t31, t34, t35, t37, ...430
(forward)formula 0,0,10.2325,202984,1,0,404,1.03521e+06,398,151,5382,761173,473
FORMULA MedleyA-PT-10-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 132 transition count 239
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 111 transition count 235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 47 place count 111 transition count 233
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 109 transition count 233
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 75 place count 85 transition count 200
Iterating global reduction 2 with 24 rules applied. Total rules applied 99 place count 85 transition count 200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 99 place count 85 transition count 198
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 83 transition count 198
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 111 place count 75 transition count 177
Iterating global reduction 2 with 8 rules applied. Total rules applied 119 place count 75 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 73 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 73 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 72 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 72 transition count 170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 151 place count 58 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 58 transition count 157
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 156 place count 54 transition count 149
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 54 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 54 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 164 place count 54 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 168 place count 52 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 172 place count 50 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 48 transition count 139
Applied a total of 174 rules in 43 ms. Remains 48 /136 variables (removed 88) and now considering 139/263 (removed 124) transitions.
// Phase 1: matrix 139 rows 48 cols
[2024-06-02 20:27:11] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:27:11] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 20:27:11] [INFO ] Invariant cache hit.
[2024-06-02 20:27:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 20:27:11] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-02 20:27:11] [INFO ] Redundant transitions in 6 ms returned []
Running 131 sub problems to find dead transitions.
[2024-06-02 20:27:11] [INFO ] Invariant cache hit.
[2024-06-02 20:27:11] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 138/185 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 2/187 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 72 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5222 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 138/185 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 130/201 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 2/187 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/187 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 203 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7778 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 13193ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 13196ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/136 places, 139/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13489 ms. Remains : 48/136 places, 139/263 transitions.
[2024-06-02 20:27:24] [INFO ] Flatten gal took : 4 ms
[2024-06-02 20:27:24] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:27:24] [INFO ] Input system was already deterministic with 139 transitions.
[2024-06-02 20:27:24] [INFO ] Flatten gal took : 4 ms
[2024-06-02 20:27:24] [INFO ] Flatten gal took : 4 ms
[2024-06-02 20:27:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1338190665646517973.gal : 1 ms
[2024-06-02 20:27:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality18146984431244108010.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/CTLCardinality1338190665646517973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18146984431244108010.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,327060,0.237937,7788,2,381,5,17971,6,0,326,18067,0


Converting to forward existential form...Done !
original formula: EF(EG((p30==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p30==0))] != FALSE
Hit Full ! (commute/partial/dont) 137/0/2
(forward)formula 0,1,0.344482,8316,1,0,8,21561,19,3,2261,18067,8
FORMULA MedleyA-PT-10-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 105 transition count 225
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 105 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 65 place count 105 transition count 221
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 102 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 102 transition count 215
Applied a total of 71 rules in 8 ms. Remains 102 /136 variables (removed 34) and now considering 215/263 (removed 48) transitions.
// Phase 1: matrix 215 rows 102 cols
[2024-06-02 20:27:25] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:27:25] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 20:27:25] [INFO ] Invariant cache hit.
[2024-06-02 20:27:25] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 20:27:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:27:28] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:27:28] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-02 20:27:28] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 3 ms to minimize.
[2024-06-02 20:27:28] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/317 variables, 102/116 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:27:32] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:27:36] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/317 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:27:38] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/317 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 13 (OVERLAPS) 0/317 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 121 constraints, problems are : Problem set: 0 solved, 214 unsolved in 21155 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/317 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 214/335 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:27:51] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 336 constraints, problems are : Problem set: 0 solved, 214 unsolved in 17143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 10/10 constraints]
After SMT, in 38652ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 38658ms
Starting structural reductions in LTL mode, iteration 1 : 102/136 places, 215/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39075 ms. Remains : 102/136 places, 215/263 transitions.
[2024-06-02 20:28:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:28:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:28:04] [INFO ] Input system was already deterministic with 215 transitions.
[2024-06-02 20:28:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:28:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:28:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality4429637668787332772.gal : 2 ms
[2024-06-02 20:28:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality8705264424560465869.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/CTLCardinality4429637668787332772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8705264424560465869.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,2.74312e+07,5.29842,110944,2,16652,5,330780,6,0,622,446536,0


Converting to forward existential form...Done !
original formula: (A(AX(((p1==0)||(p83==1))) U ((AF(((EG((p55==1)) + (p47==0)) + ((p66==1)||(p9==1)))) * (((E((p37==0) U ((p116==0)||(p72==1))) * AX((p95==...260
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((!(EG(!(((EG((p55==1)) + (p47==0)) + ((p66==1)||(p9==1)))))) * (((E((p37==0) U ((p116==0...1328
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t11, t16, t17, t19, t20, t21, t23, t24, t25, t26, t27, t28, t30, t31, t32, t33, ...589
Detected timeout of ITS tools.
[2024-06-02 20:28:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:28:34] [INFO ] Applying decomposition
[2024-06-02 20:28:34] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11202546955638633677.txt' '-o' '/tmp/graph11202546955638633677.bin' '-w' '/tmp/graph11202546955638633677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11202546955638633677.bin' '-l' '-1' '-v' '-w' '/tmp/graph11202546955638633677.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:28:34] [INFO ] Decomposing Gal with order
[2024-06-02 20:28:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:28:34] [INFO ] Removed a total of 462 redundant transitions.
[2024-06-02 20:28:34] [INFO ] Flatten gal took : 29 ms
[2024-06-02 20:28:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 6 ms.
[2024-06-02 20:28:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9155087199007622350.gal : 7 ms
[2024-06-02 20:28:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality7906224525089024510.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/CTLCardinality9155087199007622350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7906224525089024510.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,2.74312e+07,0.381829,14244,689,249,18959,1180,419,41960,106,4266,0


Converting to forward existential form...Done !
original formula: (A(AX(((i0.u1.p1==0)||(i0.u19.p83==1))) U ((AF(((EG((i3.u10.p55==1)) + (i3.u15.p47==0)) + ((i6.u16.p66==1)||(i3.u14.p9==1)))) * (((E((i2....383
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((!(EG(!(((EG((i3.u10.p55==1)) + (i3.u15.p47==0)) + ((i6.u16.p66==1)||(i3.u14.p9==1))))))...1866
Reverse transition relation is NOT exact ! Due to transitions t57, t90, t91, t97, t98, t195, t196, t197, t198, t209, t210, t211, t212, i1.u5.t85, i2.t78, i...824
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,6.61758,157068,1,0,272074,4966,2227,651779,523,23653,438635
FORMULA MedleyA-PT-10-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 222
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 103 transition count 219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 97 transition count 205
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 97 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 95 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 95 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 94 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 94 transition count 198
Applied a total of 86 rules in 8 ms. Remains 94 /136 variables (removed 42) and now considering 198/263 (removed 65) transitions.
// Phase 1: matrix 198 rows 94 cols
[2024-06-02 20:28:41] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:28:41] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 20:28:41] [INFO ] Invariant cache hit.
[2024-06-02 20:28:41] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-06-02 20:28:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 20:28:44] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:28:44] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:28:44] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:28:44] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:28:44] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:28:44] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 198/292 variables, 94/112 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-06-02 20:28:51] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/292 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (OVERLAPS) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 113 constraints, problems are : Problem set: 0 solved, 197 unsolved in 15902 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/292 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 197/310 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 0/292 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 310 constraints, problems are : Problem set: 0 solved, 197 unsolved in 10340 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 9/9 constraints]
After SMT, in 26537ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 26541ms
Starting structural reductions in LTL mode, iteration 1 : 94/136 places, 198/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26859 ms. Remains : 94/136 places, 198/263 transitions.
[2024-06-02 20:29:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:29:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:29:08] [INFO ] Input system was already deterministic with 198 transitions.
[2024-06-02 20:29:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6322525686978325816.gal : 2 ms
[2024-06-02 20:29:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality14270672822131996903.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/CTLCardinality6322525686978325816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14270672822131996903.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.49412e+07,2.58737,53204,2,6245,5,144361,6,0,574,220978,0


Converting to forward existential form...Done !
original formula: E((p50==0) U AG(((p114==0) + (EF((p97==1)) * (EX((p0==1)) + ((!((p42==0)||(p32==1)))&&((p84==0)||(p24==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,(p50==0)) * !(E(TRUE U !(((p114==0) + (E(TRUE U (p97==1)) * (EX((p0==1)) + ((!((p42==0)||(p32==1)))&...194
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t27, t28, t29, t30, t31, t32, t33, ...495
Hit Full ! (commute/partial/dont) 187/0/11
(forward)formula 0,1,28.0082,594932,1,0,490,3.185e+06,427,188,5955,2.45844e+06,569
FORMULA MedleyA-PT-10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 20:29:36] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:29:36] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:29:36] [INFO ] Applying decomposition
[2024-06-02 20:29:36] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3172541972862865133.txt' '-o' '/tmp/graph3172541972862865133.bin' '-w' '/tmp/graph3172541972862865133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3172541972862865133.bin' '-l' '-1' '-v' '-w' '/tmp/graph3172541972862865133.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:29:36] [INFO ] Decomposing Gal with order
[2024-06-02 20:29:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:29:36] [INFO ] Removed a total of 497 redundant transitions.
[2024-06-02 20:29:36] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:29:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 3 ms.
[2024-06-02 20:29:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13039879795099556374.gal : 2 ms
[2024-06-02 20:29:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality12655704323965542532.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/CTLCardinality13039879795099556374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12655704323965542532.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,7.98853e+07,0.947297,26480,1253,514,35729,3450,529,116064,152,19127,0


Converting to forward existential form...Done !
original formula: E(!(((!(((i3.u13.p73==0)||(i1.u2.p17==1))) + AF(((i7.i0.u28.p126==1)&&(i2.u9.p42==1)))) * ((i6.u26.p124==0)||(i4.u17.p98==1)))) U ((E(((i...478
=> equivalent forward existential formula: (([(((FwdU(Init,!(((!(((i3.u13.p73==0)||(i1.u2.p17==1))) + !(EG(!(((i7.i0.u28.p126==1)&&(i2.u9.p42==1)))))) * ((...1188
Reverse transition relation is NOT exact ! Due to transitions t127, t129, t136, t138, t227, t229, t231, t233, i0.u1.t121, i0.u1.t122, i0.u1.t123, i0.u1.t12...1076
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,33.8949,674268,1,0,997217,16774,3097,3.61131e+06,813,135363,937120
FORMULA MedleyA-PT-10-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 772049 ms.

BK_STOP 1717360210737

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

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