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

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717360588851

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 20:36:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:36:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:36:31] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-06-02 20:36:31] [INFO ] Transformed 150 places.
[2024-06-02 20:36:31] [INFO ] Transformed 478 transitions.
[2024-06-02 20:36:31] [INFO ] Found NUPN structural information;
[2024-06-02 20:36:31] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Support contains 79 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 131 transition count 436
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 131 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 129 transition count 425
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 129 transition count 425
Applied a total of 42 rules in 49 ms. Remains 129 /150 variables (removed 21) and now considering 425/469 (removed 44) transitions.
[2024-06-02 20:36:31] [INFO ] Flow matrix only has 353 transitions (discarded 72 similar events)
// Phase 1: matrix 353 rows 129 cols
[2024-06-02 20:36:31] [INFO ] Computed 23 invariants in 39 ms
[2024-06-02 20:36:32] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-06-02 20:36:32] [INFO ] Flow matrix only has 353 transitions (discarded 72 similar events)
[2024-06-02 20:36:32] [INFO ] Invariant cache hit.
[2024-06-02 20:36:32] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-06-02 20:36:32] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2024-06-02 20:36:32] [INFO ] Flow matrix only has 353 transitions (discarded 72 similar events)
[2024-06-02 20:36:32] [INFO ] Invariant cache hit.
[2024-06-02 20:36:32] [INFO ] State equation strengthened by 167 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
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 TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 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 TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 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 TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 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
At refinement iteration 2 (OVERLAPS) 1/129 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 20:36:39] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 30 ms to minimize.
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 3 ms to minimize.
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 3 ms to minimize.
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 3 ms to minimize.
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 12 ms to minimize.
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:36:42] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 3 ms to minimize.
[2024-06-02 20:36:42] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:36:42] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:36:42] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 20:36:44] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:36:44] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-06-02 20:36:44] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:36:45] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:36:45] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 3 ms to minimize.
[2024-06-02 20:36:45] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-06-02 20:36:45] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:36:46] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-06-02 20:36:46] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
[2024-06-02 20:36:46] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:36:46] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:36:46] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:36:46] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:36:46] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:36:47] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:36:48] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:36:48] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 2 ms to minimize.
[2024-06-02 20:36:48] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:36:48] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-06-02 20:36:48] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/63 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 20:36:49] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:36:49] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:36:50] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:36:51] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:36:51] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 5/68 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 20:36:52] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:36:53] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-06-02 20:36:53] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:36:53] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:36:54] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2024-06-02 20:36:54] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 4 ms to minimize.
[2024-06-02 20:36:55] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 3 ms to minimize.
[2024-06-02 20:36:55] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 8/76 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 20:36:57] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-06-02 20:36:57] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 3 ms to minimize.
[2024-06-02 20:36:58] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:36:58] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:36:58] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:36:58] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:36:58] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 7/83 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 20:37:00] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 3 ms to minimize.
[2024-06-02 20:37:01] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 2/85 constraints. Problems are: Problem set: 108 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 129/482 variables, and 85 constraints, problems are : Problem set: 108 solved, 316 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/129 constraints, ReadFeed: 0/167 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 108 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 14/14 constraints. Problems are: Problem set: 108 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/14 constraints. Problems are: Problem set: 108 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 62/85 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 20:37:06] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 3 ms to minimize.
[2024-06-02 20:37:06] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 4 ms to minimize.
[2024-06-02 20:37:06] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:37:06] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:37:06] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:37:06] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:37:06] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:37:07] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-06-02 20:37:07] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:37:07] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:37:07] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:37:07] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:37:07] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:37:08] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 14/99 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 20:37:09] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:37:09] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 2/101 constraints. Problems are: Problem set: 108 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/101 constraints. Problems are: Problem set: 108 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 353/482 variables, 129/230 constraints. Problems are: Problem set: 108 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 167/397 constraints. Problems are: Problem set: 108 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 316/713 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 20:37:27] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 2 ms to minimize.
[2024-06-02 20:37:27] [INFO ] Deduced a trap composed of 37 places in 332 ms of which 2 ms to minimize.
[2024-06-02 20:37:30] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 716 constraints, problems are : Problem set: 108 solved, 316 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 129/129 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 316/424 constraints, Known Traps: 81/81 constraints]
After SMT, in 61116ms problems are : Problem set: 108 solved, 316 unsolved
Search for dead transitions found 108 dead transitions in 61156ms
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 : 129/150 places, 317/469 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 317
Applied a total of 1 rules in 10 ms. Remains 128 /129 variables (removed 1) and now considering 317/317 (removed 0) transitions.
// Phase 1: matrix 317 rows 128 cols
[2024-06-02 20:37:34] [INFO ] Computed 22 invariants in 7 ms
[2024-06-02 20:37:34] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 20:37:34] [INFO ] Invariant cache hit.
[2024-06-02 20:37:34] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-02 20:37:34] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 128/150 places, 317/469 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62685 ms. Remains : 128/150 places, 317/469 transitions.
Support contains 79 out of 128 places after structural reductions.
[2024-06-02 20:37:34] [INFO ] Flatten gal took : 83 ms
[2024-06-02 20:37:34] [INFO ] Flatten gal took : 39 ms
[2024-06-02 20:37:34] [INFO ] Input system was already deterministic with 317 transitions.
RANDOM walk for 40000 steps (3118 resets) in 2754 ms. (14 steps per ms) remains 28/71 properties
BEST_FIRST walk for 4003 steps (55 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (50 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (56 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (53 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (51 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (54 resets) in 66 ms. (59 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (52 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (50 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (55 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (54 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (55 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (54 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (53 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (54 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (55 resets) in 14 ms. (266 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (51 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (53 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (51 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (54 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (51 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
[2024-06-02 20:37:36] [INFO ] Invariant cache hit.
[2024-06-02 20:37:36] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 42/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 6/84 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 35/119 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 6/125 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 315/440 variables, 125/147 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 131/278 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 5/445 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 0/445 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 281 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 128/128 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/78 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-02 20:37:37] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:37:37] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 6/84 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Problem AtomicPropp41 is UNSAT
At refinement iteration 6 (OVERLAPS) 35/119 variables, 9/22 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-06-02 20:37:38] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:37:38] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-06-02 20:37:38] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-06-02 20:37:38] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:37:38] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:37:38] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-06-02 20:37:38] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:37:38] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:37:39] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-06-02 20:37:39] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:37:39] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:37:39] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:37:39] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-06-02 20:37:39] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:37:39] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 20/42 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:37:40] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:37:41] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:37:41] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 4/46 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-06-02 20:37:41] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:37:41] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:37:41] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 3/49 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 6/125 variables, 2/51 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 315/440 variables, 125/176 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 131/307 constraints. Problems are: Problem set: 2 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/445 variables, and 325 constraints, problems are : Problem set: 2 solved, 23 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 125/128 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 18/25 constraints, Known Traps: 29/29 constraints]
After SMT, in 6276ms problems are : Problem set: 2 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 614 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 315
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 110 transition count 286
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 110 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 109 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 109 transition count 281
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 1 with 2 rules applied. Total rules applied 35 place count 108 transition count 280
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 105 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 60 place count 105 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 104 transition count 294
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 104 transition count 291
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 78 place count 96 transition count 291
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 96 transition count 291
Applied a total of 79 rules in 186 ms. Remains 96 /128 variables (removed 32) and now considering 291/317 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 96/128 places, 291/317 transitions.
RANDOM walk for 40000 steps (5347 resets) in 1016 ms. (39 steps per ms) remains 12/23 properties
BEST_FIRST walk for 40002 steps (1093 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1089 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1111 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1107 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1084 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1122 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1078 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1080 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1118 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1097 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1117 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1120 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
// Phase 1: matrix 291 rows 96 cols
[2024-06-02 20:37:43] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:37:43] [INFO ] State equation strengthened by 133 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 44/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 25/84 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 10/94 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 290/384 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 133/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 3/387 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/387 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 249 constraints, problems are : Problem set: 0 solved, 12 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 44/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:37:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 25/84 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:37:44] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 10/94 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 290/384 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 133/249 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 11/260 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:37:45] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:37:45] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:37:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:37:45] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 3/387 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/387 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/387 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:37:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/387 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/387 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 0/387 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 268 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4874 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 7/7 constraints]
After SMT, in 5463ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 11 properties in 882 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 291/291 transitions.
Graph (complete) has 498 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 86 transition count 253
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 86 transition count 253
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 21 place count 84 transition count 245
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 84 transition count 245
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 25 place count 83 transition count 244
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
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 31 place count 80 transition count 258
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 33 place count 78 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 78 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 36 place count 77 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 77 transition count 235
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 77 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 76 transition count 234
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 76 transition count 420
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 75 place count 68 transition count 400
Applied a total of 75 rules in 64 ms. Remains 68 /96 variables (removed 28) and now considering 400/291 (removed -109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 68/96 places, 400/291 transitions.
RANDOM walk for 40000 steps (7710 resets) in 385 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1425 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 26109 steps, run visited all 1 properties in 131 ms. (steps per millisecond=199 )
Probabilistic random walk after 26109 steps, saw 7257 distinct states, run finished after 138 ms. (steps per millisecond=189 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 20:37:50] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:37:50] [INFO ] Flatten gal took : 32 ms
[2024-06-02 20:37:50] [INFO ] Input system was already deterministic with 317 transitions.
Computed a total of 29 stabilizing places and 133 stable transitions
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 104 transition count 266
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 104 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 43 place count 100 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 100 transition count 248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 49 place count 98 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 51 place count 98 transition count 240
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 54 place count 98 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 96 transition count 235
Applied a total of 58 rules in 35 ms. Remains 96 /128 variables (removed 32) and now considering 235/317 (removed 82) transitions.
// Phase 1: matrix 235 rows 96 cols
[2024-06-02 20:37:50] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:37:50] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 20:37:50] [INFO ] Invariant cache hit.
[2024-06-02 20:37:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-02 20:37:50] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-06-02 20:37:50] [INFO ] Redundant transitions in 18 ms returned []
Running 234 sub problems to find dead transitions.
[2024-06-02 20:37:50] [INFO ] Invariant cache hit.
[2024-06-02 20:37:50] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-02 20:37:53] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:37:53] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-06-02 20:37:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:37:54] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:37:54] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-02 20:37:54] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
[2024-06-02 20:37:54] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-02 20:37:57] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 235/331 variables, 96/124 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 112/236 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/331 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 236 constraints, problems are : Problem set: 0 solved, 234 unsolved in 17966 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 235/331 variables, 96/124 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 112/236 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 234/470 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-02 20:38:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-02 20:38:22] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-02 20:38:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/331 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 473 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 11/11 constraints]
After SMT, in 48358ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 48364ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/128 places, 235/317 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48723 ms. Remains : 96/128 places, 235/317 transitions.
[2024-06-02 20:38:38] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:38:38] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:38:39] [INFO ] Input system was already deterministic with 235 transitions.
[2024-06-02 20:38:39] [INFO ] Flatten gal took : 28 ms
[2024-06-02 20:38:39] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:38:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality13161922486181493423.gal : 14 ms
[2024-06-02 20:38:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality14432675745671335039.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13161922486181493423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14432675745671335039.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:39:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:39:09] [INFO ] Applying decomposition
[2024-06-02 20:39:09] [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/graph2849646975930089691.txt' '-o' '/tmp/graph2849646975930089691.bin' '-w' '/tmp/graph2849646975930089691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2849646975930089691.bin' '-l' '-1' '-v' '-w' '/tmp/graph2849646975930089691.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:39:09] [INFO ] Decomposing Gal with order
[2024-06-02 20:39:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:39:09] [INFO ] Removed a total of 392 redundant transitions.
[2024-06-02 20:39:09] [INFO ] Flatten gal took : 133 ms
[2024-06-02 20:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 20 ms.
[2024-06-02 20:39:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality17944285983504473314.gal : 15 ms
[2024-06-02 20:39:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality3098075941856380040.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/CTLCardinality17944285983504473314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3098075941856380040.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 100 transition count 257
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 100 transition count 257
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 93 transition count 223
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 93 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 91 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 91 transition count 215
Applied a total of 72 rules in 16 ms. Remains 91 /128 variables (removed 37) and now considering 215/317 (removed 102) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 20:39:39] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:39:39] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 20:39:39] [INFO ] Invariant cache hit.
[2024-06-02 20:39:40] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 20:39:40] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 20:39:40] [INFO ] Invariant cache hit.
[2024-06-02 20:39:40] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:39:42] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-06-02 20:39:42] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8203 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 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/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 432 constraints, problems are : Problem set: 0 solved, 214 unsolved in 10473 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 18848ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 18851ms
Starting structural reductions in LTL mode, iteration 1 : 91/128 places, 215/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19246 ms. Remains : 91/128 places, 215/317 transitions.
[2024-06-02 20:39:59] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:39:59] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:39:59] [INFO ] Input system was already deterministic with 215 transitions.
[2024-06-02 20:39:59] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:39:59] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:39:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality11685769730655503685.gal : 3 ms
[2024-06-02 20:39:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality11114750274498102731.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/CTLCardinality11685769730655503685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11114750274498102731.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.86411e+08,28.9119,560760,2,52533,5,1.79901e+06,6,0,574,3.27027e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 20:40:29] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:40:29] [INFO ] Applying decomposition
[2024-06-02 20:40:29] [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/graph3117129716532878302.txt' '-o' '/tmp/graph3117129716532878302.bin' '-w' '/tmp/graph3117129716532878302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3117129716532878302.bin' '-l' '-1' '-v' '-w' '/tmp/graph3117129716532878302.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:40:29] [INFO ] Decomposing Gal with order
[2024-06-02 20:40:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:40:29] [INFO ] Removed a total of 469 redundant transitions.
[2024-06-02 20:40:29] [INFO ] Flatten gal took : 28 ms
[2024-06-02 20:40:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 8 ms.
[2024-06-02 20:40:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality9414108610630568982.gal : 4 ms
[2024-06-02 20:40:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality18378666273908829542.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/CTLCardinality9414108610630568982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18378666273908829542.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,8.86411e+08,21.6036,457776,2540,27,628084,127,299,2.60639e+06,36,539,0


Converting to forward existential form...Done !
original formula: AF(EX((AX(FALSE) * AG(EX((i3.u25.p138==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((!(EX(!(FALSE))) * !(E(TRUE U !(EX((i3.u25.p138==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t212, i0.t210, i0.t208, i0.t206, i0.t53, i0.i0.t58, i0.i0.t213, i0.i0.u1.t44, i0.i0.u1.t63...1080
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 100 transition count 257
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 100 transition count 257
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 93 transition count 223
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 93 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 91 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 91 transition count 215
Applied a total of 72 rules in 10 ms. Remains 91 /128 variables (removed 37) and now considering 215/317 (removed 102) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 20:40:59] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:40:59] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 20:40:59] [INFO ] Invariant cache hit.
[2024-06-02 20:40:59] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 20:40:59] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 20:40:59] [INFO ] Invariant cache hit.
[2024-06-02 20:40:59] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:41:02] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-06-02 20:41:02] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 10344 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 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/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 432 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12742 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 23311ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 23315ms
Starting structural reductions in LTL mode, iteration 1 : 91/128 places, 215/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23595 ms. Remains : 91/128 places, 215/317 transitions.
[2024-06-02 20:41:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:41:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:41:23] [INFO ] Input system was already deterministic with 215 transitions.
[2024-06-02 20:41:23] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:41:23] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:41:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8143497020339652046.gal : 4 ms
[2024-06-02 20:41:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8289273341142722363.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/CTLCardinality8143497020339652046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8289273341142722363.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.86411e+08,29.2107,560824,2,52485,5,1.79808e+06,6,0,574,3.26931e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 20:41:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:41:53] [INFO ] Applying decomposition
[2024-06-02 20:41:53] [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/graph12514825904129338865.txt' '-o' '/tmp/graph12514825904129338865.bin' '-w' '/tmp/graph12514825904129338865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12514825904129338865.bin' '-l' '-1' '-v' '-w' '/tmp/graph12514825904129338865.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:41:53] [INFO ] Decomposing Gal with order
[2024-06-02 20:41:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:41:53] [INFO ] Removed a total of 422 redundant transitions.
[2024-06-02 20:41:53] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:41:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 9 ms.
[2024-06-02 20:41:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality18338051644607534060.gal : 3 ms
[2024-06-02 20:41:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality17994680590191455185.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/CTLCardinality18338051644607534060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17994680590191455185.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,8.86411e+08,22.6001,518828,3105,74,737018,318,345,3.10321e+06,75,1842,0


Converting to forward existential form...Done !
original formula: (EX(EG((i0.u0.p9==1))) * AG((AG(A((i3.u22.p133==0) U ((i0.u3.p19==0)||(i3.u23.p7==1)))) + EX(TRUE))))
=> equivalent forward existential formula: ([(Init * !(EX(EG((i0.u0.p9==1)))))] = FALSE * ([(FwdU(FwdU((FwdU(Init,TRUE) * !(EX(TRUE))),TRUE),!(((i0.u3.p19=...348
Reverse transition relation is NOT exact ! Due to transitions i0.t213, i0.t211, i0.t209, i0.t207, i0.t205, i0.t58, i0.t53, i0.t50, i0.t47, i0.t46, i0.u1.t4...1017
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 103 transition count 265
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 103 transition count 265
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 98 transition count 241
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 98 transition count 241
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 96 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 96 transition count 233
Applied a total of 62 rules in 13 ms. Remains 96 /128 variables (removed 32) and now considering 233/317 (removed 84) transitions.
// Phase 1: matrix 233 rows 96 cols
[2024-06-02 20:42:23] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:42:23] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 20:42:23] [INFO ] Invariant cache hit.
[2024-06-02 20:42:23] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-02 20:42:23] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-06-02 20:42:23] [INFO ] Invariant cache hit.
[2024-06-02 20:42:23] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-02 20:42:25] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 5 ms to minimize.
[2024-06-02 20:42:25] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-06-02 20:42:25] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:42:26] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:42:26] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:42:26] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:42:26] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 2 ms to minimize.
[2024-06-02 20:42:26] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-02 20:42:28] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:42:28] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-02 20:42:28] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:42:29] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:42:29] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 233/329 variables, 96/129 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 110/239 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 239 constraints, problems are : Problem set: 0 solved, 232 unsolved in 13493 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 233/329 variables, 96/129 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 110/239 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 232/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 471 constraints, problems are : Problem set: 0 solved, 232 unsolved in 18202 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 13/13 constraints]
After SMT, in 31964ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 31968ms
Starting structural reductions in LTL mode, iteration 1 : 96/128 places, 233/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32337 ms. Remains : 96/128 places, 233/317 transitions.
[2024-06-02 20:42:55] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:42:55] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:42:55] [INFO ] Input system was already deterministic with 233 transitions.
[2024-06-02 20:42:55] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:42:55] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:42:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality10461077424613433287.gal : 2 ms
[2024-06-02 20:42:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality10070710620893399607.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/CTLCardinality10461077424613433287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10070710620893399607.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:43:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:43:25] [INFO ] Applying decomposition
[2024-06-02 20:43:25] [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/graph947675904552354777.txt' '-o' '/tmp/graph947675904552354777.bin' '-w' '/tmp/graph947675904552354777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph947675904552354777.bin' '-l' '-1' '-v' '-w' '/tmp/graph947675904552354777.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:43:25] [INFO ] Decomposing Gal with order
[2024-06-02 20:43:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:43:25] [INFO ] Removed a total of 394 redundant transitions.
[2024-06-02 20:43:25] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:43:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 7 ms.
[2024-06-02 20:43:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality6093185557746951949.gal : 2 ms
[2024-06-02 20:43:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality9360535190820296862.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/CTLCardinality6093185557746951949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9360535190820296862.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 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 101 transition count 258
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 101 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 95 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 95 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 94 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 94 transition count 224
Applied a total of 66 rules in 7 ms. Remains 94 /128 variables (removed 34) and now considering 224/317 (removed 93) transitions.
// Phase 1: matrix 224 rows 94 cols
[2024-06-02 20:43:55] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:43:56] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 20:43:56] [INFO ] Invariant cache hit.
[2024-06-02 20:43:56] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-02 20:43:56] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-02 20:43:56] [INFO ] Invariant cache hit.
[2024-06-02 20:43:56] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 20:43:59] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-06-02 20:43:59] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/318 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 107/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/318 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 223 constraints, problems are : Problem set: 0 solved, 223 unsolved in 10036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/318 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 107/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 223/446 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 20:44:15] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 20:44:17] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 20:44:24] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/318 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 450 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
After SMT, in 40230ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 40233ms
Starting structural reductions in LTL mode, iteration 1 : 94/128 places, 224/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40559 ms. Remains : 94/128 places, 224/317 transitions.
[2024-06-02 20:44:36] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:44:36] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:44:36] [INFO ] Input system was already deterministic with 224 transitions.
[2024-06-02 20:44:36] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:44:36] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:44:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7975666962743824320.gal : 4 ms
[2024-06-02 20:44:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality14195978619843209104.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/CTLCardinality7975666962743824320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14195978619843209104.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:45:06] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:45:06] [INFO ] Applying decomposition
[2024-06-02 20:45:06] [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/graph7397259295204977536.txt' '-o' '/tmp/graph7397259295204977536.bin' '-w' '/tmp/graph7397259295204977536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7397259295204977536.bin' '-l' '-1' '-v' '-w' '/tmp/graph7397259295204977536.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:45:06] [INFO ] Decomposing Gal with order
[2024-06-02 20:45:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:45:06] [INFO ] Removed a total of 345 redundant transitions.
[2024-06-02 20:45:06] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:45:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 6 ms.
[2024-06-02 20:45:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality9912742997049249865.gal : 2 ms
[2024-06-02 20:45:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality14000644179370048288.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/CTLCardinality9912742997049249865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14000644179370048288.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.33163e+09,18.1586,323640,4438,517,434343,4600,305,1.67704e+06,130,48100,0


Converting to forward existential form...Done !
original formula: AX(A(AF((((i5.u22.p135==0)&&((i5.u21.p10==0)||(i5.u22.p141==1)))&&((u11.p81==0)||(i5.u21.p145==1)))) U ((!(AG((u5.p42==1))) * EF(((i3.i0....208
=> equivalent forward existential formula: ((([((FwdU(EY(Init),!(((!(!(E(TRUE U !((u5.p42==1))))) * E(TRUE U ((i3.i0.u14.p103==0)||(i1.u8.p62==1)))) * (i5....1020
Reverse transition relation is NOT exact ! Due to transitions t125, t128, t131, t138, t142, t148, t154, t164, t180, t184, t190, t195, t203, t209, t211, t21...1143
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 100 transition count 259
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 100 transition count 259
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 50 place count 95 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 55 place count 95 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 56 place count 94 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 94 transition count 232
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 59 place count 93 transition count 231
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 62 place count 93 transition count 228
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 68 place count 90 transition count 225
Applied a total of 68 rules in 29 ms. Remains 90 /128 variables (removed 38) and now considering 225/317 (removed 92) transitions.
// Phase 1: matrix 225 rows 90 cols
[2024-06-02 20:45:36] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:45:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 20:45:36] [INFO ] Invariant cache hit.
[2024-06-02 20:45:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:45:37] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-06-02 20:45:37] [INFO ] Redundant transitions in 10 ms returned []
Running 216 sub problems to find dead transitions.
[2024-06-02 20:45:37] [INFO ] Invariant cache hit.
[2024-06-02 20:45:37] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 3/90 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:45:39] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:45:39] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:45:39] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-06-02 20:45:40] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-02 20:45:40] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:45:40] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:45:41] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:45:41] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-06-02 20:45:41] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:45:42] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 225/315 variables, 90/120 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 0/315 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 156 constraints, problems are : Problem set: 0 solved, 216 unsolved in 10960 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 3/90 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 225/315 variables, 90/120 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 216/372 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:45:53] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 0/315 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 373 constraints, problems are : Problem set: 0 solved, 216 unsolved in 14392 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 constraints]
After SMT, in 25533ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 25536ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/128 places, 225/317 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25824 ms. Remains : 90/128 places, 225/317 transitions.
[2024-06-02 20:46:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:46:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:46:02] [INFO ] Input system was already deterministic with 225 transitions.
[2024-06-02 20:46:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality7717893094277628841.gal : 2 ms
[2024-06-02 20:46:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality8577318453779384678.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/CTLCardinality7717893094277628841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8577318453779384678.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:46:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:32] [INFO ] Applying decomposition
[2024-06-02 20:46:32] [INFO ] Flatten gal took : 12 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/graph13010634637690506354.txt' '-o' '/tmp/graph13010634637690506354.bin' '-w' '/tmp/graph13010634637690506354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13010634637690506354.bin' '-l' '-1' '-v' '-w' '/tmp/graph13010634637690506354.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:46:32] [INFO ] Decomposing Gal with order
[2024-06-02 20:46:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:46:32] [INFO ] Removed a total of 500 redundant transitions.
[2024-06-02 20:46:32] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:46:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 6 ms.
[2024-06-02 20:46:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality2673504231611644055.gal : 2 ms
[2024-06-02 20:46:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17610475353163332572.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/CTLCardinality2673504231611644055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17610475353163332572.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 105 transition count 270
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 105 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 100 transition count 246
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 100 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 98 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 98 transition count 238
Applied a total of 58 rules in 5 ms. Remains 98 /128 variables (removed 30) and now considering 238/317 (removed 79) transitions.
// Phase 1: matrix 238 rows 98 cols
[2024-06-02 20:47:02] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:47:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 20:47:02] [INFO ] Invariant cache hit.
[2024-06-02 20:47:03] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-02 20:47:03] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-06-02 20:47:03] [INFO ] Invariant cache hit.
[2024-06-02 20:47:03] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-02 20:47:05] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:47:05] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:47:05] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:47:05] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-02 20:47:05] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:47:06] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-02 20:47:07] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-02 20:47:08] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:47:08] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 238/336 variables, 98/133 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 111/244 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 244 constraints, problems are : Problem set: 0 solved, 237 unsolved in 13390 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 238/336 variables, 98/133 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 111/244 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 237/481 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 481 constraints, problems are : Problem set: 0 solved, 237 unsolved in 17455 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 15/15 constraints]
After SMT, in 31121ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 31127ms
Starting structural reductions in LTL mode, iteration 1 : 98/128 places, 238/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31539 ms. Remains : 98/128 places, 238/317 transitions.
[2024-06-02 20:47:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:34] [INFO ] Input system was already deterministic with 238 transitions.
[2024-06-02 20:47:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:47:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality10446688164742817214.gal : 2 ms
[2024-06-02 20:47:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality12581187365519801111.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/CTLCardinality10446688164742817214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12581187365519801111.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:48:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:48:04] [INFO ] Applying decomposition
[2024-06-02 20:48:04] [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/graph5789902380027977991.txt' '-o' '/tmp/graph5789902380027977991.bin' '-w' '/tmp/graph5789902380027977991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5789902380027977991.bin' '-l' '-1' '-v' '-w' '/tmp/graph5789902380027977991.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:48:04] [INFO ] Decomposing Gal with order
[2024-06-02 20:48:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:48:04] [INFO ] Removed a total of 399 redundant transitions.
[2024-06-02 20:48:04] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:48:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 11 ms.
[2024-06-02 20:48:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality3879243368624539616.gal : 3 ms
[2024-06-02 20:48:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality11657786783820890213.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/CTLCardinality3879243368624539616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11657786783820890213.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 101 transition count 259
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 101 transition count 259
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 95 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 95 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 94 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 94 transition count 226
Applied a total of 66 rules in 6 ms. Remains 94 /128 variables (removed 34) and now considering 226/317 (removed 91) transitions.
// Phase 1: matrix 226 rows 94 cols
[2024-06-02 20:48:34] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:48:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:48:34] [INFO ] Invariant cache hit.
[2024-06-02 20:48:34] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 20:48:34] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 20:48:34] [INFO ] Invariant cache hit.
[2024-06-02 20:48:34] [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 20:48:37] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:48:38] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:48:38] [INFO ] Deduced a trap composed of 31 places in 62 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 11293 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
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 450 constraints, problems are : Problem set: 0 solved, 225 unsolved in 14583 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]
After SMT, in 26147ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 26150ms
Starting structural reductions in LTL mode, iteration 1 : 94/128 places, 226/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26474 ms. Remains : 94/128 places, 226/317 transitions.
[2024-06-02 20:49:01] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:49:01] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:49:01] [INFO ] Input system was already deterministic with 226 transitions.
[2024-06-02 20:49:01] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:49:01] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:49:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality4113746861618307585.gal : 3 ms
[2024-06-02 20:49:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality4026125481880627683.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/CTLCardinality4113746861618307585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4026125481880627683.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:49:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:49:31] [INFO ] Applying decomposition
[2024-06-02 20:49:31] [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/graph8891955002764535682.txt' '-o' '/tmp/graph8891955002764535682.bin' '-w' '/tmp/graph8891955002764535682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8891955002764535682.bin' '-l' '-1' '-v' '-w' '/tmp/graph8891955002764535682.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:49:31] [INFO ] Decomposing Gal with order
[2024-06-02 20:49:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:49:31] [INFO ] Removed a total of 383 redundant transitions.
[2024-06-02 20:49:31] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:49:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 3 ms.
[2024-06-02 20:49:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality12079272509005737454.gal : 2 ms
[2024-06-02 20:49:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality7904679711121965692.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/CTLCardinality12079272509005737454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7904679711121965692.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.23639e+09,18.2961,376112,3027,162,528382,813,328,2.11571e+06,124,5329,0


Converting to forward existential form...Done !
original formula: AX(AF(((u5.p35==0)&&(i0.u0.p13==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((u5.p35==0)&&(i0.u0.p13==1))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 102 transition count 259
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 102 transition count 259
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 95 transition count 225
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 95 transition count 225
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 93 transition count 217
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 93 transition count 217
Applied a total of 68 rules in 5 ms. Remains 93 /128 variables (removed 35) and now considering 217/317 (removed 100) transitions.
// Phase 1: matrix 217 rows 93 cols
[2024-06-02 20:50:01] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:50:01] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 20:50:01] [INFO ] Invariant cache hit.
[2024-06-02 20:50:01] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 20:50:01] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-02 20:50:01] [INFO ] Invariant cache hit.
[2024-06-02 20:50:01] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:50:04] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-06-02 20:50:05] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/310 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 105/220 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 220 constraints, problems are : Problem set: 0 solved, 216 unsolved in 11079 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/310 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 105/220 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 216/436 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:50:26] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:50:26] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/310 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 20:50:30] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (OVERLAPS) 0/310 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 439 constraints, problems are : Problem set: 0 solved, 216 unsolved in 27930 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 5/5 constraints]
After SMT, in 39287ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 39292ms
Starting structural reductions in LTL mode, iteration 1 : 93/128 places, 217/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39673 ms. Remains : 93/128 places, 217/317 transitions.
[2024-06-02 20:50:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:50:41] [INFO ] Input system was already deterministic with 217 transitions.
[2024-06-02 20:50:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:50:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:50:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9356799100383636419.gal : 2 ms
[2024-06-02 20:50:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality8260022071719055168.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/CTLCardinality9356799100383636419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8260022071719055168.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:51:11] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:51:11] [INFO ] Applying decomposition
[2024-06-02 20:51: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/graph4478743450474213026.txt' '-o' '/tmp/graph4478743450474213026.bin' '-w' '/tmp/graph4478743450474213026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4478743450474213026.bin' '-l' '-1' '-v' '-w' '/tmp/graph4478743450474213026.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:51:11] [INFO ] Decomposing Gal with order
[2024-06-02 20:51:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:51:11] [INFO ] Removed a total of 430 redundant transitions.
[2024-06-02 20:51:11] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:51:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2024-06-02 20:51:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality112795420944650991.gal : 2 ms
[2024-06-02 20:51:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality13391377147979163889.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/CTLCardinality112795420944650991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13391377147979163889.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 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 102 transition count 268
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 102 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 96 transition count 238
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 96 transition count 238
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 55 place count 94 transition count 230
Iterating global reduction 0 with 2 rules applied. Total rules applied 57 place count 94 transition count 230
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 59 place count 93 transition count 229
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 62 place count 93 transition count 226
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 68 place count 90 transition count 223
Applied a total of 68 rules in 23 ms. Remains 90 /128 variables (removed 38) and now considering 223/317 (removed 94) transitions.
// Phase 1: matrix 223 rows 90 cols
[2024-06-02 20:51:41] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:51:41] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 20:51:41] [INFO ] Invariant cache hit.
[2024-06-02 20:51:41] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:51:41] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-06-02 20:51:41] [INFO ] Redundant transitions in 3 ms returned []
Running 214 sub problems to find dead transitions.
[2024-06-02 20:51:41] [INFO ] Invariant cache hit.
[2024-06-02 20:51:41] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 3/90 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:51:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-02 20:51:44] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:51:44] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:51:45] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-06-02 20:51:45] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-06-02 20:51:45] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:51:45] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 3 ms to minimize.
[2024-06-02 20:51:45] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:51:46] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:51:46] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:51:46] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 223/313 variables, 90/121 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/313 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 157 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12055 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 3/90 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:51:56] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-06-02 20:51:56] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 223/313 variables, 90/123 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 36/159 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 214/373 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 20:52:01] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 12 (OVERLAPS) 0/313 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 374 constraints, problems are : Problem set: 0 solved, 214 unsolved in 19061 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 14/14 constraints]
After SMT, in 31266ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 31269ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/128 places, 223/317 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31548 ms. Remains : 90/128 places, 223/317 transitions.
[2024-06-02 20:52:12] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:52:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:52:12] [INFO ] Input system was already deterministic with 223 transitions.
[2024-06-02 20:52:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:52:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:52:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality9620825885539440226.gal : 2 ms
[2024-06-02 20:52:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality17779066886727442631.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/CTLCardinality9620825885539440226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17779066886727442631.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:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:52:42] [INFO ] Applying decomposition
[2024-06-02 20:52:42] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1372726372700152366.txt' '-o' '/tmp/graph1372726372700152366.bin' '-w' '/tmp/graph1372726372700152366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1372726372700152366.bin' '-l' '-1' '-v' '-w' '/tmp/graph1372726372700152366.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:52:42] [INFO ] Decomposing Gal with order
[2024-06-02 20:52:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:52:42] [INFO ] Removed a total of 477 redundant transitions.
[2024-06-02 20:52:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:52:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 6 ms.
[2024-06-02 20:52:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality14620730098494914813.gal : 4 ms
[2024-06-02 20:52:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality17182947239326922058.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/CTLCardinality14620730098494914813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17182947239326922058.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 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 101 transition count 258
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 101 transition count 258
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 94 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 94 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 92 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 92 transition count 216
Applied a total of 70 rules in 3 ms. Remains 92 /128 variables (removed 36) and now considering 216/317 (removed 101) transitions.
// Phase 1: matrix 216 rows 92 cols
[2024-06-02 20:53:13] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:53:13] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 20:53:13] [INFO ] Invariant cache hit.
[2024-06-02 20:53:13] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 20:53:13] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-02 20:53:13] [INFO ] Invariant cache hit.
[2024-06-02 20:53:13] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 20:53:16] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-06-02 20:53:16] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/308 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 105/219 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 219 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10420 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/308 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 105/219 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 215/434 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 434 constraints, problems are : Problem set: 0 solved, 215 unsolved in 15308 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
After SMT, in 25879ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 25883ms
Starting structural reductions in LTL mode, iteration 1 : 92/128 places, 216/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26138 ms. Remains : 92/128 places, 216/317 transitions.
[2024-06-02 20:53:39] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:53:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:53:39] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-02 20:53:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:53:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:53:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality62620052723976481.gal : 2 ms
[2024-06-02 20:53:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality17585743794440494987.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/CTLCardinality62620052723976481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17585743794440494987.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:54:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:54:09] [INFO ] Applying decomposition
[2024-06-02 20:54:09] [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/graph1593216079610651388.txt' '-o' '/tmp/graph1593216079610651388.bin' '-w' '/tmp/graph1593216079610651388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1593216079610651388.bin' '-l' '-1' '-v' '-w' '/tmp/graph1593216079610651388.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:54:09] [INFO ] Decomposing Gal with order
[2024-06-02 20:54:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:54:09] [INFO ] Removed a total of 349 redundant transitions.
[2024-06-02 20:54:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:54:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 4 ms.
[2024-06-02 20:54:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality7678057115608709156.gal : 1 ms
[2024-06-02 20:54:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality7592238958984237505.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/CTLCardinality7678057115608709156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7592238958984237505.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.04159e+09,24.2133,504964,3180,310,681315,2466,321,2.89974e+06,116,23420,0


Converting to forward existential form...Done !
original formula: AX(AX(AF((AX((i3.u22.p135==0)) * !(A((i2.i0.u15.p106==0) U ((i2.i0.u16.p109==0)||(i3.u21.p145==1))))))))
=> equivalent forward existential formula: [FwdG(EY(EY(Init)),!((!(EX(!((i3.u22.p135==0)))) * !(!((E(!(((i2.i0.u16.p109==0)||(i3.u21.p145==1))) U (!((i2.i0...280
Reverse transition relation is NOT exact ! Due to transitions t135, t157, t181, t192, i0.t213, i0.t211, i0.t53, i0.i0.t58, i0.i0.t214, i0.i0.u0.t44, i0.i0....1096
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 99 transition count 257
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 99 transition count 257
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 53 place count 93 transition count 229
Iterating global reduction 0 with 6 rules applied. Total rules applied 59 place count 93 transition count 229
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 61 place count 91 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 63 place count 91 transition count 221
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 65 place count 90 transition count 220
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 68 place count 90 transition count 217
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 74 place count 87 transition count 214
Applied a total of 74 rules in 21 ms. Remains 87 /128 variables (removed 41) and now considering 214/317 (removed 103) transitions.
// Phase 1: matrix 214 rows 87 cols
[2024-06-02 20:54:39] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:54:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:54:39] [INFO ] Invariant cache hit.
[2024-06-02 20:54:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:54:39] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-02 20:54:39] [INFO ] Redundant transitions in 2 ms returned []
Running 205 sub problems to find dead transitions.
[2024-06-02 20:54:39] [INFO ] Invariant cache hit.
[2024-06-02 20:54:39] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 3/87 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:54:42] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:54:42] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-06-02 20:54:43] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:54:43] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:54:43] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:54:44] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:54:44] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:54:44] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:54:44] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 214/301 variables, 87/116 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 152 constraints, problems are : Problem set: 0 solved, 205 unsolved in 11469 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 3/87 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 214/301 variables, 87/116 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 205/357 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 357 constraints, problems are : Problem set: 0 solved, 205 unsolved in 13723 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 9/9 constraints]
After SMT, in 25352ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 25355ms
Starting structural reductions in SI_CTL mode, iteration 1 : 87/128 places, 214/317 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25594 ms. Remains : 87/128 places, 214/317 transitions.
[2024-06-02 20:55:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:55:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:55:05] [INFO ] Input system was already deterministic with 214 transitions.
[2024-06-02 20:55:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:55:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:55:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality17821431942937724273.gal : 2 ms
[2024-06-02 20:55:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality5053077581323708656.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/CTLCardinality17821431942937724273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5053077581323708656.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:35] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:55:35] [INFO ] Applying decomposition
[2024-06-02 20:55:35] [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/graph10840731130015933083.txt' '-o' '/tmp/graph10840731130015933083.bin' '-w' '/tmp/graph10840731130015933083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10840731130015933083.bin' '-l' '-1' '-v' '-w' '/tmp/graph10840731130015933083.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:55:35] [INFO ] Decomposing Gal with order
[2024-06-02 20:55:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:55:35] [INFO ] Removed a total of 466 redundant transitions.
[2024-06-02 20:55:35] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:55:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 2 ms.
[2024-06-02 20:55:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality4625324085878007368.gal : 2 ms
[2024-06-02 20:55:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality16237760356569696938.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/CTLCardinality4625324085878007368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16237760356569696938.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.81395e+08,27.8576,535704,3411,76,719942,374,305,3.15211e+06,67,2522,0


Converting to forward existential form...Done !
original formula: EG((i2.u22.p121==0))
=> equivalent forward existential formula: [FwdG(Init,(i2.u22.p121==0))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 103 transition count 265
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 103 transition count 265
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 98 transition count 241
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 98 transition count 241
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 96 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 96 transition count 233
Applied a total of 62 rules in 4 ms. Remains 96 /128 variables (removed 32) and now considering 233/317 (removed 84) transitions.
// Phase 1: matrix 233 rows 96 cols
[2024-06-02 20:56:05] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:56:05] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 20:56:05] [INFO ] Invariant cache hit.
[2024-06-02 20:56:05] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-02 20:56:05] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-06-02 20:56:05] [INFO ] Invariant cache hit.
[2024-06-02 20:56:05] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-02 20:56:07] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-06-02 20:56:07] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:56:07] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:56:08] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-02 20:56:08] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:56:09] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:56:09] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-06-02 20:56:09] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-06-02 20:56:09] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:56:09] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:56:09] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:56:09] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 233/329 variables, 96/128 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 110/238 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 238 constraints, problems are : Problem set: 0 solved, 232 unsolved in 12680 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 233/329 variables, 96/128 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 110/238 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 232/470 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 470 constraints, problems are : Problem set: 0 solved, 232 unsolved in 16488 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 12/12 constraints]
After SMT, in 29337ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 29340ms
Starting structural reductions in LTL mode, iteration 1 : 96/128 places, 233/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29638 ms. Remains : 96/128 places, 233/317 transitions.
[2024-06-02 20:56:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:56:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:56:34] [INFO ] Input system was already deterministic with 233 transitions.
[2024-06-02 20:56:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:56:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:56:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality5385662483773634875.gal : 2 ms
[2024-06-02 20:56:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality7310886570971392652.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/CTLCardinality5385662483773634875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7310886570971392652.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:57:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:57:04] [INFO ] Applying decomposition
[2024-06-02 20:57:04] [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/graph17831935820598677093.txt' '-o' '/tmp/graph17831935820598677093.bin' '-w' '/tmp/graph17831935820598677093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17831935820598677093.bin' '-l' '-1' '-v' '-w' '/tmp/graph17831935820598677093.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:57:05] [INFO ] Decomposing Gal with order
[2024-06-02 20:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:57:05] [INFO ] Removed a total of 444 redundant transitions.
[2024-06-02 20:57:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 3 ms.
[2024-06-02 20:57:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality5676923185468882276.gal : 3 ms
[2024-06-02 20:57:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15170169166529156721.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/CTLCardinality5676923185468882276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15170169166529156721.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 98 transition count 255
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 98 transition count 255
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 56 place count 91 transition count 221
Iterating global reduction 0 with 7 rules applied. Total rules applied 63 place count 91 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 64 place count 90 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 90 transition count 217
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 89 transition count 216
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 89 transition count 213
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 86 transition count 210
Applied a total of 76 rules in 14 ms. Remains 86 /128 variables (removed 42) and now considering 210/317 (removed 107) transitions.
// Phase 1: matrix 210 rows 86 cols
[2024-06-02 20:57:35] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:57:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:57:35] [INFO ] Invariant cache hit.
[2024-06-02 20:57:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:57:35] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 20:57:35] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2024-06-02 20:57:35] [INFO ] Invariant cache hit.
[2024-06-02 20:57:35] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-02 20:57:38] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-02 20:57:38] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:57:38] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-06-02 20:57:39] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:57:39] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 210/296 variables, 86/111 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/296 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 147 constraints, problems are : Problem set: 0 solved, 201 unsolved in 11959 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 210/296 variables, 86/111 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 201/348 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-02 20:57:54] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/296 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (OVERLAPS) 0/296 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 349 constraints, problems are : Problem set: 0 solved, 201 unsolved in 17005 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 6/6 constraints]
After SMT, in 29119ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 29121ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/128 places, 210/317 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29383 ms. Remains : 86/128 places, 210/317 transitions.
[2024-06-02 20:58:04] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:58:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:58:04] [INFO ] Input system was already deterministic with 210 transitions.
[2024-06-02 20:58:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality5473307261733596035.gal : 2 ms
[2024-06-02 20:58:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality8360044428712153896.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/CTLCardinality5473307261733596035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8360044428712153896.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44409e+08,29.887,565140,2,60395,5,1.83725e+06,6,0,547,3.28873e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 20:58:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:58:34] [INFO ] Applying decomposition
[2024-06-02 20:58:34] [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/graph15557524599983743698.txt' '-o' '/tmp/graph15557524599983743698.bin' '-w' '/tmp/graph15557524599983743698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15557524599983743698.bin' '-l' '-1' '-v' '-w' '/tmp/graph15557524599983743698.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:58:34] [INFO ] Decomposing Gal with order
[2024-06-02 20:58:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:58:34] [INFO ] Removed a total of 411 redundant transitions.
[2024-06-02 20:58:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:58:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2024-06-02 20:58:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9175896114589359161.gal : 2 ms
[2024-06-02 20:58:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality10853341935129291209.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/CTLCardinality9175896114589359161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10853341935129291209.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44409e+08,25.5938,459196,3243,91,614471,417,305,2.58269e+06,81,2051,0


Converting to forward existential form...Done !
original formula: AG(EF((u13.p81==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (u13.p81==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t109, t114, t136, t173, t188, t205, u13.t20, u13.t21, u13.t22, u13.t23, u13.t24, u13.t25, u13...1036
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 103 transition count 261
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 103 transition count 261
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 97 transition count 233
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 97 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 54 place count 96 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 96 transition count 229
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 57 place count 95 transition count 228
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 60 place count 95 transition count 225
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 66 place count 92 transition count 222
Applied a total of 66 rules in 17 ms. Remains 92 /128 variables (removed 36) and now considering 222/317 (removed 95) transitions.
// Phase 1: matrix 222 rows 92 cols
[2024-06-02 20:59:04] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 20:59:04] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 20:59:04] [INFO ] Invariant cache hit.
[2024-06-02 20:59:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:59:04] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-02 20:59:04] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-02 20:59:04] [INFO ] Invariant cache hit.
[2024-06-02 20:59:04] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 3/92 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 20:59:08] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-06-02 20:59:08] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 4 ms to minimize.
[2024-06-02 20:59:08] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:59:08] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 20:59:10] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 20:59:12] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 20:59:14] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:59:14] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 222/314 variables, 92/128 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 36/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 0/314 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 164 constraints, problems are : Problem set: 0 solved, 213 unsolved in 18024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 3/92 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 222/314 variables, 92/128 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 36/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 213/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 377 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14880 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 16/16 constraints]
After SMT, in 33075ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 33078ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/128 places, 222/317 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33371 ms. Remains : 92/128 places, 222/317 transitions.
[2024-06-02 20:59:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:59:38] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:59:38] [INFO ] Input system was already deterministic with 222 transitions.
[2024-06-02 20:59:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:59:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:59:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality4545531231959264836.gal : 2 ms
[2024-06-02 20:59:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality16238333401991708473.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/CTLCardinality4545531231959264836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16238333401991708473.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:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:00:08] [INFO ] Applying decomposition
[2024-06-02 21:00:08] [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/graph499363922135846287.txt' '-o' '/tmp/graph499363922135846287.bin' '-w' '/tmp/graph499363922135846287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph499363922135846287.bin' '-l' '-1' '-v' '-w' '/tmp/graph499363922135846287.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:00:08] [INFO ] Decomposing Gal with order
[2024-06-02 21:00:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:00:08] [INFO ] Removed a total of 417 redundant transitions.
[2024-06-02 21:00:08] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:00:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 3 ms.
[2024-06-02 21:00:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality14686165852467335903.gal : 2 ms
[2024-06-02 21:00:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality2783087389980594788.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/CTLCardinality14686165852467335903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2783087389980594788.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 105 transition count 269
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 105 transition count 269
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 99 transition count 239
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 99 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 98 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 98 transition count 235
Applied a total of 58 rules in 3 ms. Remains 98 /128 variables (removed 30) and now considering 235/317 (removed 82) transitions.
// Phase 1: matrix 235 rows 98 cols
[2024-06-02 21:00:38] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:00:38] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:00:38] [INFO ] Invariant cache hit.
[2024-06-02 21:00:38] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-02 21:00:38] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-06-02 21:00:38] [INFO ] Invariant cache hit.
[2024-06-02 21:00:38] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-02 21:00:41] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:00:41] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:00:41] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:00:41] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:00:41] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:00:42] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:00:42] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 235/333 variables, 98/125 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/333 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 235 constraints, problems are : Problem set: 0 solved, 234 unsolved in 12042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 110/110 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/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 235/333 variables, 98/125 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 234/469 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 469 constraints, problems are : Problem set: 0 solved, 234 unsolved in 17057 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 7/7 constraints]
After SMT, in 29385ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 29389ms
Starting structural reductions in LTL mode, iteration 1 : 98/128 places, 235/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29772 ms. Remains : 98/128 places, 235/317 transitions.
[2024-06-02 21:01:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:01:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:01:08] [INFO ] Input system was already deterministic with 235 transitions.
[2024-06-02 21:01:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:01:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality14163899649661615972.gal : 1 ms
[2024-06-02 21:01:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality4733466693575635440.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/CTLCardinality14163899649661615972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4733466693575635440.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:38] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:38] [INFO ] Applying decomposition
[2024-06-02 21:01:38] [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/graph8914447588392010247.txt' '-o' '/tmp/graph8914447588392010247.bin' '-w' '/tmp/graph8914447588392010247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8914447588392010247.bin' '-l' '-1' '-v' '-w' '/tmp/graph8914447588392010247.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:01:38] [INFO ] Decomposing Gal with order
[2024-06-02 21:01:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:01:38] [INFO ] Removed a total of 358 redundant transitions.
[2024-06-02 21:01:38] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:01:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 3 ms.
[2024-06-02 21:01:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality9193259887701206494.gal : 2 ms
[2024-06-02 21:01:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11414003686854328141.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/CTLCardinality9193259887701206494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11414003686854328141.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.
Detected timeout of ITS tools.
[2024-06-02 21:02:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:02:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:02:08] [INFO ] Applying decomposition
[2024-06-02 21:02:08] [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/graph14338564051070655548.txt' '-o' '/tmp/graph14338564051070655548.bin' '-w' '/tmp/graph14338564051070655548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14338564051070655548.bin' '-l' '-1' '-v' '-w' '/tmp/graph14338564051070655548.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:02:08] [INFO ] Decomposing Gal with order
[2024-06-02 21:02:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:02:08] [INFO ] Removed a total of 386 redundant transitions.
[2024-06-02 21:02:08] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:02:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 3 ms.
[2024-06-02 21:02:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7935487278994810784.gal : 3 ms
[2024-06-02 21:02:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality14327828807232551807.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/CTLCardinality7935487278994810784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14327828807232551807.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 16 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-02 21:25:10] [INFO ] Applying decomposition
[2024-06-02 21:25:10] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:25:10] [INFO ] Decomposing Gal with order
[2024-06-02 21:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:25:10] [INFO ] Removed a total of 658 redundant transitions.
[2024-06-02 21:25:10] [INFO ] Flatten gal took : 34 ms
[2024-06-02 21:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 7 ms.
[2024-06-02 21:25:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14203514971081386130.gal : 7 ms
[2024-06-02 21:25:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality14313043346647473894.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/CTLCardinality14203514971081386130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14313043346647473894.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 16 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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-11, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920000081"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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