Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920000082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 160K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717360689855

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 20:38:12] [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-06-02 20:38:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:38:13] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2024-06-02 20:38:13] [INFO ] Transformed 150 places.
[2024-06-02 20:38:13] [INFO ] Transformed 478 transitions.
[2024-06-02 20:38:13] [INFO ] Found NUPN structural information;
[2024-06-02 20:38:13] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Support contains 97 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 130 transition count 443
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 130 transition count 443
Applied a total of 40 rules in 65 ms. Remains 130 /150 variables (removed 20) and now considering 443/469 (removed 26) transitions.
[2024-06-02 20:38:13] [INFO ] Flow matrix only has 371 transitions (discarded 72 similar events)
// Phase 1: matrix 371 rows 130 cols
[2024-06-02 20:38:13] [INFO ] Computed 23 invariants in 34 ms
[2024-06-02 20:38:13] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-06-02 20:38:13] [INFO ] Flow matrix only has 371 transitions (discarded 72 similar events)
[2024-06-02 20:38:13] [INFO ] Invariant cache hit.
[2024-06-02 20:38:14] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 20:38:14] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2024-06-02 20:38:14] [INFO ] Flow matrix only has 371 transitions (discarded 72 similar events)
[2024-06-02 20:38:14] [INFO ] Invariant cache hit.
[2024-06-02 20:38:14] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/130 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 20:38:21] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 30 ms to minimize.
[2024-06-02 20:38:22] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:38:22] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:38:22] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:38:22] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:38:22] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:38:22] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:38:23] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-06-02 20:38:23] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2024-06-02 20:38:23] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-02 20:38:23] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:38:23] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 4 ms to minimize.
[2024-06-02 20:38:23] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:38:23] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 5 ms to minimize.
[2024-06-02 20:38:24] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 3 ms to minimize.
[2024-06-02 20:38:24] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:38:24] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-06-02 20:38:24] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 3 ms to minimize.
[2024-06-02 20:38:24] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:38:25] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 20:38:27] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:38:27] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:38:27] [INFO ] Deduced a trap composed of 58 places in 155 ms of which 2 ms to minimize.
[2024-06-02 20:38:27] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 3 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 3 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 2 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 3 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:38:28] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:38:29] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:38:29] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:38:29] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 2 ms to minimize.
[2024-06-02 20:38:29] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:38:29] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 10 ms to minimize.
[2024-06-02 20:38:30] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:38:30] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:38:31] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:38:31] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:38:31] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/63 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 20:38:32] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-06-02 20:38:32] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:38:32] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:38:34] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:38:34] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 3 ms to minimize.
[2024-06-02 20:38:34] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 4 ms to minimize.
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 12/75 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 3 ms to minimize.
[2024-06-02 20:38:36] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-06-02 20:38:37] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 2 ms to minimize.
[2024-06-02 20:38:39] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 4 ms to minimize.
[2024-06-02 20:38:39] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:38:39] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:38:39] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:38:39] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:38:39] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 10/85 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 20:38:42] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:38:42] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/87 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 20:38:44] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/501 variables, and 88 constraints, problems are : Problem set: 108 solved, 334 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/130 constraints, ReadFeed: 0/171 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 108 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 14/14 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 65/88 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 20:38:48] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 3 ms to minimize.
[2024-06-02 20:38:50] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/90 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 20:38:53] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:38:53] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/92 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 371/501 variables, 130/222 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 171/393 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 334/727 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 20:39:10] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:39:11] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2024-06-02 20:39:11] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:39:13] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-06-02 20:39:13] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:39:14] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:39:14] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 734 constraints, problems are : Problem set: 108 solved, 334 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 334/442 constraints, Known Traps: 76/76 constraints]
After SMT, in 61412ms problems are : Problem set: 108 solved, 334 unsolved
Search for dead transitions found 108 dead transitions in 61464ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 130/150 places, 335/469 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62624 ms. Remains : 130/150 places, 335/469 transitions.
Support contains 97 out of 130 places after structural reductions.
[2024-06-02 20:39:16] [INFO ] Flatten gal took : 117 ms
[2024-06-02 20:39:16] [INFO ] Flatten gal took : 48 ms
[2024-06-02 20:39:16] [INFO ] Input system was already deterministic with 335 transitions.
Reduction of identical properties reduced properties to check from 93 to 92
RANDOM walk for 40000 steps (3122 resets) in 4219 ms. (9 steps per ms) remains 57/92 properties
BEST_FIRST walk for 4004 steps (52 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (49 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (36 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (53 resets) in 36 ms. (108 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (60 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (54 resets) in 34 ms. (114 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (53 resets) in 42 ms. (93 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (51 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (26 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (54 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (47 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (49 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (54 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (53 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (51 resets) in 28 ms. (137 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (51 resets) in 81 ms. (48 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (44 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (43 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (55 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (52 resets) in 44 ms. (88 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (41 resets) in 43 ms. (90 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (54 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (46 resets) in 19 ms. (200 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (49 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (42 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (43 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (50 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (49 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (49 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (47 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (50 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (54 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (50 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (57 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (49 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (55 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (52 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (56 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (52 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (55 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (52 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (51 resets) in 25 ms. (154 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (53 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (51 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (53 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (51 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (51 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (49 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (60 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (63 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
// Phase 1: matrix 335 rows 130 cols
[2024-06-02 20:39:18] [INFO ] Computed 23 invariants in 6 ms
[2024-06-02 20:39:18] [INFO ] State equation strengthened by 135 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/99 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 44 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 3 (OVERLAPS) 29/128 variables, 14/23 constraints. Problems are: Problem set: 20 solved, 34 unsolved
[2024-06-02 20:39:19] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:39:19] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/25 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/25 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 333/461 variables, 128/153 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 135/288 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/288 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 4/465 variables, 2/290 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/290 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/465 variables, 0/290 constraints. Problems are: Problem set: 20 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 290 constraints, problems are : Problem set: 20 solved, 34 unsolved in 2778 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 20 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 28/87 variables, 7/7 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 4/91 variables, 2/9 constraints. Problems are: Problem set: 20 solved, 34 unsolved
[2024-06-02 20:39:22] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 34/125 variables, 13/23 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 2/25 constraints. Problems are: Problem set: 20 solved, 34 unsolved
[2024-06-02 20:39:22] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:39:22] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:39:22] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:39:22] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-02 20:39:22] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 2 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 13/38 constraints. Problems are: Problem set: 20 solved, 34 unsolved
[2024-06-02 20:39:24] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:39:24] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:39:24] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 3/41 constraints. Problems are: Problem set: 20 solved, 34 unsolved
[2024-06-02 20:39:24] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/42 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/42 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 3/128 variables, 1/43 constraints. Problems are: Problem set: 20 solved, 34 unsolved
[2024-06-02 20:39:25] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 1/44 constraints. Problems are: Problem set: 20 solved, 34 unsolved
[2024-06-02 20:39:25] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 1/45 constraints. Problems are: Problem set: 20 solved, 34 unsolved
[2024-06-02 20:39:26] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-06-02 20:39:26] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/128 variables, 2/47 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/128 variables, 0/47 constraints. Problems are: Problem set: 20 solved, 34 unsolved
At refinement iteration 17 (OVERLAPS) 333/461 variables, 128/175 constraints. Problems are: Problem set: 20 solved, 34 unsolved
SMT process timed out in 8052ms, After SMT, problems are : Problem set: 20 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 335/335 transitions.
Graph (complete) has 652 edges and 130 vertex of which 128 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 333
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 119 transition count 320
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 119 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 119 transition count 317
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 119 transition count 316
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 117 transition count 316
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 41 place count 117 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 113 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 113 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 113 transition count 306
Applied a total of 53 rules in 175 ms. Remains 113 /130 variables (removed 17) and now considering 306/335 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 113/130 places, 306/335 transitions.
RANDOM walk for 40000 steps (2966 resets) in 1301 ms. (30 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (47 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (55 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (61 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (50 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (18 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (49 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (53 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (54 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (50 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (53 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (48 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (51 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (41 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (50 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (49 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (50 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (45 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (45 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (57 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (54 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (50 resets) in 15 ms. (250 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (53 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (54 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (54 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (52 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (54 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (55 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (63 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 331244 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :6 out of 31
Probabilistic random walk after 331244 steps, saw 69691 distinct states, run finished after 3006 ms. (steps per millisecond=110 ) properties seen :6
// Phase 1: matrix 306 rows 113 cols
[2024-06-02 20:39:30] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 20:39:30] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 37/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 4/88 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 25/113 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:39:31] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 306/419 variables, 113/136 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 131/267 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/419 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 267 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1200 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 113/113 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 37/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 4/88 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 25/113 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:39:32] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:39:32] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:39:32] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:39:32] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-02 20:39:32] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-02 20:39:32] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:39:32] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-06-02 20:39:33] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:39:33] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:39:33] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:39:33] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:39:33] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-06-02 20:39:33] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 306/419 variables, 113/149 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 131/280 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 25/305 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:39:35] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 20:39:36] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 18 (OVERLAPS) 0/419 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 307 constraints, problems are : Problem set: 0 solved, 25 unsolved in 7337 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 113/113 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 16/16 constraints]
After SMT, in 8591ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 21 properties in 29577 ms.
Support contains 9 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 306/306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 306
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 101 transition count 270
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 101 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 98 transition count 255
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 98 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 97 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 97 transition count 251
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 93 transition count 247
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 91 transition count 256
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 91 transition count 253
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 88 transition count 253
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 88 transition count 412
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 64 place count 80 transition count 412
Applied a total of 64 rules in 64 ms. Remains 80 /113 variables (removed 33) and now considering 412/306 (removed -106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 80/113 places, 412/306 transitions.
RANDOM walk for 40000 steps (4543 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1075 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (908 resets) in 80 ms. (493 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (1101 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (776 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
// Phase 1: matrix 412 rows 80 cols
[2024-06-02 20:40:09] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:40:09] [INFO ] State equation strengthened by 182 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/37 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/69 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/79 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 412/491 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 182/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/492 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/492 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 80/80 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/37 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/69 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/79 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 412/491 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 182/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/492 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/492 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 80/80 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1510ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 47 ms.
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 412/412 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 77 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 77 transition count 408
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 77 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 76 transition count 427
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 74 transition count 411
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 74 transition count 411
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 72 transition count 374
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 72 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 71 transition count 365
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 71 transition count 365
Applied a total of 18 rules in 61 ms. Remains 71 /80 variables (removed 9) and now considering 365/412 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 71/80 places, 365/412 transitions.
RANDOM walk for 40000 steps (4587 resets) in 334 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (772 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1245763 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :0 out of 1
Probabilistic random walk after 1245763 steps, saw 228308 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
// Phase 1: matrix 365 rows 71 cols
[2024-06-02 20:40:13] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:40:13] [INFO ] State equation strengthened by 169 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/60 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/70 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 365/435 variables, 70/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 169/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/436 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/436 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 71/71 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/60 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:40:14] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/70 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 365/435 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 169/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/436 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/436 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 71/71 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 365/365 transitions.
Applied a total of 0 rules in 12 ms. Remains 71 /71 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 71/71 places, 365/365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 365/365 transitions.
Applied a total of 0 rules in 10 ms. Remains 71 /71 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2024-06-02 20:40:14] [INFO ] Invariant cache hit.
[2024-06-02 20:40:14] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 20:40:14] [INFO ] Invariant cache hit.
[2024-06-02 20:40:14] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-02 20:40:14] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-06-02 20:40:14] [INFO ] Redundant transitions in 26 ms returned []
Running 363 sub problems to find dead transitions.
[2024-06-02 20:40:14] [INFO ] Invariant cache hit.
[2024-06-02 20:40:14] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 20:40:18] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-06-02 20:40:18] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:40:19] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:40:19] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 365/436 variables, 71/95 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 169/264 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (OVERLAPS) 0/436 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 264 constraints, problems are : Problem set: 0 solved, 363 unsolved in 17834 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 71/71 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 365/436 variables, 71/95 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 169/264 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 363/627 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 20:40:43] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:40:43] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 3 ms to minimize.
[2024-06-02 20:40:50] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2024-06-02 20:40:50] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 20:40:55] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:41:00] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 2/633 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 633 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 71/71 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 10/10 constraints]
After SMT, in 48601ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 48607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49161 ms. Remains : 71/71 places, 365/365 transitions.
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-11-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:41:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 20:41:03] [INFO ] Flatten gal took : 44 ms
FORMULA MedleyA-PT-11-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:41:03] [INFO ] Flatten gal took : 32 ms
[2024-06-02 20:41:03] [INFO ] Input system was already deterministic with 335 transitions.
Support contains 77 out of 130 places (down from 79) after GAL structural reductions.
Computed a total of 22 stabilizing places and 130 stable transitions
Graph (complete) has 833 edges and 130 vertex of which 128 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 109 transition count 293
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 109 transition count 293
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 103 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 103 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 99 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 99 transition count 246
Applied a total of 59 rules in 14 ms. Remains 99 /130 variables (removed 31) and now considering 246/335 (removed 89) transitions.
// Phase 1: matrix 246 rows 99 cols
[2024-06-02 20:41:03] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:41:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 20:41:03] [INFO ] Invariant cache hit.
[2024-06-02 20:41:04] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-02 20:41:04] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2024-06-02 20:41:04] [INFO ] Invariant cache hit.
[2024-06-02 20:41:04] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-02 20:41:06] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:41:06] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:41:07] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:41:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:41:08] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:41:08] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-02 20:41:08] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:41:08] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-06-02 20:41:08] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:41:08] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-06-02 20:41:08] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-02 20:41:10] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 4 ms to minimize.
[2024-06-02 20:41:10] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:41:10] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-06-02 20:41:10] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:41:10] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 3 ms to minimize.
[2024-06-02 20:41:11] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 246/345 variables, 99/136 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 113/249 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 249 constraints, problems are : Problem set: 0 solved, 245 unsolved in 18209 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (OVERLAPS) 246/345 variables, 99/136 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 113/249 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 245/494 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-02 20:41:29] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-02 20:41:35] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 496 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 19/19 constraints]
After SMT, in 48453ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 48456ms
Starting structural reductions in LTL mode, iteration 1 : 99/130 places, 246/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48917 ms. Remains : 99/130 places, 246/335 transitions.
[2024-06-02 20:41:52] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:41:52] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:41:52] [INFO ] Input system was already deterministic with 246 transitions.
[2024-06-02 20:41:52] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:41:52] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:41:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9691107320914886723.gal : 10 ms
[2024-06-02 20:41:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13214433247718322944.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9691107320914886723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13214433247718322944.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:42:22] [INFO ] Flatten gal took : 60 ms
[2024-06-02 20:42:22] [INFO ] Applying decomposition
[2024-06-02 20:42:23] [INFO ] Flatten gal took : 37 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/graph14372474437317420892.txt' '-o' '/tmp/graph14372474437317420892.bin' '-w' '/tmp/graph14372474437317420892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14372474437317420892.bin' '-l' '-1' '-v' '-w' '/tmp/graph14372474437317420892.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:42:23] [INFO ] Decomposing Gal with order
[2024-06-02 20:42:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:42:23] [INFO ] Removed a total of 401 redundant transitions.
[2024-06-02 20:42:23] [INFO ] Flatten gal took : 116 ms
[2024-06-02 20:42:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 22 ms.
[2024-06-02 20:42:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4550050886530379965.gal : 8 ms
[2024-06-02 20:42:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4726309448464031722.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/CTLFireability4550050886530379965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4726309448464031722.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Graph (complete) has 833 edges and 130 vertex of which 128 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 3 places
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 107 transition count 294
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 107 transition count 294
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 44 place count 100 transition count 256
Iterating global reduction 0 with 7 rules applied. Total rules applied 51 place count 100 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 55 place count 96 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 59 place count 96 transition count 240
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 0 with 2 rules applied. Total rules applied 61 place count 95 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 63 place count 95 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 67 place count 93 transition count 235
Applied a total of 67 rules in 50 ms. Remains 93 /130 variables (removed 37) and now considering 235/335 (removed 100) transitions.
// Phase 1: matrix 235 rows 93 cols
[2024-06-02 20:42:53] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:42:53] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:42:53] [INFO ] Invariant cache hit.
[2024-06-02 20:42:53] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-02 20:42:53] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 20:42:53] [INFO ] Redundant transitions in 4 ms returned []
Running 234 sub problems to find dead transitions.
[2024-06-02 20:42:53] [INFO ] Invariant cache hit.
[2024-06-02 20:42:53] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-02 20:42:56] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 4 ms to minimize.
[2024-06-02 20:42:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:42:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:42:56] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:42:57] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:42:57] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:42:57] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 235/328 variables, 93/120 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 113/233 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 233 constraints, problems are : Problem set: 0 solved, 234 unsolved in 12125 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 235/328 variables, 93/120 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 113/233 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 234/467 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-02 20:43:16] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-02 20:43:18] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (OVERLAPS) 0/328 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 469 constraints, problems are : Problem set: 0 solved, 234 unsolved in 25837 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 9/9 constraints]
After SMT, in 38152ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 38156ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/130 places, 235/335 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38525 ms. Remains : 93/130 places, 235/335 transitions.
[2024-06-02 20:43:32] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:43:32] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:43:32] [INFO ] Input system was already deterministic with 235 transitions.
[2024-06-02 20:43:32] [INFO ] Flatten gal took : 28 ms
[2024-06-02 20:43:32] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:43:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10806729296660214877.gal : 7 ms
[2024-06-02 20:43:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10050145225624735334.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/CTLFireability10806729296660214877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10050145225624735334.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:44:02] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:44:02] [INFO ] Applying decomposition
[2024-06-02 20:44:02] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2140063150342392133.txt' '-o' '/tmp/graph2140063150342392133.bin' '-w' '/tmp/graph2140063150342392133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2140063150342392133.bin' '-l' '-1' '-v' '-w' '/tmp/graph2140063150342392133.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:44:02] [INFO ] Decomposing Gal with order
[2024-06-02 20:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:44:02] [INFO ] Removed a total of 394 redundant transitions.
[2024-06-02 20:44:02] [INFO ] Flatten gal took : 29 ms
[2024-06-02 20:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 8 ms.
[2024-06-02 20:44:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8247215768082964495.gal : 6 ms
[2024-06-02 20:44:02] [INFO ] Time to serialize properties into /tmp/CTLFireability4156478177413693819.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/CTLFireability8247215768082964495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4156478177413693819.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,8.15713e+08,13.3194,243704,4452,186,358211,1003,325,1.3562e+06,153,6697,0


Converting to forward existential form...Done !
original formula: (EF((((u19.p97==1)&&(i2.u14.p99==1))&&(u19.p129==1))) + AF(AG((EF(((u19.p118==1)||(((i1.i0.u6.p53==1)&&(i1.i0.u13.p87==1))&&((u19.p97==1)...198
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((u19.p97==1)&&(i2.u14.p99==1))&&(u19.p129==1))))),!(!(E(TRUE U !((E(TRUE U ((u19.p118...270
Reverse transition relation is NOT exact ! Due to transitions t122, t126, t145, t151, t175, t177, t185, t197, u19.t1, u19.t2, u19.t3, u19.t4, u19.t5, u19.t...1079
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 335
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 111 transition count 296
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 111 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 106 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 106 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 103 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 103 transition count 257
Applied a total of 53 rules in 15 ms. Remains 103 /130 variables (removed 27) and now considering 257/335 (removed 78) transitions.
// Phase 1: matrix 257 rows 103 cols
[2024-06-02 20:44:32] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 20:44:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 20:44:32] [INFO ] Invariant cache hit.
[2024-06-02 20:44:32] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-06-02 20:44:32] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-02 20:44:32] [INFO ] Invariant cache hit.
[2024-06-02 20:44:32] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-02 20:44:35] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:44:36] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:44:36] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:44:36] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:44:36] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:44:36] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:44:36] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:44:37] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:44:37] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:44:37] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:44:37] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-06-02 20:44:38] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:44:38] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:44:38] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:44:38] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:44:38] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:44:38] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2024-06-02 20:44:38] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-06-02 20:44:38] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:44:39] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-02 20:44:40] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-06-02 20:44:40] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:44:40] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-02 20:44:41] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-02 20:44:43] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-02 20:44:45] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 257/360 variables, 103/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 118/269 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 12 (OVERLAPS) 0/360 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 269 constraints, problems are : Problem set: 0 solved, 256 unsolved in 26512 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 103/103 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 26/48 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-02 20:45:01] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-02 20:45:03] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 257/360 variables, 103/153 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 118/271 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 256/527 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-02 20:45:12] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:45:13] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-06-02 20:45:23] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:45:23] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 531 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 103/103 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 32/32 constraints]
After SMT, in 56853ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 56863ms
Starting structural reductions in LTL mode, iteration 1 : 103/130 places, 257/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57255 ms. Remains : 103/130 places, 257/335 transitions.
[2024-06-02 20:45:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:45:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:45:29] [INFO ] Input system was already deterministic with 257 transitions.
[2024-06-02 20:45:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:45:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:45:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5584188107411062304.gal : 5 ms
[2024-06-02 20:45:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9159972960402717362.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/CTLFireability5584188107411062304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9159972960402717362.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:45:59] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:45:59] [INFO ] Applying decomposition
[2024-06-02 20:45:59] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7410898330640744582.txt' '-o' '/tmp/graph7410898330640744582.bin' '-w' '/tmp/graph7410898330640744582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7410898330640744582.bin' '-l' '-1' '-v' '-w' '/tmp/graph7410898330640744582.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:45:59] [INFO ] Decomposing Gal with order
[2024-06-02 20:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:46:00] [INFO ] Removed a total of 385 redundant transitions.
[2024-06-02 20:46:00] [INFO ] Flatten gal took : 30 ms
[2024-06-02 20:46:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 8 ms.
[2024-06-02 20:46:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10677397959254479939.gal : 4 ms
[2024-06-02 20:46:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10066865845487859393.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/CTLFireability10677397959254479939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10066865845487859393.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 108 transition count 293
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 108 transition count 293
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 99 transition count 245
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 99 transition count 245
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 94 transition count 225
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 94 transition count 225
Applied a total of 70 rules in 6 ms. Remains 94 /130 variables (removed 36) and now considering 225/335 (removed 110) transitions.
// Phase 1: matrix 225 rows 94 cols
[2024-06-02 20:46:30] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 20:46:30] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 20:46:30] [INFO ] Invariant cache hit.
[2024-06-02 20:46:30] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 20:46:30] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-06-02 20:46:30] [INFO ] Invariant cache hit.
[2024-06-02 20:46:30] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 20:46:32] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-02 20:46:33] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:46:33] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-06-02 20:46:33] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:46:33] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-06-02 20:46:33] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:46:33] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/319 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 108/230 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 230 constraints, problems are : Problem set: 0 solved, 224 unsolved in 10478 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/319 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 108/230 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 224/454 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 20:46:53] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:46:53] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/319 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 20:46:55] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 20:47:03] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-02 20:47:04] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 459 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 12/12 constraints]
After SMT, in 40659ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 40663ms
Starting structural reductions in LTL mode, iteration 1 : 94/130 places, 225/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41035 ms. Remains : 94/130 places, 225/335 transitions.
[2024-06-02 20:47:11] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:47:11] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:47:11] [INFO ] Input system was already deterministic with 225 transitions.
[2024-06-02 20:47:11] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:47:11] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:47:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11385714179140209209.gal : 4 ms
[2024-06-02 20:47:11] [INFO ] Time to serialize properties into /tmp/CTLFireability13054953610706790525.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/CTLFireability11385714179140209209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13054953610706790525.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:47:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:47:41] [INFO ] Applying decomposition
[2024-06-02 20:47:41] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7176381108375350901.txt' '-o' '/tmp/graph7176381108375350901.bin' '-w' '/tmp/graph7176381108375350901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7176381108375350901.bin' '-l' '-1' '-v' '-w' '/tmp/graph7176381108375350901.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:47:41] [INFO ] Decomposing Gal with order
[2024-06-02 20:47:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:47:41] [INFO ] Removed a total of 436 redundant transitions.
[2024-06-02 20:47:41] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:47:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 7 ms.
[2024-06-02 20:47:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12472257013817000357.gal : 3 ms
[2024-06-02 20:47:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8385542884943463959.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/CTLFireability12472257013817000357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8385542884943463959.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09442e+09,11.9023,236436,3899,91,344295,534,348,1.2931e+06,101,1916,0


Converting to forward existential form...Done !
original formula: EF(AG(E(AF((((u21.p97==1)&&(i2.u16.p101==1))&&(u21.p127==1))) U (A((((i0.u0.p9==1)&&(i0.u5.p24==1))&&((u21.p97==1)&&(u21.p131==1))) U (((...266
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(!(EG(!((((u21.p97==1)&&(i2.u16.p101==1))&&(u21.p127==1))))) U (!((E(!((((i3.u...505
Reverse transition relation is NOT exact ! Due to transitions t148, t154, t167, t169, t181, t196, u21.t3, u21.t4, u21.t5, u21.t6, u21.t7, u21.t8, u21.t9, u...1088
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 107 transition count 287
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 107 transition count 287
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 100 transition count 249
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 100 transition count 249
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 96 transition count 233
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 96 transition count 233
Applied a total of 66 rules in 5 ms. Remains 96 /130 variables (removed 34) and now considering 233/335 (removed 102) transitions.
// Phase 1: matrix 233 rows 96 cols
[2024-06-02 20:48:11] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 20:48:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 20:48:11] [INFO ] Invariant cache hit.
[2024-06-02 20:48:11] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-02 20:48:11] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-06-02 20:48:11] [INFO ] Invariant cache hit.
[2024-06-02 20:48:11] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-02 20:48:14] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-06-02 20:48:14] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:48:14] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:48:14] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:48:15] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-06-02 20:48:15] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-02 20:48:15] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:48:15] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 233/329 variables, 96/125 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 111/236 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 236 constraints, problems are : Problem set: 0 solved, 232 unsolved in 11503 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-02 20:48:24] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-06-02 20:48:24] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-02 20:48:26] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-02 20:48:27] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:48:27] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 233/329 variables, 96/130 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 111/241 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 232/473 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-02 20:48:42] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/329 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 474 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 14/14 constraints]
After SMT, in 41690ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 41693ms
Starting structural reductions in LTL mode, iteration 1 : 96/130 places, 233/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41966 ms. Remains : 96/130 places, 233/335 transitions.
[2024-06-02 20:48:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:48:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:48:53] [INFO ] Input system was already deterministic with 233 transitions.
[2024-06-02 20:48:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:48:53] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:48:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10475539765761664691.gal : 4 ms
[2024-06-02 20:48:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13445903200145642936.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/CTLFireability10475539765761664691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13445903200145642936.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:49:23] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:49:23] [INFO ] Applying decomposition
[2024-06-02 20:49:23] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15014825682946055610.txt' '-o' '/tmp/graph15014825682946055610.bin' '-w' '/tmp/graph15014825682946055610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15014825682946055610.bin' '-l' '-1' '-v' '-w' '/tmp/graph15014825682946055610.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:49:23] [INFO ] Decomposing Gal with order
[2024-06-02 20:49:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:49:23] [INFO ] Removed a total of 399 redundant transitions.
[2024-06-02 20:49:23] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:49:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 6 ms.
[2024-06-02 20:49:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3095190484528000947.gal : 3 ms
[2024-06-02 20:49:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6345149646782406524.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/CTLFireability3095190484528000947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6345149646782406524.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28385e+09,12.5916,214192,3129,140,292759,708,351,1.19418e+06,110,7914,0


Converting to forward existential form...Done !
original formula: (EX((EF((((i0.i0.u0.p9==1)&&(i0.i1.u4.p21==1))&&((i2.u13.p53==1)&&(i2.u13.p87==1)))) * EG((((i5.u23.p95!=1)||(i5.u26.p98!=1))||((i5.u20.p...304
=> equivalent forward existential formula: ([(Init * !(EX((E(TRUE U (((i0.i0.u0.p9==1)&&(i0.i1.u4.p21==1))&&((i2.u13.p53==1)&&(i2.u13.p87==1)))) * EG((((i5...377
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
Fast SCC detection found an SCC at level 5
Reverse transition relation is NOT exact ! Due to transitions t19, t43, t126, t130, t149, t183, t197, t221, u10.t45, u10.t46, u15.t20, u15.t23, i0.t230, i0...1049
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 109 transition count 290
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 109 transition count 290
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 101 transition count 247
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 101 transition count 247
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 97 transition count 231
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 97 transition count 231
Applied a total of 64 rules in 5 ms. Remains 97 /130 variables (removed 33) and now considering 231/335 (removed 104) transitions.
// Phase 1: matrix 231 rows 97 cols
[2024-06-02 20:49:53] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 20:49:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:49:53] [INFO ] Invariant cache hit.
[2024-06-02 20:49:53] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-02 20:49:53] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-06-02 20:49:54] [INFO ] Invariant cache hit.
[2024-06-02 20:49:54] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-02 20:49:56] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:49:57] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-06-02 20:49:57] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 231/328 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 109/230 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 230 constraints, problems are : Problem set: 0 solved, 230 unsolved in 12906 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 231/328 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 109/230 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 230/460 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 460 constraints, problems are : Problem set: 0 solved, 230 unsolved in 14933 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 3/3 constraints]
After SMT, in 28136ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 28141ms
Starting structural reductions in LTL mode, iteration 1 : 97/130 places, 231/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28453 ms. Remains : 97/130 places, 231/335 transitions.
[2024-06-02 20:50:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:22] [INFO ] Input system was already deterministic with 231 transitions.
[2024-06-02 20:50:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15306114370966118083.gal : 4 ms
[2024-06-02 20:50:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1667453893735337970.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/CTLFireability15306114370966118083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1667453893735337970.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:50:52] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:52] [INFO ] Applying decomposition
[2024-06-02 20:50:52] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15902090820479099928.txt' '-o' '/tmp/graph15902090820479099928.bin' '-w' '/tmp/graph15902090820479099928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15902090820479099928.bin' '-l' '-1' '-v' '-w' '/tmp/graph15902090820479099928.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:50:52] [INFO ] Decomposing Gal with order
[2024-06-02 20:50:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:50:52] [INFO ] Removed a total of 421 redundant transitions.
[2024-06-02 20:50:52] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:50:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 6 ms.
[2024-06-02 20:50:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16158616860043834704.gal : 2 ms
[2024-06-02 20:50:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5452361455277139101.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/CTLFireability16158616860043834704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5452361455277139101.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.50289e+09,27.5894,497748,5756,426,650930,2243,425,2.38033e+06,138,34396,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Graph (complete) has 833 edges and 130 vertex of which 128 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 108 transition count 294
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 108 transition count 294
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 45 place count 100 transition count 252
Iterating global reduction 0 with 8 rules applied. Total rules applied 53 place count 100 transition count 252
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 59 place count 94 transition count 228
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 94 transition count 228
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 0 with 2 rules applied. Total rules applied 67 place count 93 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 93 transition count 224
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 90 transition count 221
Applied a total of 76 rules in 26 ms. Remains 90 /130 variables (removed 40) and now considering 221/335 (removed 114) transitions.
// Phase 1: matrix 221 rows 90 cols
[2024-06-02 20:51:22] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 20:51:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:51:22] [INFO ] Invariant cache hit.
[2024-06-02 20:51:22] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-02 20:51:22] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-06-02 20:51:22] [INFO ] Redundant transitions in 8 ms returned []
Running 220 sub problems to find dead transitions.
[2024-06-02 20:51:22] [INFO ] Invariant cache hit.
[2024-06-02 20:51:22] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-02 20:51:25] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:51:25] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-06-02 20:51:25] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:51:26] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:51:26] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-02 20:51:26] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-02 20:51:26] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:51:26] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-02 20:51:26] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-06-02 20:51:26] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/311 variables, 90/121 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 109/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 230 constraints, problems are : Problem set: 0 solved, 220 unsolved in 11789 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 90/90 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/311 variables, 90/121 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 109/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 220/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 450 constraints, problems are : Problem set: 0 solved, 220 unsolved in 13330 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 90/90 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 10/10 constraints]
After SMT, in 25339ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 25341ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/130 places, 221/335 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25694 ms. Remains : 90/130 places, 221/335 transitions.
[2024-06-02 20:51:48] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:51:48] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:51:48] [INFO ] Input system was already deterministic with 221 transitions.
[2024-06-02 20:51:48] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:51:48] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:51:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11961146521675183234.gal : 2 ms
[2024-06-02 20:51:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6467394143703384292.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/CTLFireability11961146521675183234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6467394143703384292.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:52:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:52:18] [INFO ] Applying decomposition
[2024-06-02 20:52:18] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3686833888880580735.txt' '-o' '/tmp/graph3686833888880580735.bin' '-w' '/tmp/graph3686833888880580735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3686833888880580735.bin' '-l' '-1' '-v' '-w' '/tmp/graph3686833888880580735.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:52:18] [INFO ] Decomposing Gal with order
[2024-06-02 20:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:52:18] [INFO ] Removed a total of 509 redundant transitions.
[2024-06-02 20:52:18] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:52:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2024-06-02 20:52:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10601433893169788088.gal : 2 ms
[2024-06-02 20:52:18] [INFO ] Time to serialize properties into /tmp/CTLFireability5100134656364337534.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/CTLFireability10601433893169788088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5100134656364337534.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,6.39093e+08,21.2529,399036,3805,52,534887,303,407,2.6597e+06,52,1188,0


Converting to forward existential form...Done !
original formula: EF((EG(((i2.u22.p122==1) + !(A((((i4.u24.p7==1)&&(i4.u27.p10==1))&&((i1.i0.u8.p53==1)&&(i1.i0.u10.p59==1))) U (((i1.i0.u8.p53==1)&&(i1.i1...233
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((i2.u22.p122==1) + !(!((E(!((((i1.i0.u8.p53==1)&&(i1.i1.u14.p87==1))&&((i2.u16.p97==1)&&...499
Reverse transition relation is NOT exact ! Due to transitions t16, t81, t99, t111, t116, t135, t141, t163, t166, t177, i0.t208, i0.t206, i0.t200, i0.t198, ...1119
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 107 transition count 287
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 107 transition count 287
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 98 transition count 239
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 98 transition count 239
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 93 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 93 transition count 219
Applied a total of 72 rules in 8 ms. Remains 93 /130 variables (removed 37) and now considering 219/335 (removed 116) transitions.
// Phase 1: matrix 219 rows 93 cols
[2024-06-02 20:52:48] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 20:52:48] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 20:52:48] [INFO ] Invariant cache hit.
[2024-06-02 20:52:48] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-02 20:52:48] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-02 20:52:48] [INFO ] Invariant cache hit.
[2024-06-02 20:52:48] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-02 20:52:51] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-06-02 20:52:51] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/312 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 106/222 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 222 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9436 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/312 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 106/222 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 218/440 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 440 constraints, problems are : Problem set: 0 solved, 218 unsolved in 15523 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 25109ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 25112ms
Starting structural reductions in LTL mode, iteration 1 : 93/130 places, 219/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25386 ms. Remains : 93/130 places, 219/335 transitions.
[2024-06-02 20:53:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:53:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:53:13] [INFO ] Input system was already deterministic with 219 transitions.
[2024-06-02 20:53:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:53:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:53:13] [INFO ] Time to serialize gal into /tmp/CTLFireability884159012022315397.gal : 2 ms
[2024-06-02 20:53:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1088437618178186533.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/CTLFireability884159012022315397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1088437618178186533.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.
Detected timeout of ITS tools.
[2024-06-02 20:53:43] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:53:43] [INFO ] Applying decomposition
[2024-06-02 20:53:43] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5581808344183545862.txt' '-o' '/tmp/graph5581808344183545862.bin' '-w' '/tmp/graph5581808344183545862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5581808344183545862.bin' '-l' '-1' '-v' '-w' '/tmp/graph5581808344183545862.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:53:43] [INFO ] Decomposing Gal with order
[2024-06-02 20:53:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:53:43] [INFO ] Removed a total of 428 redundant transitions.
[2024-06-02 20:53:43] [INFO ] Flatten gal took : 27 ms
[2024-06-02 20:53:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 5 ms.
[2024-06-02 20:53:44] [INFO ] Time to serialize gal into /tmp/CTLFireability728559416298486950.gal : 3 ms
[2024-06-02 20:53:44] [INFO ] Time to serialize properties into /tmp/CTLFireability1705253111009072027.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/CTLFireability728559416298486950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1705253111009072027.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,1.00294e+09,6.96014,116864,3439,68,156597,379,299,420617,87,1271,0


Converting to forward existential form...Done !
original formula: AX(!(A(EF(AG((((i0.u0.p9==1)&&(i1.u2.p15==1))&&((i6.u24.p51==1)&&(i6.u27.p54==1))))) U EG(!(AG((u13.p86==1)))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(EG(!(!(E(TRUE U !((u13.p86==1)))))))))) * !(E(!(EG(!(!(E(TRUE U !((u13.p86==1))))))) U (!(E...304
Reverse transition relation is NOT exact ! Due to transitions t11, t55, t120, t124, t143, t166, t168, t170, t172, t187, t204, t206, t210, t212, t214, t216,...947
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 106 transition count 287
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 106 transition count 287
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 98 transition count 244
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 98 transition count 244
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 93 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 93 transition count 224
Applied a total of 71 rules in 4 ms. Remains 93 /130 variables (removed 37) and now considering 224/335 (removed 111) transitions.
// Phase 1: matrix 224 rows 93 cols
[2024-06-02 20:54:14] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:54:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 20:54:14] [INFO ] Invariant cache hit.
[2024-06-02 20:54:14] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 20:54:14] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-02 20:54:14] [INFO ] Invariant cache hit.
[2024-06-02 20:54:14] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 20:54:16] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/317 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 108/224 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 224 constraints, problems are : Problem set: 0 solved, 223 unsolved in 11469 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/317 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 108/224 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 223/447 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 447 constraints, problems are : Problem set: 0 solved, 223 unsolved in 14946 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 3/3 constraints]
After SMT, in 26658ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 26661ms
Starting structural reductions in LTL mode, iteration 1 : 93/130 places, 224/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26947 ms. Remains : 93/130 places, 224/335 transitions.
[2024-06-02 20:54:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:54:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:54:41] [INFO ] Input system was already deterministic with 224 transitions.
[2024-06-02 20:54:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:54:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:54:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9684648466480582025.gal : 2 ms
[2024-06-02 20:54:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14499972329209488865.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/CTLFireability9684648466480582025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14499972329209488865.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:55:11] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:55:11] [INFO ] Applying decomposition
[2024-06-02 20:55:11] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16166986056670470283.txt' '-o' '/tmp/graph16166986056670470283.bin' '-w' '/tmp/graph16166986056670470283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16166986056670470283.bin' '-l' '-1' '-v' '-w' '/tmp/graph16166986056670470283.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:55:11] [INFO ] Decomposing Gal with order
[2024-06-02 20:55:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:55:11] [INFO ] Removed a total of 490 redundant transitions.
[2024-06-02 20:55:11] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:55:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2024-06-02 20:55:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15156013028190943577.gal : 3 ms
[2024-06-02 20:55:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16665090349363284856.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/CTLFireability15156013028190943577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16665090349363284856.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 107 transition count 289
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 107 transition count 289
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 100 transition count 251
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 100 transition count 251
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 97 transition count 239
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 97 transition count 239
Applied a total of 63 rules in 4 ms. Remains 97 /130 variables (removed 33) and now considering 239/335 (removed 96) transitions.
// Phase 1: matrix 239 rows 97 cols
[2024-06-02 20:55:41] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:55:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:55:41] [INFO ] Invariant cache hit.
[2024-06-02 20:55:41] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-02 20:55:41] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-06-02 20:55:41] [INFO ] Invariant cache hit.
[2024-06-02 20:55:41] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-02 20:55:44] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:55:44] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:55:44] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-02 20:55:45] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:55:45] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-06-02 20:55:45] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:55:45] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:55:45] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 239/336 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 112/237 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 237 constraints, problems are : Problem set: 0 solved, 238 unsolved in 12436 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 239/336 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 112/237 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 238/475 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 475 constraints, problems are : Problem set: 0 solved, 238 unsolved in 19137 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 8/8 constraints]
After SMT, in 31777ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 31780ms
Starting structural reductions in LTL mode, iteration 1 : 97/130 places, 239/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32035 ms. Remains : 97/130 places, 239/335 transitions.
[2024-06-02 20:56:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:56:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:56:13] [INFO ] Input system was already deterministic with 239 transitions.
[2024-06-02 20:56:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:56:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:56:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16563977986904469625.gal : 3 ms
[2024-06-02 20:56:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11948045054841054995.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/CTLFireability16563977986904469625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11948045054841054995.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:56:43] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:56:43] [INFO ] Applying decomposition
[2024-06-02 20:56:43] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4809270135902838578.txt' '-o' '/tmp/graph4809270135902838578.bin' '-w' '/tmp/graph4809270135902838578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4809270135902838578.bin' '-l' '-1' '-v' '-w' '/tmp/graph4809270135902838578.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:56:43] [INFO ] Decomposing Gal with order
[2024-06-02 20:56:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:56:43] [INFO ] Removed a total of 449 redundant transitions.
[2024-06-02 20:56:43] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:56:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 3 ms.
[2024-06-02 20:56:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13158801286825661108.gal : 2 ms
[2024-06-02 20:56:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12357795832308970957.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/CTLFireability13158801286825661108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12357795832308970957.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62821e+09,16.4199,312744,4834,118,439215,826,370,1.68534e+06,119,3579,0


Converting to forward existential form...Done !
original formula: AG(((!(E((AX(((i0.i0.u4.p23==1)&&(i0.i1.u5.p26==1))) * (((u21.p128!=1)||(((i1.i1.u8.p53==1)&&(i1.i1.u13.p68==1))&&((u21.p97==1)&&(u21.p13...440
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((((i0.i0.u0.p9==1)&&(i4.u26.p10==1))&&((i4.u22.p133==1)&&(i4.u26.p144==1)))&&(((u2...519
Reverse transition relation is NOT exact ! Due to transitions t131, t135, t158, t164, t178, t180, t192, t206, u21.t3, u21.t4, u21.t5, u21.t6, u21.t7, u21.t...1208
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 108 transition count 289
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 108 transition count 289
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 101 transition count 252
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 101 transition count 252
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 96 transition count 232
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 96 transition count 232
Applied a total of 66 rules in 4 ms. Remains 96 /130 variables (removed 34) and now considering 232/335 (removed 103) transitions.
// Phase 1: matrix 232 rows 96 cols
[2024-06-02 20:57:13] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 20:57:13] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:57:13] [INFO ] Invariant cache hit.
[2024-06-02 20:57:13] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-02 20:57:13] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-02 20:57:13] [INFO ] Invariant cache hit.
[2024-06-02 20:57:13] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-02 20:57:16] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:57:16] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:57:16] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:57:17] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:57:17] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-02 20:57:19] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 232/328 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 110/233 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 233 constraints, problems are : Problem set: 0 solved, 231 unsolved in 16482 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 232/328 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 110/233 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 231/464 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-02 20:57:42] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:57:42] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/328 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/328 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 466 constraints, problems are : Problem set: 0 solved, 231 unsolved in 25819 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 8/8 constraints]
After SMT, in 42483ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 42485ms
Starting structural reductions in LTL mode, iteration 1 : 96/130 places, 232/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42765 ms. Remains : 96/130 places, 232/335 transitions.
[2024-06-02 20:57:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:57:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:57:56] [INFO ] Input system was already deterministic with 232 transitions.
[2024-06-02 20:57:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:57:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:57:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5676540589724371599.gal : 2 ms
[2024-06-02 20:57:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10594361994019033881.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/CTLFireability5676540589724371599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10594361994019033881.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 20:58:26] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:58:26] [INFO ] Applying decomposition
[2024-06-02 20:58:26] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1446152925821905486.txt' '-o' '/tmp/graph1446152925821905486.bin' '-w' '/tmp/graph1446152925821905486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1446152925821905486.bin' '-l' '-1' '-v' '-w' '/tmp/graph1446152925821905486.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:58:26] [INFO ] Decomposing Gal with order
[2024-06-02 20:58:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:58:26] [INFO ] Removed a total of 457 redundant transitions.
[2024-06-02 20:58:26] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:58:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 2 ms.
[2024-06-02 20:58:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16784289788642378232.gal : 2 ms
[2024-06-02 20:58:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3152716032802943798.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/CTLFireability16784289788642378232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3152716032802943798.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17493e+09,17.7688,348368,4567,193,493379,791,373,2.10197e+06,104,10204,0


Converting to forward existential form...Done !
original formula: AX(EF(((AG((((i0.u5.p9==0)||(i0.u0.p13==0))||(i0.u5.p31==0))) + (AG((i2.u13.p72==0)) * (((i2.u6.p53==0)||(i2.u7.p55==0))||(i2.u13.p73==0)...261
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((!(E(TRUE U !((((i0.u5.p9==0)||(i0.u0.p13==0))||(i0.u5.p31==0))))) + (!(E(TRUE U !((i2....338
Reverse transition relation is NOT exact ! Due to transitions t41, t65, t216, t230, u1.t66, u1.t69, u9.t43, u9.t44, i0.t221, i0.t219, i0.t60, i0.u0.t48, i0...997
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 112 transition count 298
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 112 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 107 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 107 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 103 transition count 256
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 103 transition count 256
Applied a total of 51 rules in 3 ms. Remains 103 /130 variables (removed 27) and now considering 256/335 (removed 79) transitions.
// Phase 1: matrix 256 rows 103 cols
[2024-06-02 20:58:56] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:58:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:58:56] [INFO ] Invariant cache hit.
[2024-06-02 20:58:56] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-02 20:58:56] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-06-02 20:58:56] [INFO ] Invariant cache hit.
[2024-06-02 20:58:56] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 3 ms to minimize.
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 20:59:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 20:59:04] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:59:04] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 20:59:07] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 20:59:08] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:59:08] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 256/359 variables, 103/138 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 115/253 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 12 (OVERLAPS) 0/359 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 253 constraints, problems are : Problem set: 0 solved, 255 unsolved in 26693 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 256/359 variables, 103/138 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 115/253 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 255/508 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 20:59:35] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:59:38] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 20:59:51] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/359 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 511 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 18/18 constraints]
After SMT, in 56931ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 56935ms
Starting structural reductions in LTL mode, iteration 1 : 103/130 places, 256/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57211 ms. Remains : 103/130 places, 256/335 transitions.
[2024-06-02 20:59:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:59:53] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:59:53] [INFO ] Input system was already deterministic with 256 transitions.
[2024-06-02 20:59:53] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:59:53] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:59:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13230534224242341503.gal : 1 ms
[2024-06-02 20:59:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1709465363026146568.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/CTLFireability13230534224242341503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1709465363026146568.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 21:00:23] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:00:23] [INFO ] Applying decomposition
[2024-06-02 21:00:23] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2309479125120244236.txt' '-o' '/tmp/graph2309479125120244236.bin' '-w' '/tmp/graph2309479125120244236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2309479125120244236.bin' '-l' '-1' '-v' '-w' '/tmp/graph2309479125120244236.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:00:23] [INFO ] Decomposing Gal with order
[2024-06-02 21:00:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:00:23] [INFO ] Removed a total of 462 redundant transitions.
[2024-06-02 21:00:23] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:00:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 3 ms.
[2024-06-02 21:00:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2897575225577410721.gal : 3 ms
[2024-06-02 21:00:23] [INFO ] Time to serialize properties into /tmp/CTLFireability9247725679900343970.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/CTLFireability2897575225577410721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9247725679900343970.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 107 transition count 289
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 107 transition count 289
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 99 transition count 246
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 99 transition count 246
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 94 transition count 226
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 94 transition count 226
Applied a total of 69 rules in 4 ms. Remains 94 /130 variables (removed 36) and now considering 226/335 (removed 109) transitions.
// Phase 1: matrix 226 rows 94 cols
[2024-06-02 21:00:53] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:00:53] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 21:00:53] [INFO ] Invariant cache hit.
[2024-06-02 21:00:54] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 21:00:54] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 21:00:54] [INFO ] Invariant cache hit.
[2024-06-02 21:00:54] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:00:56] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-02 21:00:56] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:00:57] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/320 variables, 94/117 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 108/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 225 constraints, problems are : Problem set: 0 solved, 225 unsolved in 10890 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/320 variables, 94/117 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 108/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 225/450 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:01:16] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/320 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 451 constraints, problems are : Problem set: 0 solved, 225 unsolved in 23037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 4/4 constraints]
After SMT, in 34104ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 34108ms
Starting structural reductions in LTL mode, iteration 1 : 94/130 places, 226/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34382 ms. Remains : 94/130 places, 226/335 transitions.
[2024-06-02 21:01:28] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:01:28] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:01:28] [INFO ] Input system was already deterministic with 226 transitions.
[2024-06-02 21:01:28] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:01:28] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:01:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3662514495003693023.gal : 1 ms
[2024-06-02 21:01:28] [INFO ] Time to serialize properties into /tmp/CTLFireability13478437993010571795.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/CTLFireability3662514495003693023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13478437993010571795.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 21:01:58] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:01:58] [INFO ] Applying decomposition
[2024-06-02 21:01:58] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph366416925499629015.txt' '-o' '/tmp/graph366416925499629015.bin' '-w' '/tmp/graph366416925499629015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph366416925499629015.bin' '-l' '-1' '-v' '-w' '/tmp/graph366416925499629015.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:01:58] [INFO ] Decomposing Gal with order
[2024-06-02 21:01:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:01:58] [INFO ] Removed a total of 430 redundant transitions.
[2024-06-02 21:01:58] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:01:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 2 ms.
[2024-06-02 21:01:58] [INFO ] Time to serialize gal into /tmp/CTLFireability359368755900847419.gal : 2 ms
[2024-06-02 21:01:58] [INFO ] Time to serialize properties into /tmp/CTLFireability763797137697103579.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/CTLFireability359368755900847419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability763797137697103579.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 107 transition count 287
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 107 transition count 287
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 98 transition count 239
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 98 transition count 239
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 92 transition count 215
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 92 transition count 215
Applied a total of 74 rules in 4 ms. Remains 92 /130 variables (removed 38) and now considering 215/335 (removed 120) transitions.
// Phase 1: matrix 215 rows 92 cols
[2024-06-02 21:02:28] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 21:02:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 21:02:28] [INFO ] Invariant cache hit.
[2024-06-02 21:02:28] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 21:02:28] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 21:02:28] [INFO ] Invariant cache hit.
[2024-06-02 21:02:28] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:02:31] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:02:32] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/307 variables, 92/115 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 105/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 220 constraints, problems are : Problem set: 0 solved, 214 unsolved in 10549 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/307 variables, 92/115 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 105/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 214/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 434 constraints, problems are : Problem set: 0 solved, 214 unsolved in 14617 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 25323ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 25325ms
Starting structural reductions in LTL mode, iteration 1 : 92/130 places, 215/335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25598 ms. Remains : 92/130 places, 215/335 transitions.
[2024-06-02 21:02:54] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:02:54] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:02:54] [INFO ] Input system was already deterministic with 215 transitions.
[2024-06-02 21:02:54] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:02:54] [INFO ] Flatten gal took : 5 ms
[2024-06-02 21:02:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1888018590090378305.gal : 2 ms
[2024-06-02 21:02:54] [INFO ] Time to serialize properties into /tmp/CTLFireability921049566476536927.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/CTLFireability1888018590090378305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability921049566476536927.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,8.86411e+08,27.273,552120,2,54559,5,1.81906e+06,6,0,576,3.03518e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 21:03:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:03:24] [INFO ] Applying decomposition
[2024-06-02 21:03:24] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18428317316328914996.txt' '-o' '/tmp/graph18428317316328914996.bin' '-w' '/tmp/graph18428317316328914996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18428317316328914996.bin' '-l' '-1' '-v' '-w' '/tmp/graph18428317316328914996.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:03:24] [INFO ] Decomposing Gal with order
[2024-06-02 21:03:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:03:24] [INFO ] Removed a total of 477 redundant transitions.
[2024-06-02 21:03:24] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:03:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2024-06-02 21:03:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6381482913967705775.gal : 2 ms
[2024-06-02 21:03:24] [INFO ] Time to serialize properties into /tmp/CTLFireability2745805145775687708.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/CTLFireability6381482913967705775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2745805145775687708.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,8.86411e+08,6.77935,133728,2656,39,195619,179,316,585905,41,609,0


Converting to forward existential form...Done !
original formula: A(!(E(AG((E(((i4.u18.p105==1)&&(i4.u19.p108==1)) U (((i0.i0.u0.p9==1)&&(i0.i0.u6.p43==1))&&((i5.u24.p133==1)&&(i5.u28.p144==1)))) + AX(((...346
=> equivalent forward existential formula: [((Init * !(EG(!((((i5.u25.p7==1)&&(i5.u28.p10==1))&&((i2.u8.p53==1)&&(i1.u10.p59==1))))))) * !(E(!((((i5.u25.p7...581
Reverse transition relation is NOT exact ! Due to transitions t11, t32, t161, t163, t165, t167, t196, t198, t200, t202, i0.t211, i0.t209, i0.t207, i0.t205,...936
Detected timeout of ITS tools.
[2024-06-02 21:03:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:03:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:03:54] [INFO ] Applying decomposition
[2024-06-02 21:03:54] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14900280617775328456.txt' '-o' '/tmp/graph14900280617775328456.bin' '-w' '/tmp/graph14900280617775328456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14900280617775328456.bin' '-l' '-1' '-v' '-w' '/tmp/graph14900280617775328456.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:03:54] [INFO ] Decomposing Gal with order
[2024-06-02 21:03:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:03:54] [INFO ] Removed a total of 547 redundant transitions.
[2024-06-02 21:03:54] [INFO ] Flatten gal took : 32 ms
[2024-06-02 21:03:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 6 ms.
[2024-06-02 21:03:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10202194423520053182.gal : 4 ms
[2024-06-02 21:03:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3804125926649619473.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/CTLFireability10202194423520053182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3804125926649619473.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 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25695e+10,1001.95,6423188,98024,8110,7.45577e+06,231750,537,3.06429e+07,265,4.61813e+06,0


Converting to forward existential form...Done !
original formula: AG((!(E(!(((AF((i2.u13.p71==1)) * (i2.u13.p53==1)) * ((i2.u8.p55==1)&&(i2.u13.p73==1)))) U AX(EG((i2.u13.p77==1))))) + AG((((i3.u19.p123=...200
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(E(!(((!(EG(!((i2.u13.p71==1)))) * (i2.u13.p53==1)) * ((i2.u8.p55==1)&&(i2.u13.p73=...276
Reverse transition relation is NOT exact ! Due to transitions t32, t75, t121, t135, t143, t144, t185, t186, t187, t188, t189, t191, t192, t214, t220, t226,...1856
Detected timeout of ITS tools.
[2024-06-02 21:32:28] [INFO ] Applying decomposition
[2024-06-02 21:32:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:32:28] [INFO ] Decomposing Gal with order
[2024-06-02 21:32:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:32:28] [INFO ] Removed a total of 683 redundant transitions.
[2024-06-02 21:32:28] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:32:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 3 ms.
[2024-06-02 21:32:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13027621751359379214.gal : 2 ms
[2024-06-02 21:32:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4699966170276822430.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/CTLFireability13027621751359379214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4699966170276822430.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 14 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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