Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531800186.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 StigmergyCommit-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 17M May 18 16:43 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 StigmergyCommit-PT-08a-CTLFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-08a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716991650257

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 14:07:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:07:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:07:32] [INFO ] Load time of PNML (sax parser for PT used): 873 ms
[2024-05-29 14:07:32] [INFO ] Transformed 328 places.
[2024-05-29 14:07:32] [INFO ] Transformed 18744 transitions.
[2024-05-29 14:07:32] [INFO ] Found NUPN structural information;
[2024-05-29 14:07:32] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Support contains 16 out of 328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 259 transition count 1372
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 259 transition count 1372
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 146 place count 259 transition count 1364
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 182 place count 223 transition count 1320
Iterating global reduction 1 with 36 rules applied. Total rules applied 218 place count 223 transition count 1320
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 227 place count 223 transition count 1311
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 236 place count 214 transition count 1302
Iterating global reduction 2 with 9 rules applied. Total rules applied 245 place count 214 transition count 1302
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 254 place count 205 transition count 1293
Iterating global reduction 2 with 9 rules applied. Total rules applied 263 place count 205 transition count 1293
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 272 place count 196 transition count 1284
Iterating global reduction 2 with 9 rules applied. Total rules applied 281 place count 196 transition count 1284
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 290 place count 187 transition count 1275
Iterating global reduction 2 with 9 rules applied. Total rules applied 299 place count 187 transition count 1275
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 308 place count 187 transition count 1266
Applied a total of 308 rules in 110 ms. Remains 187 /328 variables (removed 141) and now considering 1266/1449 (removed 183) transitions.
[2024-05-29 14:07:32] [INFO ] Flow matrix only has 1254 transitions (discarded 12 similar events)
// Phase 1: matrix 1254 rows 187 cols
[2024-05-29 14:07:32] [INFO ] Computed 3 invariants in 19 ms
[2024-05-29 14:07:33] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-29 14:07:33] [INFO ] Flow matrix only has 1254 transitions (discarded 12 similar events)
[2024-05-29 14:07:33] [INFO ] Invariant cache hit.
[2024-05-29 14:07:33] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:07:34] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
Running 1265 sub problems to find dead transitions.
[2024-05-29 14:07:34] [INFO ] Flow matrix only has 1254 transitions (discarded 12 similar events)
[2024-05-29 14:07:34] [INFO ] Invariant cache hit.
[2024-05-29 14:07:34] [INFO ] State equation strengthened by 1102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
[2024-05-29 14:07:58] [INFO ] Deduced a trap composed of 14 places in 364 ms of which 23 ms to minimize.
[2024-05-29 14:07:59] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 2 ms to minimize.
[2024-05-29 14:07:59] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 1 ms to minimize.
[2024-05-29 14:08:00] [INFO ] Deduced a trap composed of 17 places in 513 ms of which 2 ms to minimize.
[2024-05-29 14:08:00] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 2 ms to minimize.
[2024-05-29 14:08:00] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 2 ms to minimize.
[2024-05-29 14:08:00] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 2 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 14 places in 278 ms of which 4 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 2 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 5 ms to minimize.
[2024-05-29 14:08:01] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 1 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 1 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 1 ms to minimize.
[2024-05-29 14:08:02] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 1 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
[2024-05-29 14:08:03] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 1 ms to minimize.
[2024-05-29 14:08:04] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 1 ms to minimize.
[2024-05-29 14:08:05] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 1 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 1 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 6 ms to minimize.
[2024-05-29 14:08:06] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:08:07] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2024-05-29 14:08:07] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:08:07] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2024-05-29 14:08:07] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
[2024-05-29 14:08:12] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2024-05-29 14:08:12] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:08:12] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:08:12] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:08:13] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 13 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:08:14] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:08:15] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:08:16] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:08:17] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1265 unsolved
[2024-05-29 14:08:18] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:08:20] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
SMT process timed out in 45336ms, After SMT, problems are : Problem set: 0 solved, 1265 unsolved
Search for dead transitions found 0 dead transitions in 45379ms
Starting structural reductions in LTL mode, iteration 1 : 187/328 places, 1266/1449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47388 ms. Remains : 187/328 places, 1266/1449 transitions.
Support contains 16 out of 187 places after structural reductions.
[2024-05-29 14:08:20] [INFO ] Flatten gal took : 194 ms
[2024-05-29 14:08:20] [INFO ] Flatten gal took : 112 ms
[2024-05-29 14:08:20] [INFO ] Input system was already deterministic with 1266 transitions.
Reduction of identical properties reduced properties to check from 20 to 9
RANDOM walk for 40000 steps (10 resets) in 3797 ms. (10 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
[2024-05-29 14:08:22] [INFO ] Flow matrix only has 1254 transitions (discarded 12 similar events)
[2024-05-29 14:08:22] [INFO ] Invariant cache hit.
[2024-05-29 14:08:22] [INFO ] State equation strengthened by 1102 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 187/1441 variables, and 3 constraints, problems are : Problem set: 5 solved, 0 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/187 constraints, ReadFeed: 0/1102 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 486ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-29 14:08:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 14:08:22] [INFO ] Flatten gal took : 91 ms
FORMULA StigmergyCommit-PT-08a-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 14:08:23] [INFO ] Flatten gal took : 86 ms
[2024-05-29 14:08:23] [INFO ] Input system was already deterministic with 1266 transitions.
Support contains 11 out of 187 places (down from 13) after GAL structural reductions.
Computed a total of 56 stabilizing places and 55 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 1262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 183 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 183 transition count 1259
Applied a total of 9 rules in 21 ms. Remains 183 /187 variables (removed 4) and now considering 1259/1266 (removed 7) transitions.
[2024-05-29 14:08:23] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:08:23] [INFO ] Computed 2 invariants in 22 ms
[2024-05-29 14:08:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 14:08:23] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:08:23] [INFO ] Invariant cache hit.
[2024-05-29 14:08:23] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:08:26] [INFO ] Implicit Places using invariants and state equation in 3096 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/187 places, 1259/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 40 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:08:26] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:08:26] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 14:08:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 14:08:26] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:08:26] [INFO ] Invariant cache hit.
[2024-05-29 14:08:26] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:08:26] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/187 places, 1180/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3690 ms. Remains : 112/187 places, 1180/1266 transitions.
[2024-05-29 14:08:27] [INFO ] Flatten gal took : 61 ms
[2024-05-29 14:08:27] [INFO ] Flatten gal took : 71 ms
[2024-05-29 14:08:27] [INFO ] Input system was already deterministic with 1180 transitions.
[2024-05-29 14:08:27] [INFO ] Flatten gal took : 63 ms
[2024-05-29 14:08:27] [INFO ] Flatten gal took : 59 ms
[2024-05-29 14:08:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14417348851431516706.gal : 45 ms
[2024-05-29 14:08:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10158960505205459789.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/CTLFireability14417348851431516706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10158960505205459789.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,5.38364e+07,10.9405,249448,2,9438,5,182515,6,0,1618,112953,0


Converting to forward existential form...Done !
original formula: AF((EX((E((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)) U EF((((((p30==...626
=> equivalent forward existential formula: [FwdG(Init,!((EX((E((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282...683
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...508
Detected timeout of ITS tools.
[2024-05-29 14:08:57] [INFO ] Flatten gal took : 58 ms
[2024-05-29 14:08:57] [INFO ] Applying decomposition
[2024-05-29 14:08:57] [INFO ] Flatten gal took : 57 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/graph122565610192741735.txt' '-o' '/tmp/graph122565610192741735.bin' '-w' '/tmp/graph122565610192741735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph122565610192741735.bin' '-l' '-1' '-v' '-w' '/tmp/graph122565610192741735.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:08:57] [INFO ] Decomposing Gal with order
[2024-05-29 14:08:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:08:58] [INFO ] Removed a total of 9272 redundant transitions.
[2024-05-29 14:08:58] [INFO ] Flatten gal took : 346 ms
[2024-05-29 14:08:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 96 ms.
[2024-05-29 14:08:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5052393000316195531.gal : 16 ms
[2024-05-29 14:08:58] [INFO ] Time to serialize properties into /tmp/CTLFireability18350091989210992218.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/CTLFireability5052393000316195531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18350091989210992218.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.38364e+07,1.23723,55932,3145,31,67881,363,1136,185362,60,1197,0


Converting to forward existential form...Done !
original formula: AF((EX((E((((((i3.u39.p30==1)&&(i3.u8.p66==1))&&((i3.u28.p102==1)&&(i3.u18.p138==1)))&&(((i3.u19.p174==1)&&(i3.u32.p210==1))&&((i3.u4.p24...931
=> equivalent forward existential formula: [FwdG(Init,!((EX((E((((((i3.u39.p30==1)&&(i3.u8.p66==1))&&((i3.u28.p102==1)&&(i3.u18.p138==1)))&&(((i3.u19.p174=...988
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t14, t21, t29, t33, t38, t43, t1162, t1164, t1166, t1168, t1170, t1172, t1174, t1176,...727
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 1262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 183 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 183 transition count 1259
Applied a total of 9 rules in 17 ms. Remains 183 /187 variables (removed 4) and now considering 1259/1266 (removed 7) transitions.
[2024-05-29 14:09:28] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:09:28] [INFO ] Computed 2 invariants in 12 ms
[2024-05-29 14:09:28] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-29 14:09:28] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:09:28] [INFO ] Invariant cache hit.
[2024-05-29 14:09:29] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:09:31] [INFO ] Implicit Places using invariants and state equation in 2908 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3208 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/187 places, 1259/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 39 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:09:31] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:09:31] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 14:09:31] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 14:09:31] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:09:31] [INFO ] Invariant cache hit.
[2024-05-29 14:09:32] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:09:32] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/187 places, 1180/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3654 ms. Remains : 112/187 places, 1180/1266 transitions.
[2024-05-29 14:09:32] [INFO ] Flatten gal took : 57 ms
[2024-05-29 14:09:32] [INFO ] Flatten gal took : 74 ms
[2024-05-29 14:09:32] [INFO ] Input system was already deterministic with 1180 transitions.
[2024-05-29 14:09:32] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:09:32] [INFO ] Flatten gal took : 56 ms
[2024-05-29 14:09:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13030648258335648678.gal : 12 ms
[2024-05-29 14:09:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5321769812037553735.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/CTLFireability13030648258335648678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5321769812037553735.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(E(!((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1))) U ((((!(AX(((((((...732
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&...792
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...508
(forward)formula 0,0,26.3599,480248,1,0,1288,604833,2372,139,46184,390125,2362
FORMULA StigmergyCommit-PT-08a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 185 transition count 1175
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 116 rules applied. Total rules applied 207 place count 95 transition count 1149
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 225 place count 86 transition count 1140
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 225 place count 86 transition count 1130
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 245 place count 76 transition count 1130
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 264 place count 57 transition count 1110
Iterating global reduction 3 with 19 rules applied. Total rules applied 283 place count 57 transition count 1110
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 539 place count 57 transition count 854
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 539 place count 57 transition count 846
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 555 place count 49 transition count 846
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 556 place count 48 transition count 844
Iterating global reduction 4 with 1 rules applied. Total rules applied 557 place count 48 transition count 844
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 4 with 256 rules applied. Total rules applied 813 place count 48 transition count 588
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 815 place count 47 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 816 place count 47 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 825 place count 47 transition count 577
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 843 place count 38 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 844 place count 37 transition count 567
Applied a total of 844 rules in 408 ms. Remains 37 /187 variables (removed 150) and now considering 567/1266 (removed 699) transitions.
[2024-05-29 14:09:59] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 37 cols
[2024-05-29 14:09:59] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 14:09:59] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 14:09:59] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 14:09:59] [INFO ] Invariant cache hit.
[2024-05-29 14:09:59] [INFO ] State equation strengthened by 520 read => feed constraints.
[2024-05-29 14:09:59] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-29 14:09:59] [INFO ] Redundant transitions in 49 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-29 14:09:59] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 14:09:59] [INFO ] Invariant cache hit.
[2024-05-29 14:09:59] [INFO ] State equation strengthened by 520 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:10:09] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 14:10:10] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:10:11] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:10:12] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 14:10:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:10:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 14:10:15] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:10:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:10:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:10:16] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:10:18] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 14:10:18] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:10:18] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-29 14:10:18] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:10:18] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 9 (OVERLAPS) 556/593 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 519/642 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:10:32] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 14:10:32] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 14:10:32] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:10:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/594 variables, and 646 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:10:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:10:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:10:40] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (OVERLAPS) 556/593 variables, 37/130 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/593 variables, 519/649 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 558/1207 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 1207 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 92/92 constraints]
After SMT, in 67962ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 67969ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/187 places, 567/1266 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68639 ms. Remains : 37/187 places, 567/1266 transitions.
[2024-05-29 14:11:07] [INFO ] Flatten gal took : 27 ms
[2024-05-29 14:11:07] [INFO ] Flatten gal took : 30 ms
[2024-05-29 14:11:08] [INFO ] Input system was already deterministic with 567 transitions.
[2024-05-29 14:11:08] [INFO ] Flatten gal took : 29 ms
[2024-05-29 14:11:08] [INFO ] Flatten gal took : 29 ms
[2024-05-29 14:11:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16487816367254164979.gal : 6 ms
[2024-05-29 14:11:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11874503497235245970.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/CTLFireability16487816367254164979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11874503497235245970.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,1041,0.309116,18368,2,815,5,11024,6,0,706,5666,0


Converting to forward existential form...Done !
original formula: EF(((((A((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)) U (((((p30==1)&&...603
=> equivalent forward existential formula: [FwdG(((((FwdU(Init,TRUE) * (((p246==1)&&(p282==1))&&(p318==1))) * (((p102==1)&&(p138==1))&&((p174==1)&&(p210==1...904
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...332
(forward)formula 0,0,1.69168,40600,1,0,697,47899,1158,75,19697,31583,1202
FORMULA StigmergyCommit-PT-08a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 1262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 183 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 183 transition count 1259
Applied a total of 9 rules in 28 ms. Remains 183 /187 variables (removed 4) and now considering 1259/1266 (removed 7) transitions.
[2024-05-29 14:11:09] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:11:09] [INFO ] Computed 2 invariants in 11 ms
[2024-05-29 14:11:09] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 14:11:09] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:11:09] [INFO ] Invariant cache hit.
[2024-05-29 14:11:10] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:11:13] [INFO ] Implicit Places using invariants and state equation in 3134 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/187 places, 1259/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 58 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:11:13] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:11:13] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 14:11:13] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 14:11:13] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:11:13] [INFO ] Invariant cache hit.
[2024-05-29 14:11:13] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:11:13] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/187 places, 1180/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3740 ms. Remains : 112/187 places, 1180/1266 transitions.
[2024-05-29 14:11:13] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:11:13] [INFO ] Flatten gal took : 61 ms
[2024-05-29 14:11:13] [INFO ] Input system was already deterministic with 1180 transitions.
[2024-05-29 14:11:13] [INFO ] Flatten gal took : 59 ms
[2024-05-29 14:11:14] [INFO ] Flatten gal took : 61 ms
[2024-05-29 14:11:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7789163112237955340.gal : 11 ms
[2024-05-29 14:11:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17205015542250024059.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/CTLFireability7789163112237955340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17205015542250024059.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(A(!(EX((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)))) U AF(!((((((p...264
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EG(!(!((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)...590
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...508
Detected timeout of ITS tools.
[2024-05-29 14:11:44] [INFO ] Flatten gal took : 57 ms
[2024-05-29 14:11:44] [INFO ] Applying decomposition
[2024-05-29 14:11:44] [INFO ] Flatten gal took : 59 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/graph8760086979219206585.txt' '-o' '/tmp/graph8760086979219206585.bin' '-w' '/tmp/graph8760086979219206585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8760086979219206585.bin' '-l' '-1' '-v' '-w' '/tmp/graph8760086979219206585.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:11:44] [INFO ] Decomposing Gal with order
[2024-05-29 14:11:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:11:44] [INFO ] Removed a total of 9272 redundant transitions.
[2024-05-29 14:11:44] [INFO ] Flatten gal took : 183 ms
[2024-05-29 14:11:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 83 ms.
[2024-05-29 14:11:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2908773768820204469.gal : 11 ms
[2024-05-29 14:11:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6807910491081580720.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/CTLFireability2908773768820204469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6807910491081580720.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,5.38364e+07,4.3202,161688,3958,31,99374,334,1411,1.52538e+06,56,1232,0


Converting to forward existential form...Done !
original formula: EG(A(!(EX((((((i5.u4.p30==1)&&(i5.u8.p66==1))&&((i5.u36.p102==1)&&(i5.u16.p138==1)))&&(((i5.u1.p174==1)&&(i5.u25.p210==1))&&((i5.u30.p246...384
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EG(!(!((((((i5.u4.p30==1)&&(i5.u8.p66==1))&&((i5.u36.p102==1)&&(i5.u16.p138==1)))&&(((i5.u1....830
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t14, t16, t18, t23, t28, t33, t44, t1162, t1164, t1166, t1168, t1170, t1172, t1174, ...724
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 1262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 183 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 183 transition count 1259
Applied a total of 9 rules in 14 ms. Remains 183 /187 variables (removed 4) and now considering 1259/1266 (removed 7) transitions.
[2024-05-29 14:12:14] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:12:14] [INFO ] Computed 2 invariants in 13 ms
[2024-05-29 14:12:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 14:12:15] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:12:15] [INFO ] Invariant cache hit.
[2024-05-29 14:12:15] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:12:17] [INFO ] Implicit Places using invariants and state equation in 2850 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2941 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/187 places, 1259/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 25 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:12:17] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:12:17] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 14:12:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 14:12:17] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:12:17] [INFO ] Invariant cache hit.
[2024-05-29 14:12:18] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:12:18] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/187 places, 1180/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3332 ms. Remains : 112/187 places, 1180/1266 transitions.
[2024-05-29 14:12:18] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:12:18] [INFO ] Flatten gal took : 57 ms
[2024-05-29 14:12:18] [INFO ] Input system was already deterministic with 1180 transitions.
[2024-05-29 14:12:18] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:12:18] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:12:18] [INFO ] Time to serialize gal into /tmp/CTLFireability167401099366549697.gal : 12 ms
[2024-05-29 14:12:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8044510432344278552.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/CTLFireability167401099366549697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8044510432344278552.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,5.38364e+07,10.4385,249860,2,9438,5,182515,6,0,1618,112953,0


Converting to forward existential form...Done !
original formula: A((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)) U EF(((((EG(EX((((((p30...377
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((((EG(EX((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&(...956
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...508
Detected timeout of ITS tools.
[2024-05-29 14:12:48] [INFO ] Flatten gal took : 57 ms
[2024-05-29 14:12:48] [INFO ] Applying decomposition
[2024-05-29 14:12:48] [INFO ] Flatten gal took : 58 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/graph524783679409329805.txt' '-o' '/tmp/graph524783679409329805.bin' '-w' '/tmp/graph524783679409329805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph524783679409329805.bin' '-l' '-1' '-v' '-w' '/tmp/graph524783679409329805.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:12:48] [INFO ] Decomposing Gal with order
[2024-05-29 14:12:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:12:49] [INFO ] Removed a total of 9269 redundant transitions.
[2024-05-29 14:12:49] [INFO ] Flatten gal took : 131 ms
[2024-05-29 14:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 39 ms.
[2024-05-29 14:12:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3781365142024796715.gal : 11 ms
[2024-05-29 14:12:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12299979353346236900.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/CTLFireability3781365142024796715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12299979353346236900.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.38364e+07,6.19561,149712,3809,39,62090,442,1273,1.49856e+06,60,1655,0


Converting to forward existential form...Done !
original formula: A((((((i2.u8.p30==1)&&(i2.u19.p66==1))&&((i2.u22.p102==1)&&(i2.u25.p138==1)))&&(((i2.u27.p174==1)&&(i2.u1.p210==1))&&((i2.u31.p246==1)&&(...560
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((((EG(EX((((((i2.u8.p30==1)&&(i2.u19.p66==1))&&((i2.u22.p102==1)&&(i2.u25.p138==1)))&...1383
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t14, t16, t23, t29, t31, t33, t38, t1162, t1164, t1166, t1168, t1170, t1172, t1174, t...734
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 1262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 183 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 183 transition count 1259
Applied a total of 9 rules in 14 ms. Remains 183 /187 variables (removed 4) and now considering 1259/1266 (removed 7) transitions.
[2024-05-29 14:13:19] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:13:19] [INFO ] Computed 2 invariants in 15 ms
[2024-05-29 14:13:19] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 14:13:19] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:13:19] [INFO ] Invariant cache hit.
[2024-05-29 14:13:19] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:13:22] [INFO ] Implicit Places using invariants and state equation in 2899 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2983 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/187 places, 1259/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 31 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:13:22] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:13:22] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 14:13:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 14:13:22] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:13:22] [INFO ] Invariant cache hit.
[2024-05-29 14:13:22] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:13:22] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/187 places, 1180/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3379 ms. Remains : 112/187 places, 1180/1266 transitions.
[2024-05-29 14:13:22] [INFO ] Flatten gal took : 52 ms
[2024-05-29 14:13:22] [INFO ] Flatten gal took : 58 ms
[2024-05-29 14:13:22] [INFO ] Input system was already deterministic with 1180 transitions.
[2024-05-29 14:13:23] [INFO ] Flatten gal took : 57 ms
[2024-05-29 14:13:23] [INFO ] Flatten gal took : 82 ms
[2024-05-29 14:13:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14026823824007380619.gal : 12 ms
[2024-05-29 14:13:23] [INFO ] Time to serialize properties into /tmp/CTLFireability18359201647279404815.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/CTLFireability14026823824007380619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18359201647279404815.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,5.38364e+07,10.6364,250324,2,9438,5,182515,6,0,1618,112953,0


Converting to forward existential form...Done !
original formula: AF(AX(EG((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EG((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p...192
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...508
Detected timeout of ITS tools.
[2024-05-29 14:13:53] [INFO ] Flatten gal took : 56 ms
[2024-05-29 14:13:53] [INFO ] Applying decomposition
[2024-05-29 14:13:53] [INFO ] Flatten gal took : 54 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/graph8767044907308009591.txt' '-o' '/tmp/graph8767044907308009591.bin' '-w' '/tmp/graph8767044907308009591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8767044907308009591.bin' '-l' '-1' '-v' '-w' '/tmp/graph8767044907308009591.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:13:53] [INFO ] Decomposing Gal with order
[2024-05-29 14:13:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:13:53] [INFO ] Removed a total of 9272 redundant transitions.
[2024-05-29 14:13:53] [INFO ] Flatten gal took : 119 ms
[2024-05-29 14:13:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 38 ms.
[2024-05-29 14:13:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1917205313811647379.gal : 8 ms
[2024-05-29 14:13:53] [INFO ] Time to serialize properties into /tmp/CTLFireability14852509066572542740.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/CTLFireability1917205313811647379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14852509066572542740.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.38364e+07,2.35132,42840,2317,31,52998,498,1389,197779,58,1607,0


Converting to forward existential form...Done !
original formula: AF(AX(EG((((((i6.u4.p30==1)&&(i6.u19.p66==1))&&((i6.u12.p102==1)&&(i6.u17.p138==1)))&&(((i6.u1.p174==1)&&(i6.u32.p210==1))&&((i6.u27.p246...201
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EG((((((i6.u4.p30==1)&&(i6.u19.p66==1))&&((i6.u12.p102==1)&&(i6.u17.p138==1)))&&(((i6.u1.p17...252
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t23, t29, t33, t38, t41, t43, t1162, t1164, t1166, t1168, t1170, t1172, t1174, t1176...744
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 185 transition count 1175
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 116 rules applied. Total rules applied 207 place count 95 transition count 1149
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 225 place count 86 transition count 1140
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 225 place count 86 transition count 1130
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 245 place count 76 transition count 1130
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 264 place count 57 transition count 1110
Iterating global reduction 3 with 19 rules applied. Total rules applied 283 place count 57 transition count 1110
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 539 place count 57 transition count 854
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 539 place count 57 transition count 846
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 555 place count 49 transition count 846
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 556 place count 48 transition count 844
Iterating global reduction 4 with 1 rules applied. Total rules applied 557 place count 48 transition count 844
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 4 with 256 rules applied. Total rules applied 813 place count 48 transition count 588
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 815 place count 47 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 816 place count 47 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 825 place count 47 transition count 577
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 843 place count 38 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 844 place count 37 transition count 567
Applied a total of 844 rules in 223 ms. Remains 37 /187 variables (removed 150) and now considering 567/1266 (removed 699) transitions.
[2024-05-29 14:14:23] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 37 cols
[2024-05-29 14:14:23] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 14:14:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 14:14:23] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 14:14:23] [INFO ] Invariant cache hit.
[2024-05-29 14:14:24] [INFO ] State equation strengthened by 520 read => feed constraints.
[2024-05-29 14:14:24] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-29 14:14:24] [INFO ] Redundant transitions in 20 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-29 14:14:24] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 14:14:24] [INFO ] Invariant cache hit.
[2024-05-29 14:14:24] [INFO ] State equation strengthened by 520 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:14:31] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:14:31] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:14:31] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:14:31] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:14:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:14:32] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:14:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 14:14:34] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:14:34] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:14:34] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:14:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 14:14:34] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 14:14:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 14:14:34] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 14:14:34] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 14:14:34] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:14:35] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 14:14:36] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 14:14:37] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:14:38] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:14:38] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 14:14:38] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:14:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 14:14:39] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 14:14:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:14:41] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:14:41] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:14:41] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 14:14:41] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 14:14:41] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 9 (OVERLAPS) 556/593 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 519/642 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:14:55] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/594 variables, and 646 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 14:15:01] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:15:03] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (OVERLAPS) 556/593 variables, 37/130 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/593 variables, 519/649 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 558/1207 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 1207 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 92/92 constraints]
After SMT, in 66444ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 66450ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/187 places, 567/1266 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66905 ms. Remains : 37/187 places, 567/1266 transitions.
[2024-05-29 14:15:30] [INFO ] Flatten gal took : 33 ms
[2024-05-29 14:15:30] [INFO ] Flatten gal took : 29 ms
[2024-05-29 14:15:30] [INFO ] Input system was already deterministic with 567 transitions.
[2024-05-29 14:15:30] [INFO ] Flatten gal took : 26 ms
[2024-05-29 14:15:30] [INFO ] Flatten gal took : 27 ms
[2024-05-29 14:15:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17469189382659531599.gal : 6 ms
[2024-05-29 14:15:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13897634999778843033.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/CTLFireability17469189382659531599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13897634999778843033.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,1041,0.304383,18368,2,815,5,11024,6,0,706,5666,0


Converting to forward existential form...Done !
original formula: EG((((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0))))||(p318==0)))
=> equivalent forward existential formula: [FwdG(Init,(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0))))||...176
Hit Full ! (commute/partial/dont) 28/0/539
(forward)formula 0,0,1.20815,33736,1,0,16,28611,19,2,15199,15089,16
FORMULA StigmergyCommit-PT-08a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 1262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 183 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 183 transition count 1259
Applied a total of 9 rules in 15 ms. Remains 183 /187 variables (removed 4) and now considering 1259/1266 (removed 7) transitions.
[2024-05-29 14:15:32] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:15:32] [INFO ] Computed 2 invariants in 17 ms
[2024-05-29 14:15:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 14:15:32] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:15:32] [INFO ] Invariant cache hit.
[2024-05-29 14:15:32] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:15:34] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2938 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/187 places, 1259/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 32 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:15:35] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:15:35] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 14:15:35] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 14:15:35] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:15:35] [INFO ] Invariant cache hit.
[2024-05-29 14:15:35] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:15:35] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/187 places, 1180/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3366 ms. Remains : 112/187 places, 1180/1266 transitions.
[2024-05-29 14:15:35] [INFO ] Flatten gal took : 52 ms
[2024-05-29 14:15:35] [INFO ] Flatten gal took : 126 ms
[2024-05-29 14:15:35] [INFO ] Input system was already deterministic with 1180 transitions.
[2024-05-29 14:15:35] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:15:35] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:15:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13551649910229515023.gal : 10 ms
[2024-05-29 14:15:35] [INFO ] Time to serialize properties into /tmp/CTLFireability772728675148463569.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/CTLFireability13551649910229515023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability772728675148463569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(E((A(E((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)) U EF((((((p30==1...1095
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!((E(!(!(!(E(TRUE U !((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))...1460
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...508
Detected timeout of ITS tools.
[2024-05-29 14:16:05] [INFO ] Flatten gal took : 56 ms
[2024-05-29 14:16:05] [INFO ] Applying decomposition
[2024-05-29 14:16:05] [INFO ] Flatten gal took : 56 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/graph16461568174439319713.txt' '-o' '/tmp/graph16461568174439319713.bin' '-w' '/tmp/graph16461568174439319713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16461568174439319713.bin' '-l' '-1' '-v' '-w' '/tmp/graph16461568174439319713.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:16:06] [INFO ] Decomposing Gal with order
[2024-05-29 14:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:16:06] [INFO ] Removed a total of 9276 redundant transitions.
[2024-05-29 14:16:06] [INFO ] Flatten gal took : 134 ms
[2024-05-29 14:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 41 ms.
[2024-05-29 14:16:06] [INFO ] Time to serialize gal into /tmp/CTLFireability420052164389456668.gal : 10 ms
[2024-05-29 14:16:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15907715662426501153.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/CTLFireability420052164389456668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15907715662426501153.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,5.38364e+07,10.3046,204192,5826,20,130624,236,1402,1.52155e+06,42,841,0


Converting to forward existential form...Done !
original formula: !(E((A(E((((((i9.u5.p30==1)&&(i9.u1.p66==1))&&((i9.u38.p102==1)&&(i9.u29.p138==1)))&&(((i9.u11.p174==1)&&(i9.u27.p210==1))&&((i9.u32.p246...1644
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!((E(!(!(!(E(TRUE U !((((((i9.u5.p30==1)&&(i9.u1.p66==1))&&((i9.u38.p102==1)&&(i9.u29.p138==1))...2131
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t14, t18, t21, t23, t28, t34, t36, t38, t43, t1162, t1164, t1166, t1168, t1170, t1172...704
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 1262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 183 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 183 transition count 1259
Applied a total of 9 rules in 21 ms. Remains 183 /187 variables (removed 4) and now considering 1259/1266 (removed 7) transitions.
[2024-05-29 14:16:36] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:16:36] [INFO ] Computed 2 invariants in 14 ms
[2024-05-29 14:16:36] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 14:16:36] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:16:36] [INFO ] Invariant cache hit.
[2024-05-29 14:16:36] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:16:39] [INFO ] Implicit Places using invariants and state equation in 2850 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2939 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/187 places, 1259/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 30 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:16:39] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:16:39] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 14:16:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 14:16:39] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:16:39] [INFO ] Invariant cache hit.
[2024-05-29 14:16:39] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:16:39] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/187 places, 1180/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3342 ms. Remains : 112/187 places, 1180/1266 transitions.
[2024-05-29 14:16:39] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:16:39] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:16:40] [INFO ] Input system was already deterministic with 1180 transitions.
[2024-05-29 14:16:40] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:16:40] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:16:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15358137645264153577.gal : 10 ms
[2024-05-29 14:16:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6434324112747530250.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/CTLFireability15358137645264153577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6434324112747530250.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(((!((!(E((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)) U (((((p30==1)...1303
=> equivalent forward existential formula: [(FwdU(Init,((!((!(E((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p28...1355
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...508
Detected timeout of ITS tools.
[2024-05-29 14:17:10] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:17:10] [INFO ] Applying decomposition
[2024-05-29 14:17:10] [INFO ] Flatten gal took : 53 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/graph2814213318120967581.txt' '-o' '/tmp/graph2814213318120967581.bin' '-w' '/tmp/graph2814213318120967581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2814213318120967581.bin' '-l' '-1' '-v' '-w' '/tmp/graph2814213318120967581.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:17:10] [INFO ] Decomposing Gal with order
[2024-05-29 14:17:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:17:10] [INFO ] Removed a total of 9274 redundant transitions.
[2024-05-29 14:17:10] [INFO ] Flatten gal took : 116 ms
[2024-05-29 14:17:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 24 ms.
[2024-05-29 14:17:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4083318052404133286.gal : 8 ms
[2024-05-29 14:17:10] [INFO ] Time to serialize properties into /tmp/CTLFireability427099560308978743.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/CTLFireability4083318052404133286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability427099560308978743.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.38364e+07,9.23836,217656,6190,20,128759,266,1388,1.90466e+06,44,992,0


Converting to forward existential form...Done !
original formula: E(((!((!(E((((((i11.u33.p30==1)&&(i11.u23.p66==1))&&((i11.u27.p102==1)&&(i11.u39.p138==1)))&&(((i11.u1.p174==1)&&(i11.u19.p210==1))&&((i1...2084
=> equivalent forward existential formula: [(FwdU(Init,((!((!(E((((((i11.u33.p30==1)&&(i11.u23.p66==1))&&((i11.u27.p102==1)&&(i11.u39.p138==1)))&&(((i11.u1...2136
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t14, t18, t21, t23, t29, t33, t38, t43, t1162, t1164, t1166, t1168, t1170, t1172, t11...708
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 185 transition count 1175
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 116 rules applied. Total rules applied 207 place count 95 transition count 1149
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 225 place count 86 transition count 1140
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 225 place count 86 transition count 1130
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 245 place count 76 transition count 1130
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 264 place count 57 transition count 1110
Iterating global reduction 3 with 19 rules applied. Total rules applied 283 place count 57 transition count 1110
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 539 place count 57 transition count 854
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 539 place count 57 transition count 846
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 555 place count 49 transition count 846
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 556 place count 48 transition count 844
Iterating global reduction 4 with 1 rules applied. Total rules applied 557 place count 48 transition count 844
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 4 with 256 rules applied. Total rules applied 813 place count 48 transition count 588
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 815 place count 47 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 816 place count 47 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 825 place count 47 transition count 577
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 843 place count 38 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 844 place count 37 transition count 567
Applied a total of 844 rules in 216 ms. Remains 37 /187 variables (removed 150) and now considering 567/1266 (removed 699) transitions.
[2024-05-29 14:17:40] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 37 cols
[2024-05-29 14:17:40] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 14:17:40] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 14:17:40] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 14:17:40] [INFO ] Invariant cache hit.
[2024-05-29 14:17:41] [INFO ] State equation strengthened by 520 read => feed constraints.
[2024-05-29 14:17:41] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-29 14:17:41] [INFO ] Redundant transitions in 14 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-29 14:17:41] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 14:17:41] [INFO ] Invariant cache hit.
[2024-05-29 14:17:41] [INFO ] State equation strengthened by 520 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:17:49] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:17:50] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 14:17:51] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:17:52] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:17:53] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:17:54] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:17:55] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:17:55] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:17:55] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:17:56] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:17:56] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:17:56] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:17:57] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:17:58] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:17:58] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:17:58] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 14:17:58] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 9 (OVERLAPS) 556/593 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 519/642 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:18:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 14:18:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:18:12] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:18:12] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/594 variables, and 646 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:18:19] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:18:19] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:18:20] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (OVERLAPS) 556/593 variables, 37/130 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/593 variables, 519/649 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 558/1207 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 1207 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 92/92 constraints]
After SMT, in 66533ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 66538ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/187 places, 567/1266 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66991 ms. Remains : 37/187 places, 567/1266 transitions.
[2024-05-29 14:18:47] [INFO ] Flatten gal took : 24 ms
[2024-05-29 14:18:47] [INFO ] Flatten gal took : 26 ms
[2024-05-29 14:18:47] [INFO ] Input system was already deterministic with 567 transitions.
[2024-05-29 14:18:47] [INFO ] Flatten gal took : 25 ms
[2024-05-29 14:18:47] [INFO ] Flatten gal took : 26 ms
[2024-05-29 14:18:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10739945528756087537.gal : 5 ms
[2024-05-29 14:18:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6712181733716806738.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/CTLFireability10739945528756087537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6712181733716806738.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,1041,0.317507,18368,2,815,5,11024,6,0,706,5666,0


Converting to forward existential form...Done !
original formula: AF((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)))
=> equivalent forward existential formula: [FwdG(Init,!((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))...178
Hit Full ! (commute/partial/dont) 28/0/539
(forward)formula 0,1,1.29408,33472,1,0,16,28611,20,2,15377,15089,16
FORMULA StigmergyCommit-PT-08a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 1263
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 1263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 185 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 184 transition count 1260
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 184 transition count 1260
Applied a total of 7 rules in 14 ms. Remains 184 /187 variables (removed 3) and now considering 1260/1266 (removed 6) transitions.
[2024-05-29 14:18:49] [INFO ] Flow matrix only has 1249 transitions (discarded 11 similar events)
// Phase 1: matrix 1249 rows 184 cols
[2024-05-29 14:18:49] [INFO ] Computed 3 invariants in 10 ms
[2024-05-29 14:18:49] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 14:18:49] [INFO ] Flow matrix only has 1249 transitions (discarded 11 similar events)
[2024-05-29 14:18:49] [INFO ] Invariant cache hit.
[2024-05-29 14:18:49] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:18:52] [INFO ] Implicit Places using invariants and state equation in 2995 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3070 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/187 places, 1260/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 157 transition count 1234
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 157 transition count 1234
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 157 transition count 1225
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 148 transition count 1216
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 148 transition count 1216
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 139 transition count 1207
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 139 transition count 1207
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 130 transition count 1198
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 130 transition count 1198
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 121 transition count 1189
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 121 transition count 1189
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 113 transition count 1181
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 113 transition count 1181
Applied a total of 149 rules in 28 ms. Remains 113 /183 variables (removed 70) and now considering 1181/1260 (removed 79) transitions.
[2024-05-29 14:18:52] [INFO ] Flow matrix only has 1170 transitions (discarded 11 similar events)
// Phase 1: matrix 1170 rows 113 cols
[2024-05-29 14:18:52] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 14:18:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 14:18:52] [INFO ] Flow matrix only has 1170 transitions (discarded 11 similar events)
[2024-05-29 14:18:52] [INFO ] Invariant cache hit.
[2024-05-29 14:18:52] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:18:52] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/187 places, 1181/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3463 ms. Remains : 113/187 places, 1181/1266 transitions.
[2024-05-29 14:18:52] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:18:52] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:18:52] [INFO ] Input system was already deterministic with 1181 transitions.
[2024-05-29 14:18:52] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:18:53] [INFO ] Flatten gal took : 64 ms
[2024-05-29 14:18:53] [INFO ] Time to serialize gal into /tmp/CTLFireability14465946216773659477.gal : 11 ms
[2024-05-29 14:18:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4709241083167669819.ctl : 42 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/CTLFireability14465946216773659477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4709241083167669819.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AF(((((((((p44==1)&&(p30==1))&&((p66==1)&&(p102==1)))&&(((p138==1)&&(p174==1))&&((p210==1)&&(p246==1))))&&((((p282==1)&&(p318==1))&&((p3...1790
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((((!(EX(!((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&...1868
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...503
Detected timeout of ITS tools.
[2024-05-29 14:19:23] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:19:23] [INFO ] Applying decomposition
[2024-05-29 14:19:23] [INFO ] Flatten gal took : 55 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/graph1553453544055294445.txt' '-o' '/tmp/graph1553453544055294445.bin' '-w' '/tmp/graph1553453544055294445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1553453544055294445.bin' '-l' '-1' '-v' '-w' '/tmp/graph1553453544055294445.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:19:23] [INFO ] Decomposing Gal with order
[2024-05-29 14:19:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:19:23] [INFO ] Removed a total of 9270 redundant transitions.
[2024-05-29 14:19:23] [INFO ] Flatten gal took : 126 ms
[2024-05-29 14:19:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 24 ms.
[2024-05-29 14:19:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17258419471338416966.gal : 8 ms
[2024-05-29 14:19:23] [INFO ] Time to serialize properties into /tmp/CTLFireability542540684649648349.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/CTLFireability17258419471338416966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability542540684649648349.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,5.38364e+07,5.87205,136236,3046,35,61364,443,1260,1.41772e+06,61,1812,0


Converting to forward existential form...Done !
original formula: (AF(((((((((i2.u7.p44==1)&&(i10.u5.p30==1))&&((i10.u13.p66==1)&&(i10.u19.p102==1)))&&(((i10.u17.p138==1)&&(i10.u1.p174==1))&&((i10.u36.p2...2846
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((((!(EX(!((((((i10.u5.p30==1)&&(i10.u13.p66==1))&&((i10.u19.p102==1)&&(i10.u17.p138==...2924
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t11, t18, t23, t29, t38, t43, t1163, t1165, t1167, t1169, t1171, t1173, t1175, t1177,...738
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 185 transition count 1175
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 116 rules applied. Total rules applied 207 place count 95 transition count 1149
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 225 place count 86 transition count 1140
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 225 place count 86 transition count 1130
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 245 place count 76 transition count 1130
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 264 place count 57 transition count 1110
Iterating global reduction 3 with 19 rules applied. Total rules applied 283 place count 57 transition count 1110
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 539 place count 57 transition count 854
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 539 place count 57 transition count 846
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 555 place count 49 transition count 846
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 556 place count 48 transition count 844
Iterating global reduction 4 with 1 rules applied. Total rules applied 557 place count 48 transition count 844
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 4 with 256 rules applied. Total rules applied 813 place count 48 transition count 588
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 815 place count 47 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 816 place count 47 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 825 place count 47 transition count 577
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 843 place count 38 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 844 place count 37 transition count 567
Applied a total of 844 rules in 209 ms. Remains 37 /187 variables (removed 150) and now considering 567/1266 (removed 699) transitions.
[2024-05-29 14:19:53] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 37 cols
[2024-05-29 14:19:53] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 14:19:53] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 14:19:53] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 14:19:53] [INFO ] Invariant cache hit.
[2024-05-29 14:19:54] [INFO ] State equation strengthened by 520 read => feed constraints.
[2024-05-29 14:19:54] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-29 14:19:54] [INFO ] Redundant transitions in 15 ms returned []
Running 558 sub problems to find dead transitions.
[2024-05-29 14:19:54] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-05-29 14:19:54] [INFO ] Invariant cache hit.
[2024-05-29 14:19:54] [INFO ] State equation strengthened by 520 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:20:02] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 14:20:03] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:20:04] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:20:05] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:20:06] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 14:20:07] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 14:20:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:20:09] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 14:20:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 14:20:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 9 (OVERLAPS) 556/593 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 519/642 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 14:20:26] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/594 variables, and 646 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 9/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:20:32] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 14:20:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-05-29 14:20:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (OVERLAPS) 556/593 variables, 37/130 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/593 variables, 519/649 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 558/1207 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 1207 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 519/520 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 92/92 constraints]
After SMT, in 66981ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 66986ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/187 places, 567/1266 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67405 ms. Remains : 37/187 places, 567/1266 transitions.
[2024-05-29 14:21:01] [INFO ] Flatten gal took : 25 ms
[2024-05-29 14:21:01] [INFO ] Flatten gal took : 26 ms
[2024-05-29 14:21:01] [INFO ] Input system was already deterministic with 567 transitions.
[2024-05-29 14:21:01] [INFO ] Flatten gal took : 26 ms
[2024-05-29 14:21:01] [INFO ] Flatten gal took : 26 ms
[2024-05-29 14:21:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7271307589789076537.gal : 5 ms
[2024-05-29 14:21:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3289135856066559642.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/CTLFireability7271307589789076537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3289135856066559642.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,1041,0.320983,18368,2,815,5,11024,6,0,706,5666,0


Converting to forward existential form...Done !
original formula: AF((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)))
=> equivalent forward existential formula: [FwdG(Init,!((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))...178
Hit Full ! (commute/partial/dont) 28/0/539
(forward)formula 0,1,1.32721,33472,1,0,16,28611,20,2,15390,15089,16
FORMULA StigmergyCommit-PT-08a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 1262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 183 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 183 transition count 1259
Applied a total of 9 rules in 21 ms. Remains 183 /187 variables (removed 4) and now considering 1259/1266 (removed 7) transitions.
[2024-05-29 14:21:02] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:21:02] [INFO ] Computed 2 invariants in 15 ms
[2024-05-29 14:21:02] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-29 14:21:02] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:21:02] [INFO ] Invariant cache hit.
[2024-05-29 14:21:02] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:21:05] [INFO ] Implicit Places using invariants and state equation in 2917 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3009 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/187 places, 1259/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 32 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:21:05] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:21:05] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 14:21:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 14:21:05] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:21:05] [INFO ] Invariant cache hit.
[2024-05-29 14:21:05] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:21:06] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/187 places, 1180/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3456 ms. Remains : 112/187 places, 1180/1266 transitions.
[2024-05-29 14:21:06] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:21:06] [INFO ] Flatten gal took : 59 ms
[2024-05-29 14:21:06] [INFO ] Input system was already deterministic with 1180 transitions.
[2024-05-29 14:21:06] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:21:06] [INFO ] Flatten gal took : 54 ms
[2024-05-29 14:21:06] [INFO ] Time to serialize gal into /tmp/CTLFireability18052301052412448324.gal : 11 ms
[2024-05-29 14:21:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14009406321027690565.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/CTLFireability18052301052412448324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14009406321027690565.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,5.38364e+07,10.9575,249792,2,9438,5,182515,6,0,1618,112953,0


Converting to forward existential form...Done !
original formula: AX(EG((AG(((((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0))))||((((p318==0)||(p30==0))||...848
=> equivalent forward existential formula: [(EY(Init) * !(EG((!(E(TRUE U !(((((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p2...1158
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...508
Detected timeout of ITS tools.
[2024-05-29 14:21:36] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:21:36] [INFO ] Applying decomposition
[2024-05-29 14:21:36] [INFO ] Flatten gal took : 55 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/graph15834017323586398352.txt' '-o' '/tmp/graph15834017323586398352.bin' '-w' '/tmp/graph15834017323586398352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15834017323586398352.bin' '-l' '-1' '-v' '-w' '/tmp/graph15834017323586398352.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:21:36] [INFO ] Decomposing Gal with order
[2024-05-29 14:21:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:21:37] [INFO ] Removed a total of 9274 redundant transitions.
[2024-05-29 14:21:37] [INFO ] Flatten gal took : 137 ms
[2024-05-29 14:21:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 39 ms.
[2024-05-29 14:21:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8702913525936630465.gal : 8 ms
[2024-05-29 14:21:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9252130520434496876.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/CTLFireability8702913525936630465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9252130520434496876.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,5.38364e+07,5.19655,107736,3658,25,110333,304,1264,717569,47,1086,0


Converting to forward existential form...Done !
original formula: AX(EG((AG(((((((i6.u5.p30==0)||(i6.u11.p66==0))||((i6.u30.p102==0)||(i6.u7.p138==0)))||(((i6.u38.p174==0)||(i6.u25.p210==0))||((i6.u33.p2...1268
=> equivalent forward existential formula: [(EY(Init) * !(EG((!(E(TRUE U !(((((((i6.u5.p30==0)||(i6.u11.p66==0))||((i6.u30.p102==0)||(i6.u7.p138==0)))||(((...1698
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t11, t13, t18, t21, t28, t34, t38, t43, t1162, t1164, t1166, t1168, t1170, t1172, t11...709
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 1262
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 1262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 183 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 183 transition count 1259
Applied a total of 9 rules in 21 ms. Remains 183 /187 variables (removed 4) and now considering 1259/1266 (removed 7) transitions.
[2024-05-29 14:22:07] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
// Phase 1: matrix 1249 rows 183 cols
[2024-05-29 14:22:07] [INFO ] Computed 2 invariants in 13 ms
[2024-05-29 14:22:07] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-29 14:22:07] [INFO ] Flow matrix only has 1249 transitions (discarded 10 similar events)
[2024-05-29 14:22:07] [INFO ] Invariant cache hit.
[2024-05-29 14:22:07] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:22:10] [INFO ] Implicit Places using invariants and state equation in 2917 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3011 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/187 places, 1259/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 156 transition count 1233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 156 transition count 1233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 156 transition count 1224
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 147 transition count 1215
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 147 transition count 1215
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 138 transition count 1206
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 138 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 129 transition count 1197
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 129 transition count 1197
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 120 transition count 1188
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 120 transition count 1188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 112 transition count 1180
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 112 transition count 1180
Applied a total of 149 rules in 32 ms. Remains 112 /182 variables (removed 70) and now considering 1180/1259 (removed 79) transitions.
[2024-05-29 14:22:10] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
// Phase 1: matrix 1170 rows 112 cols
[2024-05-29 14:22:10] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 14:22:10] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 14:22:10] [INFO ] Flow matrix only has 1170 transitions (discarded 10 similar events)
[2024-05-29 14:22:10] [INFO ] Invariant cache hit.
[2024-05-29 14:22:10] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:22:10] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/187 places, 1180/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3436 ms. Remains : 112/187 places, 1180/1266 transitions.
[2024-05-29 14:22:10] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:22:10] [INFO ] Flatten gal took : 60 ms
[2024-05-29 14:22:10] [INFO ] Input system was already deterministic with 1180 transitions.
[2024-05-29 14:22:10] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:22:10] [INFO ] Flatten gal took : 56 ms
[2024-05-29 14:22:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17488554987930478749.gal : 11 ms
[2024-05-29 14:22:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11877956722401418431.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/CTLFireability17488554987930478749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11877956722401418431.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,5.38364e+07,10.7781,249532,2,9438,5,182515,6,0,1618,112953,0


Converting to forward existential form...Done !
original formula: A(!(E((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1)) U !(EF((((((p30==1)...505
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U (EX((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210=...1128
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...508
Detected timeout of ITS tools.
[2024-05-29 14:22:41] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:22:41] [INFO ] Applying decomposition
[2024-05-29 14:22:41] [INFO ] Flatten gal took : 53 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/graph17227925452232603054.txt' '-o' '/tmp/graph17227925452232603054.bin' '-w' '/tmp/graph17227925452232603054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17227925452232603054.bin' '-l' '-1' '-v' '-w' '/tmp/graph17227925452232603054.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:22:41] [INFO ] Decomposing Gal with order
[2024-05-29 14:22:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:22:41] [INFO ] Removed a total of 9266 redundant transitions.
[2024-05-29 14:22:41] [INFO ] Flatten gal took : 118 ms
[2024-05-29 14:22:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 21 ms.
[2024-05-29 14:22:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10448538887920336408.gal : 6 ms
[2024-05-29 14:22:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9731613961492065259.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/CTLFireability10448538887920336408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9731613961492065259.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.38364e+07,5.63027,213608,3999,41,156646,475,1268,1.49689e+06,62,1771,0


Converting to forward existential form...Done !
original formula: A(!(E((((((i6.u4.p30==1)&&(i6.u38.p66==1))&&((i6.u13.p102==1)&&(i6.u23.p138==1)))&&(((i6.u22.p174==1)&&(i6.u27.p210==1))&&((i6.u31.p246==...749
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U (EX((((((i6.u4.p30==1)&&(i6.u38.p66==1))&&((i6.u13.p102==1)&&(i6.u23.p138...1616
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t14, t16, t23, t29, t33, t38, t1162, t1164, t1166, t1168, t1170, t1172, t1174, t1...742
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 1266/1266 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 1263
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 1263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 184 transition count 1261
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 184 transition count 1261
Applied a total of 6 rules in 15 ms. Remains 184 /187 variables (removed 3) and now considering 1261/1266 (removed 5) transitions.
[2024-05-29 14:23:11] [INFO ] Flow matrix only has 1251 transitions (discarded 10 similar events)
// Phase 1: matrix 1251 rows 184 cols
[2024-05-29 14:23:11] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 14:23:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 14:23:11] [INFO ] Flow matrix only has 1251 transitions (discarded 10 similar events)
[2024-05-29 14:23:11] [INFO ] Invariant cache hit.
[2024-05-29 14:23:11] [INFO ] State equation strengthened by 1102 read => feed constraints.
[2024-05-29 14:23:14] [INFO ] Implicit Places using invariants and state equation in 3290 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/187 places, 1261/1266 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 157 transition count 1235
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 157 transition count 1235
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 157 transition count 1226
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 148 transition count 1217
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 148 transition count 1217
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 139 transition count 1208
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 139 transition count 1208
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 130 transition count 1199
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 130 transition count 1199
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 121 transition count 1190
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 121 transition count 1190
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 141 place count 113 transition count 1182
Iterating global reduction 1 with 8 rules applied. Total rules applied 149 place count 113 transition count 1182
Applied a total of 149 rules in 31 ms. Remains 113 /183 variables (removed 70) and now considering 1182/1261 (removed 79) transitions.
[2024-05-29 14:23:14] [INFO ] Flow matrix only has 1172 transitions (discarded 10 similar events)
// Phase 1: matrix 1172 rows 113 cols
[2024-05-29 14:23:14] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 14:23:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 14:23:15] [INFO ] Flow matrix only has 1172 transitions (discarded 10 similar events)
[2024-05-29 14:23:15] [INFO ] Invariant cache hit.
[2024-05-29 14:23:15] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 14:23:15] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/187 places, 1182/1266 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3769 ms. Remains : 113/187 places, 1182/1266 transitions.
[2024-05-29 14:23:15] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:23:15] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:23:15] [INFO ] Input system was already deterministic with 1182 transitions.
[2024-05-29 14:23:15] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:23:15] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:23:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6198989496042444155.gal : 10 ms
[2024-05-29 14:23:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9096124099139113552.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/CTLFireability6198989496042444155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9096124099139113552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((AF(EG(AG((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(p318==1))))) + A((!(((...868
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG(!(E(TRUE U !((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((...1706
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...515
Detected timeout of ITS tools.
[2024-05-29 14:23:45] [INFO ] Flatten gal took : 56 ms
[2024-05-29 14:23:45] [INFO ] Applying decomposition
[2024-05-29 14:23:45] [INFO ] Flatten gal took : 61 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/graph12718093812333526809.txt' '-o' '/tmp/graph12718093812333526809.bin' '-w' '/tmp/graph12718093812333526809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12718093812333526809.bin' '-l' '-1' '-v' '-w' '/tmp/graph12718093812333526809.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:23:46] [INFO ] Decomposing Gal with order
[2024-05-29 14:23:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:23:46] [INFO ] Removed a total of 9266 redundant transitions.
[2024-05-29 14:23:46] [INFO ] Flatten gal took : 132 ms
[2024-05-29 14:23:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 54 ms.
[2024-05-29 14:23:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4935193678293078403.gal : 8 ms
[2024-05-29 14:23:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4782323667653502113.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/CTLFireability4935193678293078403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4782323667653502113.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,5.38364e+07,7.41987,190512,4985,26,117239,260,1400,1.70801e+06,50,996,0


Converting to forward existential form...Done !
original formula: EG((AF(EG(AG((((((i3.u39.p30==1)&&(i3.u24.p66==1))&&((i3.u12.p102==1)&&(i3.u22.p138==1)))&&(((i3.u14.p174==1)&&(i3.u28.p210==1))&&((i3.u3...1311
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG(!(E(TRUE U !((((((i3.u39.p30==1)&&(i3.u24.p66==1))&&((i3.u12.p102==1)&&(i3.u22.p138==1)))&...2539
Reverse transition relation is NOT exact ! Due to transitions t11, t14, t23, t26, t28, t34, t38, t43, t1163, t1165, t1167, t1169, t1171, t1173, t1175, t117...711
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
[2024-05-29 14:24:16] [INFO ] Flatten gal took : 61 ms
[2024-05-29 14:24:16] [INFO ] Flatten gal took : 63 ms
[2024-05-29 14:24:16] [INFO ] Applying decomposition
[2024-05-29 14:24:16] [INFO ] Flatten gal took : 61 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/graph9987181739537250067.txt' '-o' '/tmp/graph9987181739537250067.bin' '-w' '/tmp/graph9987181739537250067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9987181739537250067.bin' '-l' '-1' '-v' '-w' '/tmp/graph9987181739537250067.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:24:16] [INFO ] Decomposing Gal with order
[2024-05-29 14:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:24:17] [INFO ] Removed a total of 9339 redundant transitions.
[2024-05-29 14:24:17] [INFO ] Flatten gal took : 135 ms
[2024-05-29 14:24:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 45 ms.
[2024-05-29 14:24:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15264268387604901049.gal : 7 ms
[2024-05-29 14:24:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10913223100038981848.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/CTLFireability15264268387604901049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10913223100038981848.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 10 CTL formulae.

BK_STOP 1716992690769

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-08a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531800186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08a.tgz
mv StigmergyCommit-PT-08a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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