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.r026-smll-171620167100145.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 AutoFlight-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 22:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:42 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 AutoFlight-PT-06b-CTLCardinality-2024-00
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-01
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-02
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-03
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-04
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-05
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-06
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-07
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-08
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-09
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-10
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2024-11
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2023-12
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2023-13
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2023-14
FORMULA_NAME AutoFlight-PT-06b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716263422107

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 03:50:23] [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-05-21 03:50:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:50:24] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-21 03:50:24] [INFO ] Transformed 574 places.
[2024-05-21 03:50:24] [INFO ] Transformed 572 transitions.
[2024-05-21 03:50:24] [INFO ] Found NUPN structural information;
[2024-05-21 03:50:24] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 109 ms.
Support contains 80 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 514 transition count 512
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 514 transition count 512
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 130 place count 514 transition count 502
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 154 place count 490 transition count 478
Iterating global reduction 1 with 24 rules applied. Total rules applied 178 place count 490 transition count 478
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 181 place count 487 transition count 475
Iterating global reduction 1 with 3 rules applied. Total rules applied 184 place count 487 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 186 place count 485 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 188 place count 485 transition count 473
Applied a total of 188 rules in 226 ms. Remains 485 /574 variables (removed 89) and now considering 473/572 (removed 99) transitions.
// Phase 1: matrix 473 rows 485 cols
[2024-05-21 03:50:24] [INFO ] Computed 40 invariants in 31 ms
[2024-05-21 03:50:25] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-21 03:50:25] [INFO ] Invariant cache hit.
[2024-05-21 03:50:26] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-21 03:50:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/485 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-21 03:50:36] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 25 ms to minimize.
[2024-05-21 03:50:36] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 4 ms to minimize.
[2024-05-21 03:50:36] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 3 ms to minimize.
[2024-05-21 03:50:36] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 03:50:36] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-05-21 03:50:36] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
[2024-05-21 03:50:37] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 5 ms to minimize.
[2024-05-21 03:50:37] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 5 ms to minimize.
[2024-05-21 03:50:38] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 6 ms to minimize.
[2024-05-21 03:50:38] [INFO ] Deduced a trap composed of 73 places in 233 ms of which 5 ms to minimize.
[2024-05-21 03:50:38] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 5 ms to minimize.
[2024-05-21 03:50:38] [INFO ] Deduced a trap composed of 63 places in 231 ms of which 4 ms to minimize.
[2024-05-21 03:50:39] [INFO ] Deduced a trap composed of 63 places in 272 ms of which 5 ms to minimize.
[2024-05-21 03:50:39] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 13 ms to minimize.
[2024-05-21 03:50:39] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 4 ms to minimize.
[2024-05-21 03:50:40] [INFO ] Deduced a trap composed of 22 places in 383 ms of which 5 ms to minimize.
[2024-05-21 03:50:40] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 5 ms to minimize.
[2024-05-21 03:50:40] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 5 ms to minimize.
[2024-05-21 03:50:40] [INFO ] Deduced a trap composed of 62 places in 268 ms of which 5 ms to minimize.
[2024-05-21 03:50:41] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-21 03:50:46] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 4 ms to minimize.
[2024-05-21 03:50:46] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 4 ms to minimize.
[2024-05-21 03:50:46] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 4 ms to minimize.
[2024-05-21 03:50:46] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-05-21 03:50:47] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 5 ms to minimize.
[2024-05-21 03:50:47] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 4 ms to minimize.
[2024-05-21 03:50:47] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 4 ms to minimize.
[2024-05-21 03:50:48] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 4 ms to minimize.
[2024-05-21 03:50:48] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 5 ms to minimize.
[2024-05-21 03:50:48] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 5 ms to minimize.
[2024-05-21 03:50:48] [INFO ] Deduced a trap composed of 77 places in 264 ms of which 5 ms to minimize.
[2024-05-21 03:50:48] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-05-21 03:50:49] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 3 ms to minimize.
[2024-05-21 03:50:49] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 4 ms to minimize.
[2024-05-21 03:50:49] [INFO ] Deduced a trap composed of 85 places in 253 ms of which 5 ms to minimize.
[2024-05-21 03:50:49] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 5 ms to minimize.
[2024-05-21 03:50:50] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 4 ms to minimize.
[2024-05-21 03:50:50] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 3 ms to minimize.
[2024-05-21 03:50:50] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 3 ms to minimize.
[2024-05-21 03:50:50] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-21 03:50:51] [INFO ] Deduced a trap composed of 88 places in 199 ms of which 4 ms to minimize.
[2024-05-21 03:50:51] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 4 ms to minimize.
[2024-05-21 03:50:52] [INFO ] Deduced a trap composed of 84 places in 191 ms of which 4 ms to minimize.
[2024-05-21 03:50:52] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 4 ms to minimize.
[2024-05-21 03:50:52] [INFO ] Deduced a trap composed of 79 places in 200 ms of which 3 ms to minimize.
[2024-05-21 03:50:52] [INFO ] Deduced a trap composed of 77 places in 230 ms of which 4 ms to minimize.
[2024-05-21 03:50:52] [INFO ] Deduced a trap composed of 77 places in 184 ms of which 4 ms to minimize.
[2024-05-21 03:50:53] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 3 ms to minimize.
[2024-05-21 03:50:53] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:50:53] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:50:53] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 5 ms to minimize.
[2024-05-21 03:50:53] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-05-21 03:50:53] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 4 ms to minimize.
[2024-05-21 03:50:54] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 4 ms to minimize.
[2024-05-21 03:50:54] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 4 ms to minimize.
[2024-05-21 03:50:55] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 4 ms to minimize.
[2024-05-21 03:50:55] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 4 ms to minimize.
[2024-05-21 03:50:55] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-05-21 03:50:55] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 3 ms to minimize.
[2024-05-21 03:50:55] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/958 variables, and 100 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/485 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 60/100 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-21 03:51:02] [INFO ] Deduced a trap composed of 72 places in 277 ms of which 5 ms to minimize.
[2024-05-21 03:51:02] [INFO ] Deduced a trap composed of 62 places in 273 ms of which 4 ms to minimize.
[2024-05-21 03:51:02] [INFO ] Deduced a trap composed of 73 places in 250 ms of which 4 ms to minimize.
[2024-05-21 03:51:03] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 4 ms to minimize.
[2024-05-21 03:51:03] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:51:03] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-21 03:51:03] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-05-21 03:51:03] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-05-21 03:51:03] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:51:04] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:51:04] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:51:04] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 3 ms to minimize.
[2024-05-21 03:51:04] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-21 03:51:04] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 3 ms to minimize.
[2024-05-21 03:51:05] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 3 ms to minimize.
[2024-05-21 03:51:05] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:51:05] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-21 03:51:05] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:51:05] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:51:06] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-21 03:51:06] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 5 ms to minimize.
[2024-05-21 03:51:07] [INFO ] Deduced a trap composed of 81 places in 199 ms of which 4 ms to minimize.
[2024-05-21 03:51:07] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 4 ms to minimize.
[2024-05-21 03:51:07] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 3 ms to minimize.
[2024-05-21 03:51:08] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
[2024-05-21 03:51:08] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:51:08] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:51:08] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:51:08] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 4 ms to minimize.
[2024-05-21 03:51:09] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:51:09] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:51:09] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-05-21 03:51:09] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 3 ms to minimize.
[2024-05-21 03:51:09] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-21 03:51:09] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-21 03:51:10] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 3 ms to minimize.
[2024-05-21 03:51:10] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
[2024-05-21 03:51:10] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-21 03:51:10] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-21 03:51:10] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-21 03:51:11] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
[2024-05-21 03:51:11] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-05-21 03:51:12] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 4 ms to minimize.
[2024-05-21 03:51:12] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 3 ms to minimize.
[2024-05-21 03:51:12] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:51:12] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:51:12] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:51:12] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-05-21 03:51:12] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:51:13] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 3 ms to minimize.
[2024-05-21 03:51:13] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-21 03:51:13] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 3 ms to minimize.
[2024-05-21 03:51:13] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:51:14] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:51:14] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:51:14] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:51:14] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:51:14] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-05-21 03:51:15] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-05-21 03:51:15] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-21 03:51:16] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:51:16] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 3 ms to minimize.
[2024-05-21 03:51:16] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-05-21 03:51:16] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-21 03:51:16] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:51:16] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:51:17] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:51:17] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 4 ms to minimize.
[2024-05-21 03:51:18] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:51:18] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 2 ms to minimize.
[2024-05-21 03:51:18] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:51:18] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-21 03:51:18] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:51:18] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-21 03:51:19] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 03:51:19] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 03:51:19] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 3 ms to minimize.
[2024-05-21 03:51:19] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:51:19] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-21 03:51:20] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-21 03:51:21] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:51:22] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 03:51:22] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 4 ms to minimize.
[2024-05-21 03:51:22] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:51:22] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 4 ms to minimize.
[2024-05-21 03:51:23] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 4 ms to minimize.
[2024-05-21 03:51:23] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 4 ms to minimize.
[2024-05-21 03:51:23] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-05-21 03:51:23] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2024-05-21 03:51:23] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:51:23] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 4 ms to minimize.
[2024-05-21 03:51:24] [INFO ] Deduced a trap composed of 117 places in 152 ms of which 4 ms to minimize.
[2024-05-21 03:51:24] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:51:24] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 4 ms to minimize.
[2024-05-21 03:51:24] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 4 ms to minimize.
[2024-05-21 03:51:24] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 4 ms to minimize.
[2024-05-21 03:51:24] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 4 ms to minimize.
[2024-05-21 03:51:25] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 4 ms to minimize.
[2024-05-21 03:51:25] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-05-21 03:51:25] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 1)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 1)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 1)
(s475 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/958 variables, and 200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 160/160 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 485/574 places, 473/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61852 ms. Remains : 485/574 places, 473/572 transitions.
Support contains 80 out of 485 places after structural reductions.
[2024-05-21 03:51:26] [INFO ] Flatten gal took : 91 ms
[2024-05-21 03:51:26] [INFO ] Flatten gal took : 38 ms
[2024-05-21 03:51:26] [INFO ] Input system was already deterministic with 473 transitions.
Support contains 73 out of 485 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (137 resets) in 1684 ms. (23 steps per ms) remains 11/43 properties
BEST_FIRST walk for 40004 steps (12 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (12 resets) in 139 ms. (285 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (12 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 76 ms. (519 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
[2024-05-21 03:51:27] [INFO ] Invariant cache hit.
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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 275/290 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 166/456 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 29/485 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 473/958 variables, 485/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/958 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/958 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 958/958 variables, and 525 constraints, problems are : Problem set: 0 solved, 8 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 275/290 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 03:51:28] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 03:51:28] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 166/456 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 03:51:29] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 3 ms to minimize.
[2024-05-21 03:51:29] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
[2024-05-21 03:51:29] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 29/485 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 03:51:29] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 3 ms to minimize.
[2024-05-21 03:51:29] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:51:29] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-21 03:51:30] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 3 ms to minimize.
[2024-05-21 03:51:30] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:51:30] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 3 ms to minimize.
[2024-05-21 03:51:30] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 3 ms to minimize.
[2024-05-21 03:51:30] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-21 03:51:30] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:51:30] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 5 ms to minimize.
[2024-05-21 03:51:31] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-21 03:51:31] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 03:51:31] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-21 03:51:31] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-05-21 03:51:31] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:51:31] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 3 ms to minimize.
[2024-05-21 03:51:31] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 3 ms to minimize.
[2024-05-21 03:51:32] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 473/958 variables, 485/548 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/958 variables, 8/556 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 03:51:32] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:51:32] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 4 ms to minimize.
[2024-05-21 03:51:32] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
[2024-05-21 03:51:33] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:51:33] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:51:33] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-05-21 03:51:33] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 4 ms to minimize.
[2024-05-21 03:51:33] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 3 ms to minimize.
[2024-05-21 03:51:33] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 3 ms to minimize.
SMT process timed out in 5938ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 473/473 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 485 transition count 321
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 169 rules applied. Total rules applied 321 place count 333 transition count 304
Reduce places removed 8 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 15 rules applied. Total rules applied 336 place count 325 transition count 297
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 345 place count 318 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 346 place count 317 transition count 295
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 59 Pre rules applied. Total rules applied 346 place count 317 transition count 236
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 464 place count 258 transition count 236
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 480 place count 242 transition count 220
Iterating global reduction 5 with 16 rules applied. Total rules applied 496 place count 242 transition count 220
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 496 place count 242 transition count 212
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 512 place count 234 transition count 212
Performed 75 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 662 place count 159 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 663 place count 159 transition count 127
Free-agglomeration rule applied 24 times.
Iterating global reduction 5 with 24 rules applied. Total rules applied 687 place count 159 transition count 103
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 711 place count 135 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 712 place count 134 transition count 102
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 21 rules applied. Total rules applied 733 place count 120 transition count 95
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 9 rules applied. Total rules applied 742 place count 113 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 744 place count 111 transition count 93
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 744 place count 111 transition count 79
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 772 place count 97 transition count 79
Applied a total of 772 rules in 124 ms. Remains 97 /485 variables (removed 388) and now considering 79/473 (removed 394) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 97/485 places, 79/473 transitions.
RANDOM walk for 40000 steps (8 resets) in 469 ms. (85 steps per ms) remains 1/8 properties
BEST_FIRST walk for 10548 steps (2 resets) in 20 ms. (502 steps per ms) remains 0/1 properties
[2024-05-21 03:51:34] [INFO ] Flatten gal took : 29 ms
[2024-05-21 03:51:34] [INFO ] Flatten gal took : 32 ms
[2024-05-21 03:51:34] [INFO ] Input system was already deterministic with 473 transitions.
Computed a total of 135 stabilizing places and 135 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 463 transition count 451
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 463 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 463 transition count 450
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 454 transition count 441
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 454 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 452 transition count 439
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 452 transition count 439
Applied a total of 67 rules in 98 ms. Remains 452 /485 variables (removed 33) and now considering 439/473 (removed 34) transitions.
// Phase 1: matrix 439 rows 452 cols
[2024-05-21 03:51:34] [INFO ] Computed 40 invariants in 5 ms
[2024-05-21 03:51:34] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-21 03:51:34] [INFO ] Invariant cache hit.
[2024-05-21 03:51:35] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-05-21 03:51:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-21 03:51:43] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 5 ms to minimize.
[2024-05-21 03:51:43] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 7 ms to minimize.
[2024-05-21 03:51:44] [INFO ] Deduced a trap composed of 17 places in 346 ms of which 6 ms to minimize.
[2024-05-21 03:51:44] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 4 ms to minimize.
[2024-05-21 03:51:44] [INFO ] Deduced a trap composed of 69 places in 231 ms of which 4 ms to minimize.
[2024-05-21 03:51:45] [INFO ] Deduced a trap composed of 18 places in 287 ms of which 9 ms to minimize.
[2024-05-21 03:51:45] [INFO ] Deduced a trap composed of 74 places in 277 ms of which 4 ms to minimize.
[2024-05-21 03:51:45] [INFO ] Deduced a trap composed of 64 places in 217 ms of which 4 ms to minimize.
[2024-05-21 03:51:45] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 4 ms to minimize.
[2024-05-21 03:51:46] [INFO ] Deduced a trap composed of 74 places in 329 ms of which 5 ms to minimize.
[2024-05-21 03:51:46] [INFO ] Deduced a trap composed of 75 places in 271 ms of which 4 ms to minimize.
[2024-05-21 03:51:46] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 4 ms to minimize.
[2024-05-21 03:51:46] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 4 ms to minimize.
[2024-05-21 03:51:47] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 4 ms to minimize.
[2024-05-21 03:51:47] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 4 ms to minimize.
[2024-05-21 03:51:47] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 8 ms to minimize.
[2024-05-21 03:51:47] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:51:47] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:51:48] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 4 ms to minimize.
[2024-05-21 03:51:48] [INFO ] Deduced a trap composed of 71 places in 211 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-21 03:51:52] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 4 ms to minimize.
[2024-05-21 03:51:52] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-21 03:51:53] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2024-05-21 03:51:53] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 4 ms to minimize.
[2024-05-21 03:51:53] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-05-21 03:51:53] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 4 ms to minimize.
[2024-05-21 03:51:54] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-21 03:51:54] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 3 ms to minimize.
[2024-05-21 03:51:54] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 4 ms to minimize.
[2024-05-21 03:51:54] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:51:54] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-21 03:51:55] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 3 ms to minimize.
[2024-05-21 03:51:55] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:51:55] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-05-21 03:51:55] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:51:55] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 3 ms to minimize.
[2024-05-21 03:51:56] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
[2024-05-21 03:51:56] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:51:56] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:51:56] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-21 03:51:57] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 3 ms to minimize.
[2024-05-21 03:51:57] [INFO ] Deduced a trap composed of 72 places in 191 ms of which 4 ms to minimize.
[2024-05-21 03:51:57] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 4 ms to minimize.
[2024-05-21 03:51:57] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 4 ms to minimize.
[2024-05-21 03:51:58] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 3 ms to minimize.
[2024-05-21 03:51:58] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 4 ms to minimize.
[2024-05-21 03:51:58] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-05-21 03:51:58] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 4 ms to minimize.
[2024-05-21 03:51:59] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 3 ms to minimize.
[2024-05-21 03:51:59] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 2 ms to minimize.
[2024-05-21 03:51:59] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:51:59] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-21 03:51:59] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2024-05-21 03:52:00] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:52:00] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 3 ms to minimize.
[2024-05-21 03:52:00] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 03:52:00] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 3 ms to minimize.
[2024-05-21 03:52:00] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
[2024-05-21 03:52:02] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 4 ms to minimize.
[2024-05-21 03:52:02] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-21 03:52:03] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 3 ms to minimize.
[2024-05-21 03:52:03] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 4 ms to minimize.
[2024-05-21 03:52:03] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 3 ms to minimize.
[2024-05-21 03:52:04] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 7 ms to minimize.
[2024-05-21 03:52:04] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 4 ms to minimize.
[2024-05-21 03:52:04] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 4 ms to minimize.
[2024-05-21 03:52:04] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 3 ms to minimize.
[2024-05-21 03:52:04] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 4 ms to minimize.
[2024-05-21 03:52:04] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 4 ms to minimize.
[2024-05-21 03:52:05] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:52:05] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 4 ms to minimize.
SMT process timed out in 30167ms, After SMT, problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 30174ms
Starting structural reductions in LTL mode, iteration 1 : 452/485 places, 439/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30953 ms. Remains : 452/485 places, 439/473 transitions.
[2024-05-21 03:52:05] [INFO ] Flatten gal took : 23 ms
[2024-05-21 03:52:05] [INFO ] Flatten gal took : 24 ms
[2024-05-21 03:52:05] [INFO ] Input system was already deterministic with 439 transitions.
[2024-05-21 03:52:05] [INFO ] Flatten gal took : 24 ms
[2024-05-21 03:52:05] [INFO ] Flatten gal took : 25 ms
[2024-05-21 03:52:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality1153889264010570872.gal : 13 ms
[2024-05-21 03:52:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality18054803153119877628.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/CTLCardinality1153889264010570872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18054803153119877628.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-05-21 03:52:35] [INFO ] Flatten gal took : 23 ms
[2024-05-21 03:52:35] [INFO ] Applying decomposition
[2024-05-21 03:52:35] [INFO ] Flatten gal took : 20 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/graph14045889431870246265.txt' '-o' '/tmp/graph14045889431870246265.bin' '-w' '/tmp/graph14045889431870246265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14045889431870246265.bin' '-l' '-1' '-v' '-w' '/tmp/graph14045889431870246265.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:52:35] [INFO ] Decomposing Gal with order
[2024-05-21 03:52:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:52:35] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-21 03:52:35] [INFO ] Flatten gal took : 98 ms
[2024-05-21 03:52:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2024-05-21 03:52:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality9124513339753648124.gal : 15 ms
[2024-05-21 03:52:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality2375053965019316382.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/CTLCardinality9124513339753648124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2375053965019316382.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.15684e+32,7.609,199944,18623,19,382288,367,800,646328,43,737,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 484 transition count 304
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 191 rules applied. Total rules applied 359 place count 316 transition count 281
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 372 place count 304 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 373 place count 303 transition count 280
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 373 place count 303 transition count 220
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 493 place count 243 transition count 220
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 511 place count 225 transition count 202
Iterating global reduction 4 with 18 rules applied. Total rules applied 529 place count 225 transition count 202
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 529 place count 225 transition count 194
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 545 place count 217 transition count 194
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 683 place count 148 transition count 125
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 692 place count 148 transition count 116
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 710 place count 139 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 711 place count 138 transition count 106
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 12 rules applied. Total rules applied 723 place count 129 transition count 103
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 726 place count 126 transition count 103
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 726 place count 126 transition count 97
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 738 place count 120 transition count 97
Applied a total of 738 rules in 91 ms. Remains 120 /485 variables (removed 365) and now considering 97/473 (removed 376) transitions.
// Phase 1: matrix 97 rows 120 cols
[2024-05-21 03:53:06] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:53:06] [INFO ] Implicit Places using invariants in 143 ms returned [48, 68, 89, 93, 98, 110, 114, 119]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 146 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 112/485 places, 97/473 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 107 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 107 transition count 92
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 14 place count 105 transition count 90
Applied a total of 14 rules in 10 ms. Remains 105 /112 variables (removed 7) and now considering 90/97 (removed 7) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-21 03:53:06] [INFO ] Computed 23 invariants in 4 ms
[2024-05-21 03:53:06] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 03:53:06] [INFO ] Invariant cache hit.
[2024-05-21 03:53:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:53:06] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 105/485 places, 90/473 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 501 ms. Remains : 105/485 places, 90/473 transitions.
[2024-05-21 03:53:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:53:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:53:06] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-21 03:53:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:53:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:53:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality2462495079771807286.gal : 2 ms
[2024-05-21 03:53:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality16337041088892286982.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/CTLCardinality2462495079771807286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16337041088892286982.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.38879e+09,0.037034,4556,2,485,5,3539,6,0,503,4246,0


Converting to forward existential form...Done !
original formula: EF(EG(((p434==0)||(p534==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p434==0)||(p534==1)))] != FALSE
Hit Full ! (commute/partial/dont) 86/0/4
(forward)formula 0,1,0.156122,8516,1,0,8,27575,19,3,2470,10559,8
FORMULA AutoFlight-PT-06b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 167 place count 484 transition count 305
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 189 rules applied. Total rules applied 356 place count 317 transition count 283
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 369 place count 305 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 370 place count 304 transition count 282
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 370 place count 304 transition count 221
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 492 place count 243 transition count 221
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 510 place count 225 transition count 203
Iterating global reduction 4 with 18 rules applied. Total rules applied 528 place count 225 transition count 203
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 528 place count 225 transition count 195
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 544 place count 217 transition count 195
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 680 place count 149 transition count 127
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 689 place count 149 transition count 118
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 707 place count 140 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 708 place count 139 transition count 108
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 10 rules applied. Total rules applied 718 place count 131 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 720 place count 129 transition count 106
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 720 place count 129 transition count 100
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 732 place count 123 transition count 100
Applied a total of 732 rules in 78 ms. Remains 123 /485 variables (removed 362) and now considering 100/473 (removed 373) transitions.
// Phase 1: matrix 100 rows 123 cols
[2024-05-21 03:53:06] [INFO ] Computed 32 invariants in 1 ms
[2024-05-21 03:53:07] [INFO ] Implicit Places using invariants in 128 ms returned [73, 93, 97, 102, 107, 112, 117, 122]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 130 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 115/485 places, 100/473 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 109 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 109 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 107 transition count 92
Applied a total of 16 rules in 8 ms. Remains 107 /115 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 107 cols
[2024-05-21 03:53:07] [INFO ] Computed 24 invariants in 0 ms
[2024-05-21 03:53:07] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 03:53:07] [INFO ] Invariant cache hit.
[2024-05-21 03:53:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:53:07] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 107/485 places, 92/473 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 458 ms. Remains : 107/485 places, 92/473 transitions.
[2024-05-21 03:53:07] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:53:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:53:07] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-21 03:53:07] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:53:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:53:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4802624815993960679.gal : 1 ms
[2024-05-21 03:53:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17824582670474186410.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/CTLCardinality4802624815993960679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17824582670474186410.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.16965e+09,0.060765,5364,2,955,5,7122,6,0,513,9447,0


Converting to forward existential form...Done !
original formula: EG(AF((((p412==0)&&(p112==1))&&(p349==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((p412==0)&&(p112==1))&&(p349==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t89, t90, t91, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,0,15.9404,439628,1,0,510,2.56205e+06,211,249,2932,2.55083e+06,693
FORMULA AutoFlight-PT-06b-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 460 transition count 448
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 460 transition count 448
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 460 transition count 446
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 450 transition count 436
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 450 transition count 436
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 447 transition count 433
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 447 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 446 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 446 transition count 432
Applied a total of 80 rules in 89 ms. Remains 446 /485 variables (removed 39) and now considering 432/473 (removed 41) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 03:53:23] [INFO ] Computed 40 invariants in 4 ms
[2024-05-21 03:53:23] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 03:53:23] [INFO ] Invariant cache hit.
[2024-05-21 03:53:24] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 03:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 03:53:32] [INFO ] Deduced a trap composed of 23 places in 385 ms of which 5 ms to minimize.
[2024-05-21 03:53:32] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 5 ms to minimize.
[2024-05-21 03:53:33] [INFO ] Deduced a trap composed of 20 places in 299 ms of which 6 ms to minimize.
[2024-05-21 03:53:33] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 4 ms to minimize.
[2024-05-21 03:53:33] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 4 ms to minimize.
[2024-05-21 03:53:33] [INFO ] Deduced a trap composed of 70 places in 243 ms of which 6 ms to minimize.
[2024-05-21 03:53:34] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 5 ms to minimize.
[2024-05-21 03:53:34] [INFO ] Deduced a trap composed of 60 places in 243 ms of which 4 ms to minimize.
[2024-05-21 03:53:34] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-05-21 03:53:34] [INFO ] Deduced a trap composed of 69 places in 214 ms of which 4 ms to minimize.
[2024-05-21 03:53:35] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 4 ms to minimize.
[2024-05-21 03:53:35] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 4 ms to minimize.
[2024-05-21 03:53:35] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 4 ms to minimize.
[2024-05-21 03:53:35] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:53:36] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 4 ms to minimize.
[2024-05-21 03:53:36] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 4 ms to minimize.
[2024-05-21 03:53:36] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 4 ms to minimize.
[2024-05-21 03:53:36] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 4 ms to minimize.
[2024-05-21 03:53:37] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
[2024-05-21 03:53:37] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 03:53:41] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:53:41] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 4 ms to minimize.
[2024-05-21 03:53:42] [INFO ] Deduced a trap composed of 69 places in 184 ms of which 3 ms to minimize.
[2024-05-21 03:53:42] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 3 ms to minimize.
[2024-05-21 03:53:42] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 3 ms to minimize.
[2024-05-21 03:53:42] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 4 ms to minimize.
[2024-05-21 03:53:42] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-21 03:53:42] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:53:43] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-05-21 03:53:43] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 6 ms to minimize.
[2024-05-21 03:53:43] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 5 ms to minimize.
[2024-05-21 03:53:43] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 3 ms to minimize.
[2024-05-21 03:53:44] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-05-21 03:53:44] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-05-21 03:53:44] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-05-21 03:53:44] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 3 ms to minimize.
[2024-05-21 03:53:45] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 3 ms to minimize.
[2024-05-21 03:53:45] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 3 ms to minimize.
[2024-05-21 03:53:45] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:53:45] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 03:53:46] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 4 ms to minimize.
[2024-05-21 03:53:46] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-21 03:53:46] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-05-21 03:53:46] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-21 03:53:47] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-21 03:53:47] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-05-21 03:53:47] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 3 ms to minimize.
[2024-05-21 03:53:47] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:53:47] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 3 ms to minimize.
[2024-05-21 03:53:47] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:53:48] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 4 ms to minimize.
[2024-05-21 03:53:48] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:53:48] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-21 03:53:48] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 03:53:48] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 3 ms to minimize.
[2024-05-21 03:53:49] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-21 03:53:49] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:53:49] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:53:49] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:53:50] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 03:53:51] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:53:51] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:53:51] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:53:51] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:53:52] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 3 ms to minimize.
[2024-05-21 03:53:52] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 3 ms to minimize.
[2024-05-21 03:53:52] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 3 ms to minimize.
[2024-05-21 03:53:53] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/878 variables, and 108 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 68/108 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 03:53:59] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-05-21 03:53:59] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 3 ms to minimize.
[2024-05-21 03:53:59] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:54:00] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:54:00] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:54:00] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-21 03:54:00] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 3 ms to minimize.
[2024-05-21 03:54:01] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 3 ms to minimize.
[2024-05-21 03:54:01] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 3 ms to minimize.
[2024-05-21 03:54:01] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-21 03:54:01] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:54:01] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:54:01] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-21 03:54:01] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 03:54:02] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 03:54:03] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-21 03:54:03] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 3 ms to minimize.
[2024-05-21 03:54:03] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:54:04] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-05-21 03:54:04] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 03:54:05] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-05-21 03:54:05] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 5 ms to minimize.
[2024-05-21 03:54:06] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 4 ms to minimize.
[2024-05-21 03:54:07] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:54:08] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 03:54:10] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 3 ms to minimize.
[2024-05-21 03:54:10] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 3 ms to minimize.
[2024-05-21 03:54:10] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 3 ms to minimize.
[2024-05-21 03:54:10] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 3 ms to minimize.
[2024-05-21 03:54:11] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 03:54:16] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 4 ms to minimize.
[2024-05-21 03:54:16] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 03:54:21] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:54:21] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:54:21] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 3 ms to minimize.
[2024-05-21 03:54:22] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-21 03:54:22] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 3 ms to minimize.
[2024-05-21 03:54:22] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/878 variables, and 146 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 106/106 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 446/485 places, 432/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60848 ms. Remains : 446/485 places, 432/473 transitions.
[2024-05-21 03:54:24] [INFO ] Flatten gal took : 13 ms
[2024-05-21 03:54:24] [INFO ] Flatten gal took : 13 ms
[2024-05-21 03:54:24] [INFO ] Input system was already deterministic with 432 transitions.
[2024-05-21 03:54:24] [INFO ] Flatten gal took : 13 ms
[2024-05-21 03:54:24] [INFO ] Flatten gal took : 13 ms
[2024-05-21 03:54:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8741097983266750896.gal : 3 ms
[2024-05-21 03:54:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality15907437338633875523.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/CTLCardinality8741097983266750896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15907437338633875523.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-05-21 03:54:54] [INFO ] Flatten gal took : 14 ms
[2024-05-21 03:54:54] [INFO ] Applying decomposition
[2024-05-21 03:54:54] [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/graph5668466394326943592.txt' '-o' '/tmp/graph5668466394326943592.bin' '-w' '/tmp/graph5668466394326943592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5668466394326943592.bin' '-l' '-1' '-v' '-w' '/tmp/graph5668466394326943592.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:54:54] [INFO ] Decomposing Gal with order
[2024-05-21 03:54:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:54:54] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-21 03:54:54] [INFO ] Flatten gal took : 32 ms
[2024-05-21 03:54:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 03:54:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality5113427810425367406.gal : 6 ms
[2024-05-21 03:54:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality7466014192674755266.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/CTLCardinality5113427810425367406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7466014192674755266.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,6.3597e+32,2.46243,70268,9504,16,131856,314,742,206452,35,536,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t132, t142, t145, t155, t158, t181, t184, t222, t244, t281, t288, t303, t310, t417, t418, t41...999
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 485/485 places, 473/473 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 484 transition count 307
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 187 rules applied. Total rules applied 352 place count 319 transition count 285
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 365 place count 308 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 367 place count 306 transition count 283
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 367 place count 306 transition count 222
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 489 place count 245 transition count 222
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 508 place count 226 transition count 203
Iterating global reduction 4 with 19 rules applied. Total rules applied 527 place count 226 transition count 203
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 527 place count 226 transition count 195
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 543 place count 218 transition count 195
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 677 place count 151 transition count 128
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 686 place count 151 transition count 119
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 704 place count 142 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 705 place count 141 transition count 109
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 10 rules applied. Total rules applied 715 place count 133 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 717 place count 131 transition count 107
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 717 place count 131 transition count 101
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 729 place count 125 transition count 101
Applied a total of 729 rules in 48 ms. Remains 125 /485 variables (removed 360) and now considering 101/473 (removed 372) transitions.
// Phase 1: matrix 101 rows 125 cols
[2024-05-21 03:55:24] [INFO ] Computed 32 invariants in 1 ms
[2024-05-21 03:55:24] [INFO ] Implicit Places using invariants in 113 ms returned [53, 73, 93, 98, 103, 108, 119, 124]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 122 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 117/485 places, 101/473 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 110 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 110 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 109 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 109 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 108 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 108 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 107 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 107 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 106 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 106 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 105 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 105 transition count 89
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 28 place count 103 transition count 87
Applied a total of 28 rules in 21 ms. Remains 103 /117 variables (removed 14) and now considering 87/101 (removed 14) transitions.
// Phase 1: matrix 87 rows 103 cols
[2024-05-21 03:55:24] [INFO ] Computed 24 invariants in 0 ms
[2024-05-21 03:55:24] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 03:55:24] [INFO ] Invariant cache hit.
[2024-05-21 03:55:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:55:25] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 103/485 places, 87/473 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 460 ms. Remains : 103/485 places, 87/473 transitions.
[2024-05-21 03:55:25] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:55:25] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:55:25] [INFO ] Input system was already deterministic with 87 transitions.
[2024-05-21 03:55:25] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:55:25] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:55:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality7918930367249476766.gal : 1 ms
[2024-05-21 03:55:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality69226520947856739.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/CTLCardinality7918930367249476766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality69226520947856739.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 -...281
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.83459e+10,0.038035,4540,2,532,5,3927,6,0,492,4629,0


Converting to forward existential form...Done !
original formula: E(EF(!(AF(((p80==0)||(p549==1))))) U (p277==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(!(EG(!(((p80==0)||(p549==1)))))))) * (p277==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t83, t84, t85, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,1,5.50444,163336,1,0,486,911262,207,288,2925,1.14312e+06,655
FORMULA AutoFlight-PT-06b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 461 transition count 449
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 461 transition count 449
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 461 transition count 447
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 451 transition count 437
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 451 transition count 437
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 448 transition count 434
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 448 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 447 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 447 transition count 433
Applied a total of 78 rules in 50 ms. Remains 447 /485 variables (removed 38) and now considering 433/473 (removed 40) transitions.
// Phase 1: matrix 433 rows 447 cols
[2024-05-21 03:55:30] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 03:55:30] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-21 03:55:30] [INFO ] Invariant cache hit.
[2024-05-21 03:55:31] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-05-21 03:55:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 03:55:39] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 3 ms to minimize.
[2024-05-21 03:55:39] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:55:39] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 4 ms to minimize.
[2024-05-21 03:55:39] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 2 ms to minimize.
[2024-05-21 03:55:39] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 03:55:40] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 3 ms to minimize.
[2024-05-21 03:55:40] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-21 03:55:40] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-05-21 03:55:40] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 2 ms to minimize.
[2024-05-21 03:55:40] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-05-21 03:55:40] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 4 ms to minimize.
[2024-05-21 03:55:41] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 3 ms to minimize.
[2024-05-21 03:55:41] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:55:41] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 3 ms to minimize.
[2024-05-21 03:55:41] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 6 ms to minimize.
[2024-05-21 03:55:42] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 4 ms to minimize.
[2024-05-21 03:55:42] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 4 ms to minimize.
[2024-05-21 03:55:42] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-21 03:55:42] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 3 ms to minimize.
[2024-05-21 03:55:42] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 03:55:47] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 4 ms to minimize.
[2024-05-21 03:55:47] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 4 ms to minimize.
[2024-05-21 03:55:47] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 4 ms to minimize.
[2024-05-21 03:55:48] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 3 ms to minimize.
[2024-05-21 03:55:48] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-21 03:55:49] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 4 ms to minimize.
[2024-05-21 03:55:49] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 3 ms to minimize.
[2024-05-21 03:55:49] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 3 ms to minimize.
[2024-05-21 03:55:50] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-05-21 03:55:51] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-21 03:55:51] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
[2024-05-21 03:55:51] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 3 ms to minimize.
[2024-05-21 03:55:51] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-21 03:55:52] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 03:55:54] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 4 ms to minimize.
[2024-05-21 03:55:54] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 4 ms to minimize.
[2024-05-21 03:55:54] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 4 ms to minimize.
[2024-05-21 03:55:54] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 4 ms to minimize.
[2024-05-21 03:55:55] [INFO ] Deduced a trap composed of 90 places in 228 ms of which 4 ms to minimize.
[2024-05-21 03:55:55] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 4 ms to minimize.
[2024-05-21 03:55:55] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 4 ms to minimize.
[2024-05-21 03:55:55] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:55:56] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 3 ms to minimize.
[2024-05-21 03:55:56] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 3 ms to minimize.
[2024-05-21 03:55:56] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 4 ms to minimize.
[2024-05-21 03:55:57] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 3 ms to minimize.
[2024-05-21 03:55:57] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:55:59] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/880 variables, and 88 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 48/88 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 03:56:06] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
[2024-05-21 03:56:06] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2024-05-21 03:56:06] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 4 ms to minimize.
[2024-05-21 03:56:06] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 4 ms to minimize.
[2024-05-21 03:56:07] [INFO ] Deduced a trap composed of 79 places in 255 ms of which 5 ms to minimize.
[2024-05-21 03:56:07] [INFO ] Deduced a trap composed of 77 places in 254 ms of which 4 ms to minimize.
[2024-05-21 03:56:07] [INFO ] Deduced a trap composed of 85 places in 180 ms of which 4 ms to minimize.
[2024-05-21 03:56:07] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 3 ms to minimize.
[2024-05-21 03:56:07] [INFO ] Deduced a trap composed of 87 places in 168 ms of which 3 ms to minimize.
[2024-05-21 03:56:08] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
[2024-05-21 03:56:08] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 4 ms to minimize.
[2024-05-21 03:56:08] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:56:08] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-21 03:56:08] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-21 03:56:09] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 3 ms to minimize.
[2024-05-21 03:56:09] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-05-21 03:56:09] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-21 03:56:09] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:56:09] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 3 ms to minimize.
[2024-05-21 03:56:09] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 03:56:10] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 3 ms to minimize.
[2024-05-21 03:56:10] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-21 03:56:10] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 3 ms to minimize.
[2024-05-21 03:56:10] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:56:10] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-21 03:56:10] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-21 03:56:11] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-21 03:56:11] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-05-21 03:56:11] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-21 03:56:11] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:56:12] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 3 ms to minimize.
[2024-05-21 03:56:12] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-05-21 03:56:13] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 3 ms to minimize.
[2024-05-21 03:56:14] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:56:14] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:56:14] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 16/124 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 03:56:17] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 4 ms to minimize.
[2024-05-21 03:56:18] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 03:56:22] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 4 ms to minimize.
[2024-05-21 03:56:23] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-05-21 03:56:23] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 2 ms to minimize.
[2024-05-21 03:56:23] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 03:56:24] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 03:56:24] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 03:56:29] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)timeout

(s161 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/880 variables, and 133 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 0/432 constraints, Known Traps: 93/93 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 447/485 places, 433/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60833 ms. Remains : 447/485 places, 433/473 transitions.
[2024-05-21 03:56:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 03:56:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 03:56:31] [INFO ] Input system was already deterministic with 433 transitions.
[2024-05-21 03:56:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 03:56:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 03:56:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4387998345374442492.gal : 3 ms
[2024-05-21 03:56:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality15197935619746075267.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/CTLCardinality4387998345374442492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15197935619746075267.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-05-21 03:57:01] [INFO ] Flatten gal took : 12 ms
[2024-05-21 03:57:01] [INFO ] Applying decomposition
[2024-05-21 03:57:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5732555780974578470.txt' '-o' '/tmp/graph5732555780974578470.bin' '-w' '/tmp/graph5732555780974578470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5732555780974578470.bin' '-l' '-1' '-v' '-w' '/tmp/graph5732555780974578470.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:57:01] [INFO ] Decomposing Gal with order
[2024-05-21 03:57:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:57:01] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-21 03:57:01] [INFO ] Flatten gal took : 30 ms
[2024-05-21 03:57:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 03:57:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality2474722366346169865.gal : 6 ms
[2024-05-21 03:57:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14672589832287366576.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/CTLCardinality2474722366346169865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14672589832287366576.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.3597e+32,2.44091,60972,14627,14,117347,266,767,153504,30,507,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 465 transition count 453
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 465 transition count 453
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 465 transition count 451
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 457 transition count 443
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 457 transition count 443
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 456 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 456 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 455 transition count 441
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 455 transition count 441
Applied a total of 62 rules in 52 ms. Remains 455 /485 variables (removed 30) and now considering 441/473 (removed 32) transitions.
// Phase 1: matrix 441 rows 455 cols
[2024-05-21 03:57:31] [INFO ] Computed 40 invariants in 4 ms
[2024-05-21 03:57:32] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 03:57:32] [INFO ] Invariant cache hit.
[2024-05-21 03:57:32] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2024-05-21 03:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:57:40] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 5 ms to minimize.
[2024-05-21 03:57:41] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 4 ms to minimize.
[2024-05-21 03:57:41] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 4 ms to minimize.
[2024-05-21 03:57:41] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 3 ms to minimize.
[2024-05-21 03:57:41] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 3 ms to minimize.
[2024-05-21 03:57:42] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 4 ms to minimize.
[2024-05-21 03:57:42] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 4 ms to minimize.
[2024-05-21 03:57:42] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 4 ms to minimize.
[2024-05-21 03:57:42] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 3 ms to minimize.
[2024-05-21 03:57:43] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 3 ms to minimize.
[2024-05-21 03:57:43] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 3 ms to minimize.
[2024-05-21 03:57:43] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 4 ms to minimize.
[2024-05-21 03:57:43] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 3 ms to minimize.
[2024-05-21 03:57:43] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-05-21 03:57:44] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 4 ms to minimize.
[2024-05-21 03:57:44] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 4 ms to minimize.
[2024-05-21 03:57:44] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2024-05-21 03:57:44] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2024-05-21 03:57:45] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-05-21 03:57:45] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:57:49] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 4 ms to minimize.
[2024-05-21 03:57:50] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 3 ms to minimize.
[2024-05-21 03:57:50] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 3 ms to minimize.
[2024-05-21 03:57:51] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 4 ms to minimize.
[2024-05-21 03:57:51] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 4 ms to minimize.
[2024-05-21 03:57:52] [INFO ] Deduced a trap composed of 70 places in 234 ms of which 4 ms to minimize.
[2024-05-21 03:57:52] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-05-21 03:57:52] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 4 ms to minimize.
[2024-05-21 03:57:53] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 4 ms to minimize.
[2024-05-21 03:57:53] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 3 ms to minimize.
[2024-05-21 03:57:54] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-05-21 03:57:54] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:57:56] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 5 ms to minimize.
[2024-05-21 03:57:56] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 4 ms to minimize.
[2024-05-21 03:57:57] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 4 ms to minimize.
[2024-05-21 03:57:57] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 4 ms to minimize.
[2024-05-21 03:57:57] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 4 ms to minimize.
[2024-05-21 03:57:58] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 4 ms to minimize.
[2024-05-21 03:57:58] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-05-21 03:57:58] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 3 ms to minimize.
[2024-05-21 03:57:58] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
[2024-05-21 03:57:58] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-05-21 03:57:59] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 3 ms to minimize.
[2024-05-21 03:57:59] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 4 ms to minimize.
[2024-05-21 03:57:59] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:57:59] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 3 ms to minimize.
[2024-05-21 03:57:59] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:58:00] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:58:00] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 3 ms to minimize.
[2024-05-21 03:58:00] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 4 ms to minimize.
[2024-05-21 03:58:00] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:58:00] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:58:01] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-21 03:58:01] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 3 ms to minimize.
[2024-05-21 03:58:01] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:58:02] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 3 ms to minimize.
[2024-05-21 03:58:02] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-21 03:58:02] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:58:02] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
SMT process timed out in 30097ms, After SMT, problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 30103ms
Starting structural reductions in LTL mode, iteration 1 : 455/485 places, 441/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30884 ms. Remains : 455/485 places, 441/473 transitions.
[2024-05-21 03:58:02] [INFO ] Flatten gal took : 10 ms
[2024-05-21 03:58:02] [INFO ] Flatten gal took : 10 ms
[2024-05-21 03:58:02] [INFO ] Input system was already deterministic with 441 transitions.
[2024-05-21 03:58:02] [INFO ] Flatten gal took : 10 ms
[2024-05-21 03:58:02] [INFO ] Flatten gal took : 10 ms
[2024-05-21 03:58:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality7163549306315614722.gal : 3 ms
[2024-05-21 03:58:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality3544634428889693664.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/CTLCardinality7163549306315614722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3544634428889693664.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-05-21 03:58:32] [INFO ] Flatten gal took : 10 ms
[2024-05-21 03:58:32] [INFO ] Applying decomposition
[2024-05-21 03:58:32] [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/graph10435005166733413535.txt' '-o' '/tmp/graph10435005166733413535.bin' '-w' '/tmp/graph10435005166733413535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10435005166733413535.bin' '-l' '-1' '-v' '-w' '/tmp/graph10435005166733413535.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:58:32] [INFO ] Decomposing Gal with order
[2024-05-21 03:58:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:58:32] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-21 03:58:32] [INFO ] Flatten gal took : 28 ms
[2024-05-21 03:58:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 03:58:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality2539289934787666859.gal : 6 ms
[2024-05-21 03:58:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality11215538926724449255.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/CTLCardinality2539289934787666859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11215538926724449255.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,7.61166e+32,17.0849,393160,35609,23,700207,371,739,1.44427e+06,42,796,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 464 transition count 452
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 464 transition count 452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 464 transition count 450
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 457 transition count 443
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 457 transition count 443
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 456 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 456 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 455 transition count 441
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 455 transition count 441
Applied a total of 62 rules in 49 ms. Remains 455 /485 variables (removed 30) and now considering 441/473 (removed 32) transitions.
// Phase 1: matrix 441 rows 455 cols
[2024-05-21 03:59:03] [INFO ] Computed 40 invariants in 4 ms
[2024-05-21 03:59:03] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 03:59:03] [INFO ] Invariant cache hit.
[2024-05-21 03:59:03] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2024-05-21 03:59:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:59:12] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 5 ms to minimize.
[2024-05-21 03:59:12] [INFO ] Deduced a trap composed of 70 places in 283 ms of which 4 ms to minimize.
[2024-05-21 03:59:12] [INFO ] Deduced a trap composed of 74 places in 261 ms of which 4 ms to minimize.
[2024-05-21 03:59:12] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 5 ms to minimize.
[2024-05-21 03:59:13] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 4 ms to minimize.
[2024-05-21 03:59:13] [INFO ] Deduced a trap composed of 59 places in 267 ms of which 6 ms to minimize.
[2024-05-21 03:59:13] [INFO ] Deduced a trap composed of 22 places in 335 ms of which 6 ms to minimize.
[2024-05-21 03:59:14] [INFO ] Deduced a trap composed of 61 places in 226 ms of which 4 ms to minimize.
[2024-05-21 03:59:14] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 4 ms to minimize.
[2024-05-21 03:59:14] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 4 ms to minimize.
[2024-05-21 03:59:14] [INFO ] Deduced a trap composed of 72 places in 228 ms of which 4 ms to minimize.
[2024-05-21 03:59:15] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 6 ms to minimize.
[2024-05-21 03:59:15] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 4 ms to minimize.
[2024-05-21 03:59:15] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 4 ms to minimize.
[2024-05-21 03:59:15] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 3 ms to minimize.
[2024-05-21 03:59:16] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 5 ms to minimize.
[2024-05-21 03:59:16] [INFO ] Deduced a trap composed of 75 places in 285 ms of which 5 ms to minimize.
[2024-05-21 03:59:16] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 4 ms to minimize.
[2024-05-21 03:59:16] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 4 ms to minimize.
[2024-05-21 03:59:16] [INFO ] Deduced a trap composed of 75 places in 204 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:59:21] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 3 ms to minimize.
[2024-05-21 03:59:21] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 3 ms to minimize.
[2024-05-21 03:59:21] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 3 ms to minimize.
[2024-05-21 03:59:21] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 3 ms to minimize.
[2024-05-21 03:59:22] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 5 ms to minimize.
[2024-05-21 03:59:22] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 3 ms to minimize.
[2024-05-21 03:59:22] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 4 ms to minimize.
[2024-05-21 03:59:22] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 4 ms to minimize.
[2024-05-21 03:59:22] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
[2024-05-21 03:59:23] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 4 ms to minimize.
[2024-05-21 03:59:23] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 4 ms to minimize.
[2024-05-21 03:59:23] [INFO ] Deduced a trap composed of 83 places in 160 ms of which 3 ms to minimize.
[2024-05-21 03:59:23] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 3 ms to minimize.
[2024-05-21 03:59:23] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 4 ms to minimize.
[2024-05-21 03:59:23] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:59:24] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 4 ms to minimize.
[2024-05-21 03:59:24] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 4 ms to minimize.
[2024-05-21 03:59:24] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:59:25] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 4 ms to minimize.
[2024-05-21 03:59:26] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:59:26] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:59:27] [INFO ] Deduced a trap composed of 55 places in 233 ms of which 4 ms to minimize.
[2024-05-21 03:59:27] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 4 ms to minimize.
[2024-05-21 03:59:28] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-21 03:59:28] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 3 ms to minimize.
[2024-05-21 03:59:29] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-21 03:59:29] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 03:59:29] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-21 03:59:30] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 3 ms to minimize.
[2024-05-21 03:59:30] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-21 03:59:30] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-05-21 03:59:30] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 3 ms to minimize.
[2024-05-21 03:59:30] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
[2024-05-21 03:59:31] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:59:31] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-21 03:59:32] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-21 03:59:32] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-05-21 03:59:32] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:59:32] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 2 ms to minimize.
[2024-05-21 03:59:32] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:59:33] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/896 variables, and 101 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 61/101 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:59:39] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 3 ms to minimize.
[2024-05-21 03:59:39] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-05-21 03:59:39] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 3 ms to minimize.
[2024-05-21 03:59:40] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 3 ms to minimize.
[2024-05-21 03:59:40] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:59:40] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 3 ms to minimize.
[2024-05-21 03:59:40] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-05-21 03:59:40] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:59:40] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:59:41] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:59:41] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-05-21 03:59:41] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:59:41] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-05-21 03:59:41] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-21 03:59:41] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-05-21 03:59:41] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-21 03:59:41] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 2 ms to minimize.
[2024-05-21 03:59:42] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-05-21 03:59:42] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:59:42] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:59:43] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-05-21 03:59:43] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-21 03:59:43] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 3 ms to minimize.
[2024-05-21 03:59:43] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:59:44] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 4 ms to minimize.
[2024-05-21 03:59:44] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-21 03:59:44] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 3 ms to minimize.
[2024-05-21 03:59:44] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-21 03:59:45] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:59:45] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-05-21 03:59:45] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:59:45] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-21 03:59:45] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-05-21 03:59:45] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 3 ms to minimize.
[2024-05-21 03:59:45] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 3 ms to minimize.
[2024-05-21 03:59:45] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 3 ms to minimize.
[2024-05-21 03:59:46] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-05-21 03:59:46] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 03:59:46] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:59:46] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:59:47] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:59:47] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
[2024-05-21 03:59:47] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-21 03:59:48] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-21 03:59:48] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-21 03:59:48] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-21 03:59:49] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 3 ms to minimize.
[2024-05-21 03:59:49] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 3 ms to minimize.
[2024-05-21 03:59:51] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 3 ms to minimize.
[2024-05-21 03:59:51] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 03:59:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
[2024-05-21 03:59:54] [INFO ] Deduced a trap composed of 115 places in 106 ms of which 3 ms to minimize.
[2024-05-21 03:59:54] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-05-21 03:59:55] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:59:55] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-05-21 03:59:55] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:59:55] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 3 ms to minimize.
[2024-05-21 03:59:55] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 3 ms to minimize.
[2024-05-21 03:59:56] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 4 ms to minimize.
[2024-05-21 03:59:57] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 10/161 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-21 04:00:00] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-05-21 04:00:00] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 3 ms to minimize.
[2024-05-21 04:00:01] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-21 04:00:01] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 3 ms to minimize.
[2024-05-21 04:00:01] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 3 ms to minimize.
[2024-05-21 04:00:01] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-21 04:00:01] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 13 ms to minimize.
[2024-05-21 04:00:02] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-21 04:00:03] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
[2024-05-21 04:00:03] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/896 variables, and 171 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 0/440 constraints, Known Traps: 131/131 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 455/485 places, 441/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60829 ms. Remains : 455/485 places, 441/473 transitions.
[2024-05-21 04:00:03] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:00:03] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:00:03] [INFO ] Input system was already deterministic with 441 transitions.
[2024-05-21 04:00:03] [INFO ] Flatten gal took : 11 ms
[2024-05-21 04:00:03] [INFO ] Flatten gal took : 11 ms
[2024-05-21 04:00:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality484006057195276951.gal : 3 ms
[2024-05-21 04:00:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15190073006706067599.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/CTLCardinality484006057195276951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15190073006706067599.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-05-21 04:00:34] [INFO ] Flatten gal took : 13 ms
[2024-05-21 04:00:34] [INFO ] Applying decomposition
[2024-05-21 04:00:34] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7792303706159922606.txt' '-o' '/tmp/graph7792303706159922606.bin' '-w' '/tmp/graph7792303706159922606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7792303706159922606.bin' '-l' '-1' '-v' '-w' '/tmp/graph7792303706159922606.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:00:34] [INFO ] Decomposing Gal with order
[2024-05-21 04:00:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:00:34] [INFO ] Removed a total of 86 redundant transitions.
[2024-05-21 04:00:34] [INFO ] Flatten gal took : 26 ms
[2024-05-21 04:00:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 04:00:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality14937545860733529064.gal : 5 ms
[2024-05-21 04:00:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality9073165299507046209.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/CTLCardinality14937545860733529064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9073165299507046209.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,7.42838e+32,5.32132,128892,9900,19,250302,299,726,383567,37,597,0


Converting to forward existential form...Done !
original formula: EG((EG(AF((((i27.u1.p3==0)||(i7.u31.p98==1))&&(i9.u64.p225==1)))) * AX(AF((AX((i23.u169.p518==1)) * ((i2.u27.p88==0)||(i0.u86.p301==1))))...158
=> equivalent forward existential formula: [FwdG(Init,(EG(!(EG(!((((i27.u1.p3==0)||(i7.u31.p98==1))&&(i9.u64.p225==1)))))) * !(EX(!(!(EG(!((!(EX(!((i23.u16...225
Reverse transition relation is NOT exact ! Due to transitions t132, t135, t158, t161, t171, t198, t201, t226, t244, t251, t273, t295, t319, t334, t426, t42...1021
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 485/485 places, 473/473 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 167 place count 484 transition count 305
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 190 rules applied. Total rules applied 357 place count 317 transition count 282
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 370 place count 305 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 304 transition count 281
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 371 place count 304 transition count 220
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 493 place count 243 transition count 220
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 511 place count 225 transition count 202
Iterating global reduction 4 with 18 rules applied. Total rules applied 529 place count 225 transition count 202
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 529 place count 225 transition count 194
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 545 place count 217 transition count 194
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 683 place count 148 transition count 125
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 692 place count 148 transition count 116
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 710 place count 139 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 711 place count 138 transition count 106
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 12 rules applied. Total rules applied 723 place count 129 transition count 103
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 726 place count 126 transition count 103
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 726 place count 126 transition count 97
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 738 place count 120 transition count 97
Applied a total of 738 rules in 44 ms. Remains 120 /485 variables (removed 365) and now considering 97/473 (removed 376) transitions.
// Phase 1: matrix 97 rows 120 cols
[2024-05-21 04:01:04] [INFO ] Computed 31 invariants in 0 ms
[2024-05-21 04:01:04] [INFO ] Implicit Places using invariants in 111 ms returned [71, 91, 95, 100, 105, 110, 114, 119]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 112 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 112/485 places, 97/473 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 106 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 106 transition count 91
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 16 place count 104 transition count 89
Applied a total of 16 rules in 6 ms. Remains 104 /112 variables (removed 8) and now considering 89/97 (removed 8) transitions.
// Phase 1: matrix 89 rows 104 cols
[2024-05-21 04:01:04] [INFO ] Computed 23 invariants in 1 ms
[2024-05-21 04:01:04] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 04:01:04] [INFO ] Invariant cache hit.
[2024-05-21 04:01:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 04:01:04] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 104/485 places, 89/473 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 434 ms. Remains : 104/485 places, 89/473 transitions.
[2024-05-21 04:01:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 04:01:04] [INFO ] Flatten gal took : 3 ms
[2024-05-21 04:01:04] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-21 04:01:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 04:01:04] [INFO ] Flatten gal took : 3 ms
[2024-05-21 04:01:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality8574663492660714101.gal : 1 ms
[2024-05-21 04:01:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality13509639627586134632.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/CTLCardinality8574663492660714101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13509639627586134632.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.53541e+09,0.045379,4816,2,619,5,4314,6,0,498,5736,0


Converting to forward existential form...Done !
original formula: EG(((p430==0)||(p174==1)))
=> equivalent forward existential formula: [FwdG(Init,((p430==0)||(p174==1)))] != FALSE
Hit Full ! (commute/partial/dont) 85/0/4
(forward)formula 0,1,0.263918,11416,1,0,8,40157,19,4,2441,27901,8
FORMULA AutoFlight-PT-06b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 462 transition count 450
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 462 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 462 transition count 448
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 452 transition count 438
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 452 transition count 438
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 449 transition count 435
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 449 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 448 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 448 transition count 434
Applied a total of 76 rules in 49 ms. Remains 448 /485 variables (removed 37) and now considering 434/473 (removed 39) transitions.
// Phase 1: matrix 434 rows 448 cols
[2024-05-21 04:01:04] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 04:01:05] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 04:01:05] [INFO ] Invariant cache hit.
[2024-05-21 04:01:05] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-21 04:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:01:14] [INFO ] Deduced a trap composed of 67 places in 299 ms of which 5 ms to minimize.
[2024-05-21 04:01:14] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 4 ms to minimize.
[2024-05-21 04:01:14] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 4 ms to minimize.
[2024-05-21 04:01:15] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 4 ms to minimize.
[2024-05-21 04:01:15] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 4 ms to minimize.
[2024-05-21 04:01:15] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 4 ms to minimize.
[2024-05-21 04:01:15] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
[2024-05-21 04:01:16] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 3 ms to minimize.
[2024-05-21 04:01:16] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 4 ms to minimize.
[2024-05-21 04:01:16] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-21 04:01:16] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 4 ms to minimize.
[2024-05-21 04:01:17] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 4 ms to minimize.
[2024-05-21 04:01:17] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 4 ms to minimize.
[2024-05-21 04:01:17] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 4 ms to minimize.
[2024-05-21 04:01:18] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
[2024-05-21 04:01:18] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 3 ms to minimize.
[2024-05-21 04:01:19] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-21 04:01:20] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-21 04:01:20] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:01:29] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:01:31] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 4 ms to minimize.
[2024-05-21 04:01:31] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 4 ms to minimize.
[2024-05-21 04:01:31] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 3 ms to minimize.
[2024-05-21 04:01:31] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 4 ms to minimize.
[2024-05-21 04:01:31] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 4 ms to minimize.
[2024-05-21 04:01:32] [INFO ] Deduced a trap composed of 72 places in 295 ms of which 6 ms to minimize.
[2024-05-21 04:01:32] [INFO ] Deduced a trap composed of 80 places in 230 ms of which 3 ms to minimize.
[2024-05-21 04:01:32] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-05-21 04:01:33] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 4 ms to minimize.
[2024-05-21 04:01:33] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 3 ms to minimize.
[2024-05-21 04:01:34] [INFO ] Deduced a trap composed of 71 places in 158 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/882 variables, and 71 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:01:40] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 3 ms to minimize.
[2024-05-21 04:01:40] [INFO ] Deduced a trap composed of 78 places in 176 ms of which 3 ms to minimize.
[2024-05-21 04:01:40] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 4 ms to minimize.
[2024-05-21 04:01:41] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 4 ms to minimize.
[2024-05-21 04:01:41] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 4 ms to minimize.
[2024-05-21 04:01:41] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 4 ms to minimize.
[2024-05-21 04:01:41] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
[2024-05-21 04:01:41] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-05-21 04:01:41] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 3 ms to minimize.
[2024-05-21 04:01:42] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 3 ms to minimize.
[2024-05-21 04:01:42] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
[2024-05-21 04:01:42] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-05-21 04:01:42] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 4 ms to minimize.
[2024-05-21 04:01:42] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 4 ms to minimize.
[2024-05-21 04:01:42] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
[2024-05-21 04:01:42] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 4 ms to minimize.
[2024-05-21 04:01:43] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-05-21 04:01:43] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 3 ms to minimize.
[2024-05-21 04:01:43] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 3 ms to minimize.
[2024-05-21 04:01:43] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:01:44] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-05-21 04:01:44] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 04:01:44] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-05-21 04:01:44] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-21 04:01:44] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-05-21 04:01:44] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-21 04:01:45] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 3 ms to minimize.
[2024-05-21 04:01:45] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-21 04:01:45] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-21 04:01:46] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-21 04:01:46] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 3 ms to minimize.
[2024-05-21 04:01:46] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 04:01:46] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-21 04:01:46] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 3 ms to minimize.
[2024-05-21 04:01:46] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 04:01:46] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-05-21 04:01:47] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:01:50] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-05-21 04:01:51] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 4 ms to minimize.
[2024-05-21 04:01:51] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-21 04:01:51] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
[2024-05-21 04:01:51] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 3 ms to minimize.
[2024-05-21 04:01:51] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 3 ms to minimize.
[2024-05-21 04:01:52] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-21 04:01:52] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 3 ms to minimize.
[2024-05-21 04:01:52] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-05-21 04:01:52] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-21 04:01:52] [INFO ] Deduced a trap composed of 61 places in 242 ms of which 4 ms to minimize.
[2024-05-21 04:01:53] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 3 ms to minimize.
[2024-05-21 04:01:53] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-05-21 04:01:53] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 3 ms to minimize.
[2024-05-21 04:01:53] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-21 04:01:53] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 04:01:55] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 3 ms to minimize.
[2024-05-21 04:01:55] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 3 ms to minimize.
[2024-05-21 04:01:56] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 19/127 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:01:58] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 4 ms to minimize.
[2024-05-21 04:01:58] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 04:01:58] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-21 04:01:59] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:02:03] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-21 04:02:03] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/882 variables, and 133 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 0/433 constraints, Known Traps: 93/93 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 448/485 places, 434/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60909 ms. Remains : 448/485 places, 434/473 transitions.
[2024-05-21 04:02:05] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:02:05] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:02:05] [INFO ] Input system was already deterministic with 434 transitions.
[2024-05-21 04:02:05] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:02:05] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:02:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2676970950147886086.gal : 2 ms
[2024-05-21 04:02:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9706326215039514793.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/CTLCardinality2676970950147886086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9706326215039514793.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-05-21 04:02:35] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:02:35] [INFO ] Applying decomposition
[2024-05-21 04:02:35] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12537981262107179521.txt' '-o' '/tmp/graph12537981262107179521.bin' '-w' '/tmp/graph12537981262107179521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12537981262107179521.bin' '-l' '-1' '-v' '-w' '/tmp/graph12537981262107179521.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:02:36] [INFO ] Decomposing Gal with order
[2024-05-21 04:02:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:02:36] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-21 04:02:36] [INFO ] Flatten gal took : 33 ms
[2024-05-21 04:02:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 04:02:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality10873595437067487862.gal : 5 ms
[2024-05-21 04:02:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality9760284477971516690.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/CTLCardinality10873595437067487862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9760284477971516690.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.59493e+32,13.5239,320828,21516,21,596318,329,743,1.08299e+06,40,682,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 460 transition count 448
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 460 transition count 448
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 460 transition count 446
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 450 transition count 436
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 450 transition count 436
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 447 transition count 433
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 447 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 446 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 446 transition count 432
Applied a total of 80 rules in 50 ms. Remains 446 /485 variables (removed 39) and now considering 432/473 (removed 41) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 04:03:06] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 04:03:06] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 04:03:06] [INFO ] Invariant cache hit.
[2024-05-21 04:03:06] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 04:03:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 04:03:15] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 5 ms to minimize.
[2024-05-21 04:03:15] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 5 ms to minimize.
[2024-05-21 04:03:15] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 4 ms to minimize.
[2024-05-21 04:03:16] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 4 ms to minimize.
[2024-05-21 04:03:16] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 6 ms to minimize.
[2024-05-21 04:03:16] [INFO ] Deduced a trap composed of 70 places in 328 ms of which 6 ms to minimize.
[2024-05-21 04:03:17] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 4 ms to minimize.
[2024-05-21 04:03:17] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 4 ms to minimize.
[2024-05-21 04:03:17] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 6 ms to minimize.
[2024-05-21 04:03:17] [INFO ] Deduced a trap composed of 69 places in 302 ms of which 4 ms to minimize.
[2024-05-21 04:03:18] [INFO ] Deduced a trap composed of 68 places in 204 ms of which 4 ms to minimize.
[2024-05-21 04:03:18] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 4 ms to minimize.
[2024-05-21 04:03:18] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 4 ms to minimize.
[2024-05-21 04:03:18] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-21 04:03:18] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-21 04:03:19] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 4 ms to minimize.
[2024-05-21 04:03:19] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 3 ms to minimize.
[2024-05-21 04:03:19] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 3 ms to minimize.
[2024-05-21 04:03:19] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
[2024-05-21 04:03:19] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 04:03:24] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-21 04:03:24] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 4 ms to minimize.
[2024-05-21 04:03:24] [INFO ] Deduced a trap composed of 69 places in 195 ms of which 4 ms to minimize.
[2024-05-21 04:03:25] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 4 ms to minimize.
[2024-05-21 04:03:25] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 4 ms to minimize.
[2024-05-21 04:03:25] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 3 ms to minimize.
[2024-05-21 04:03:25] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 3 ms to minimize.
[2024-05-21 04:03:25] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-05-21 04:03:25] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 4 ms to minimize.
[2024-05-21 04:03:26] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 4 ms to minimize.
[2024-05-21 04:03:26] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 3 ms to minimize.
[2024-05-21 04:03:26] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 4 ms to minimize.
[2024-05-21 04:03:26] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 4 ms to minimize.
[2024-05-21 04:03:27] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 3 ms to minimize.
[2024-05-21 04:03:27] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-05-21 04:03:27] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 3 ms to minimize.
[2024-05-21 04:03:27] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 3 ms to minimize.
[2024-05-21 04:03:27] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
[2024-05-21 04:03:28] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-21 04:03:28] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 04:03:29] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 4 ms to minimize.
[2024-05-21 04:03:29] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2024-05-21 04:03:29] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-05-21 04:03:29] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2024-05-21 04:03:29] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-21 04:03:29] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 3 ms to minimize.
[2024-05-21 04:03:30] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-21 04:03:30] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 3 ms to minimize.
[2024-05-21 04:03:30] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2024-05-21 04:03:30] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 3 ms to minimize.
[2024-05-21 04:03:30] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 4 ms to minimize.
[2024-05-21 04:03:31] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-21 04:03:31] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-21 04:03:31] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 3 ms to minimize.
[2024-05-21 04:03:31] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-21 04:03:31] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-21 04:03:32] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
[2024-05-21 04:03:32] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-21 04:03:32] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-05-21 04:03:33] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 04:03:34] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-05-21 04:03:34] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 3 ms to minimize.
[2024-05-21 04:03:34] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
[2024-05-21 04:03:34] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 3 ms to minimize.
[2024-05-21 04:03:35] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 4 ms to minimize.
[2024-05-21 04:03:35] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 3 ms to minimize.
[2024-05-21 04:03:35] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 3 ms to minimize.
[2024-05-21 04:03:36] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/878 variables, and 108 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 68/108 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 04:03:42] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-05-21 04:03:42] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 4 ms to minimize.
[2024-05-21 04:03:42] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-21 04:03:42] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 2 ms to minimize.
[2024-05-21 04:03:43] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-21 04:03:43] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-21 04:03:43] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 3 ms to minimize.
[2024-05-21 04:03:43] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 3 ms to minimize.
[2024-05-21 04:03:43] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 3 ms to minimize.
[2024-05-21 04:03:44] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 2 ms to minimize.
[2024-05-21 04:03:44] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 3 ms to minimize.
[2024-05-21 04:03:44] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 3 ms to minimize.
[2024-05-21 04:03:44] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-21 04:03:44] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 3 ms to minimize.
[2024-05-21 04:03:45] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-21 04:03:45] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-05-21 04:03:46] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-05-21 04:03:46] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-21 04:03:46] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
[2024-05-21 04:03:46] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 04:03:48] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-21 04:03:48] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-21 04:03:49] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 3 ms to minimize.
[2024-05-21 04:03:50] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-05-21 04:03:50] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 04:03:52] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 3 ms to minimize.
[2024-05-21 04:03:53] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 3 ms to minimize.
[2024-05-21 04:03:53] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-21 04:03:53] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-21 04:03:54] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 04:03:59] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 4 ms to minimize.
[2024-05-21 04:03:59] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 04:04:04] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-21 04:04:04] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-05-21 04:04:04] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 3 ms to minimize.
[2024-05-21 04:04:04] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-21 04:04:04] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 3 ms to minimize.
[2024-05-21 04:04:04] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
(s294 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/878 variables, and 146 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 106/106 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 446/485 places, 432/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 446/485 places, 432/473 transitions.
[2024-05-21 04:04:06] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:04:06] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:04:07] [INFO ] Input system was already deterministic with 432 transitions.
[2024-05-21 04:04:07] [INFO ] Flatten gal took : 14 ms
[2024-05-21 04:04:07] [INFO ] Flatten gal took : 14 ms
[2024-05-21 04:04:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality2373358582281115320.gal : 3 ms
[2024-05-21 04:04:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17154530277680781181.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/CTLCardinality2373358582281115320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17154530277680781181.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-05-21 04:04:37] [INFO ] Flatten gal took : 11 ms
[2024-05-21 04:04:37] [INFO ] Applying decomposition
[2024-05-21 04:04:37] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18154575479301721700.txt' '-o' '/tmp/graph18154575479301721700.bin' '-w' '/tmp/graph18154575479301721700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18154575479301721700.bin' '-l' '-1' '-v' '-w' '/tmp/graph18154575479301721700.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:04:37] [INFO ] Decomposing Gal with order
[2024-05-21 04:04:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:04:37] [INFO ] Removed a total of 86 redundant transitions.
[2024-05-21 04:04:37] [INFO ] Flatten gal took : 29 ms
[2024-05-21 04:04:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 04:04:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality1675539337218502579.gal : 5 ms
[2024-05-21 04:04:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9641741918840381118.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/CTLCardinality1675539337218502579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9641741918840381118.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,6.3597e+32,2.61986,68492,14815,16,131047,296,737,186456,36,514,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 484 transition count 309
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 180 rules applied. Total rules applied 343 place count 321 transition count 292
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 353 place count 313 transition count 290
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 357 place count 311 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 358 place count 310 transition count 288
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 61 Pre rules applied. Total rules applied 358 place count 310 transition count 227
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 480 place count 249 transition count 227
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 499 place count 230 transition count 208
Iterating global reduction 5 with 19 rules applied. Total rules applied 518 place count 230 transition count 208
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 518 place count 230 transition count 200
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 534 place count 222 transition count 200
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 672 place count 153 transition count 131
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 681 place count 153 transition count 122
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 699 place count 144 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 700 place count 143 transition count 112
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 10 rules applied. Total rules applied 710 place count 135 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 712 place count 133 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 712 place count 133 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 724 place count 127 transition count 104
Applied a total of 724 rules in 33 ms. Remains 127 /485 variables (removed 358) and now considering 104/473 (removed 369) transitions.
// Phase 1: matrix 104 rows 127 cols
[2024-05-21 04:05:07] [INFO ] Computed 32 invariants in 1 ms
[2024-05-21 04:05:07] [INFO ] Implicit Places using invariants in 141 ms returned [52, 95, 99, 104, 116, 121, 126]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 143 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 120/485 places, 104/473 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 115 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 115 transition count 99
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 16 place count 112 transition count 96
Applied a total of 16 rules in 4 ms. Remains 112 /120 variables (removed 8) and now considering 96/104 (removed 8) transitions.
// Phase 1: matrix 96 rows 112 cols
[2024-05-21 04:05:07] [INFO ] Computed 25 invariants in 0 ms
[2024-05-21 04:05:07] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 04:05:07] [INFO ] Invariant cache hit.
[2024-05-21 04:05:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 04:05:07] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 112/485 places, 96/473 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 461 ms. Remains : 112/485 places, 96/473 transitions.
[2024-05-21 04:05:07] [INFO ] Flatten gal took : 3 ms
[2024-05-21 04:05:07] [INFO ] Flatten gal took : 2 ms
[2024-05-21 04:05:07] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-21 04:05:07] [INFO ] Flatten gal took : 2 ms
[2024-05-21 04:05:07] [INFO ] Flatten gal took : 2 ms
[2024-05-21 04:05:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality12981561099679230144.gal : 1 ms
[2024-05-21 04:05:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality18503510912016723.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/CTLCardinality12981561099679230144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18503510912016723.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.70888e+10,0.05286,4852,2,834,5,5454,6,0,540,6942,0


Converting to forward existential form...Done !
original formula: EG(EF((((AG((p461==0)) + (p529==0)) + ((p337==1)||(p392==0))) + (p327==0))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((!(E(TRUE U !((p461==0)))) + (p529==0)) + ((p337==1)||(p392==0))) + (p327==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t92, t93, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...169
(forward)formula 0,1,0.709955,25060,1,0,194,116488,221,96,3339,94738,216
FORMULA AutoFlight-PT-06b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 462 transition count 450
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 462 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 462 transition count 448
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 453 transition count 439
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 453 transition count 439
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 450 transition count 436
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 449 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 449 transition count 435
Applied a total of 74 rules in 50 ms. Remains 449 /485 variables (removed 36) and now considering 435/473 (removed 38) transitions.
// Phase 1: matrix 435 rows 449 cols
[2024-05-21 04:05:08] [INFO ] Computed 40 invariants in 2 ms
[2024-05-21 04:05:08] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 04:05:08] [INFO ] Invariant cache hit.
[2024-05-21 04:05:09] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-05-21 04:05:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:05:17] [INFO ] Deduced a trap composed of 76 places in 270 ms of which 5 ms to minimize.
[2024-05-21 04:05:17] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 5 ms to minimize.
[2024-05-21 04:05:18] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 4 ms to minimize.
[2024-05-21 04:05:18] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 3 ms to minimize.
[2024-05-21 04:05:18] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 4 ms to minimize.
[2024-05-21 04:05:18] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 5 ms to minimize.
[2024-05-21 04:05:19] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 5 ms to minimize.
[2024-05-21 04:05:19] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 3 ms to minimize.
[2024-05-21 04:05:19] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-21 04:05:19] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-05-21 04:05:19] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 4 ms to minimize.
[2024-05-21 04:05:20] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-21 04:05:20] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-05-21 04:05:20] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 4 ms to minimize.
[2024-05-21 04:05:20] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 4 ms to minimize.
[2024-05-21 04:05:20] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 4 ms to minimize.
[2024-05-21 04:05:21] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 4 ms to minimize.
[2024-05-21 04:05:21] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 3 ms to minimize.
[2024-05-21 04:05:21] [INFO ] Deduced a trap composed of 73 places in 305 ms of which 5 ms to minimize.
[2024-05-21 04:05:22] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:05:26] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 4 ms to minimize.
[2024-05-21 04:05:26] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 3 ms to minimize.
[2024-05-21 04:05:27] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 3 ms to minimize.
[2024-05-21 04:05:27] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 4 ms to minimize.
[2024-05-21 04:05:27] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2024-05-21 04:05:27] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2024-05-21 04:05:28] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-21 04:05:28] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-21 04:05:28] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 2 ms to minimize.
[2024-05-21 04:05:29] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 4 ms to minimize.
[2024-05-21 04:05:29] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:05:32] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 4 ms to minimize.
[2024-05-21 04:05:32] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 4 ms to minimize.
[2024-05-21 04:05:33] [INFO ] Deduced a trap composed of 83 places in 297 ms of which 6 ms to minimize.
[2024-05-21 04:05:33] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 4 ms to minimize.
[2024-05-21 04:05:34] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 19 ms to minimize.
[2024-05-21 04:05:34] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 4 ms to minimize.
[2024-05-21 04:05:34] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
[2024-05-21 04:05:34] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-05-21 04:05:35] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 3 ms to minimize.
[2024-05-21 04:05:35] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2024-05-21 04:05:35] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-21 04:05:35] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-21 04:05:35] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 2 ms to minimize.
[2024-05-21 04:05:35] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-21 04:05:35] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-21 04:05:36] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 3 ms to minimize.
[2024-05-21 04:05:38] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 4 ms to minimize.
[2024-05-21 04:05:38] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 3 ms to minimize.
[2024-05-21 04:05:38] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-21 04:05:38] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 434 unsolved
(s127 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/884 variables, and 91 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 51/91 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:05:44] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 4 ms to minimize.
[2024-05-21 04:05:44] [INFO ] Deduced a trap composed of 80 places in 207 ms of which 4 ms to minimize.
[2024-05-21 04:05:44] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 4 ms to minimize.
[2024-05-21 04:05:45] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 5 ms to minimize.
[2024-05-21 04:05:45] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 3 ms to minimize.
[2024-05-21 04:05:45] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 3 ms to minimize.
[2024-05-21 04:05:45] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 3 ms to minimize.
[2024-05-21 04:05:45] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 3 ms to minimize.
[2024-05-21 04:05:46] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 4 ms to minimize.
[2024-05-21 04:05:46] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
[2024-05-21 04:05:46] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 3 ms to minimize.
[2024-05-21 04:05:46] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 4 ms to minimize.
[2024-05-21 04:05:46] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 3 ms to minimize.
[2024-05-21 04:05:46] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 3 ms to minimize.
[2024-05-21 04:05:47] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-21 04:05:47] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 3 ms to minimize.
[2024-05-21 04:05:47] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 4 ms to minimize.
[2024-05-21 04:05:47] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-05-21 04:05:48] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-21 04:05:48] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:05:49] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 4 ms to minimize.
[2024-05-21 04:05:49] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-05-21 04:05:49] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 3 ms to minimize.
[2024-05-21 04:05:50] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
[2024-05-21 04:05:50] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-05-21 04:05:50] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 3 ms to minimize.
[2024-05-21 04:05:50] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-05-21 04:05:50] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 3 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 3 ms to minimize.
[2024-05-21 04:05:51] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-21 04:05:53] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-21 04:05:53] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 3 ms to minimize.
[2024-05-21 04:05:53] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-05-21 04:05:53] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-05-21 04:05:53] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-21 04:05:54] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:05:54] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-21 04:05:54] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-21 04:05:55] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 3 ms to minimize.
[2024-05-21 04:05:55] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-05-21 04:05:55] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 3 ms to minimize.
[2024-05-21 04:05:55] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-05-21 04:05:56] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
[2024-05-21 04:05:56] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-21 04:05:56] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-21 04:05:56] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 10/141 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:06:01] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-05-21 04:06:01] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-21 04:06:01] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-21 04:06:01] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-21 04:06:03] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-21 04:06:03] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 3 ms to minimize.
[2024-05-21 04:06:03] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-21 04:06:04] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-05-21 04:06:04] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-05-21 04:06:04] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 04:06:04] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-21 04:06:05] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2024-05-21 04:06:05] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 13/154 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:06:08] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-21 04:06:08] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/884 variables, and 156 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 116/116 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 449/485 places, 435/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60823 ms. Remains : 449/485 places, 435/473 transitions.
[2024-05-21 04:06:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:06:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:06:09] [INFO ] Input system was already deterministic with 435 transitions.
[2024-05-21 04:06:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 04:06:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 04:06:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality6349697060340321936.gal : 2 ms
[2024-05-21 04:06:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality1962527024480294069.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/CTLCardinality6349697060340321936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1962527024480294069.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-05-21 04:06:39] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:06:39] [INFO ] Applying decomposition
[2024-05-21 04:06:39] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15893084296872380978.txt' '-o' '/tmp/graph15893084296872380978.bin' '-w' '/tmp/graph15893084296872380978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15893084296872380978.bin' '-l' '-1' '-v' '-w' '/tmp/graph15893084296872380978.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:06:39] [INFO ] Decomposing Gal with order
[2024-05-21 04:06:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:06:39] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-21 04:06:39] [INFO ] Flatten gal took : 21 ms
[2024-05-21 04:06:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 04:06:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality18150326134604899320.gal : 4 ms
[2024-05-21 04:06:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality17412848824490736204.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/CTLCardinality18150326134604899320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17412848824490736204.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.28622e+32,5.9361,154312,16861,14,302259,273,736,499202,29,550,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 461 transition count 449
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 461 transition count 449
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 461 transition count 447
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 451 transition count 437
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 451 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 449 transition count 435
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 449 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 448 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 448 transition count 434
Applied a total of 76 rules in 48 ms. Remains 448 /485 variables (removed 37) and now considering 434/473 (removed 39) transitions.
// Phase 1: matrix 434 rows 448 cols
[2024-05-21 04:07:09] [INFO ] Computed 40 invariants in 2 ms
[2024-05-21 04:07:09] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 04:07:09] [INFO ] Invariant cache hit.
[2024-05-21 04:07:10] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-21 04:07:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:07:19] [INFO ] Deduced a trap composed of 67 places in 355 ms of which 4 ms to minimize.
[2024-05-21 04:07:19] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 5 ms to minimize.
[2024-05-21 04:07:19] [INFO ] Deduced a trap composed of 61 places in 266 ms of which 4 ms to minimize.
[2024-05-21 04:07:19] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 4 ms to minimize.
[2024-05-21 04:07:20] [INFO ] Deduced a trap composed of 72 places in 371 ms of which 6 ms to minimize.
[2024-05-21 04:07:20] [INFO ] Deduced a trap composed of 70 places in 286 ms of which 4 ms to minimize.
[2024-05-21 04:07:20] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 4 ms to minimize.
[2024-05-21 04:07:21] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 6 ms to minimize.
[2024-05-21 04:07:21] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 3 ms to minimize.
[2024-05-21 04:07:21] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 4 ms to minimize.
[2024-05-21 04:07:21] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 3 ms to minimize.
[2024-05-21 04:07:21] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 4 ms to minimize.
[2024-05-21 04:07:22] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2024-05-21 04:07:22] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 4 ms to minimize.
[2024-05-21 04:07:22] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 3 ms to minimize.
[2024-05-21 04:07:22] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2024-05-21 04:07:22] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-21 04:07:23] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 5 ms to minimize.
[2024-05-21 04:07:23] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
[2024-05-21 04:07:23] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:07:27] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 3 ms to minimize.
[2024-05-21 04:07:28] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 3 ms to minimize.
[2024-05-21 04:07:28] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 3 ms to minimize.
[2024-05-21 04:07:28] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 4 ms to minimize.
[2024-05-21 04:07:28] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
[2024-05-21 04:07:28] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 3 ms to minimize.
[2024-05-21 04:07:28] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
[2024-05-21 04:07:29] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-05-21 04:07:29] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 3 ms to minimize.
[2024-05-21 04:07:29] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-21 04:07:29] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-21 04:07:29] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 3 ms to minimize.
[2024-05-21 04:07:30] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 4 ms to minimize.
[2024-05-21 04:07:30] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-05-21 04:07:30] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 3 ms to minimize.
[2024-05-21 04:07:30] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-05-21 04:07:31] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 04:07:31] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-21 04:07:31] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 3 ms to minimize.
[2024-05-21 04:07:31] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:07:32] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 3 ms to minimize.
[2024-05-21 04:07:32] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 5 ms to minimize.
[2024-05-21 04:07:32] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 4 ms to minimize.
[2024-05-21 04:07:32] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 4 ms to minimize.
[2024-05-21 04:07:33] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 4 ms to minimize.
[2024-05-21 04:07:33] [INFO ] Deduced a trap composed of 63 places in 251 ms of which 4 ms to minimize.
[2024-05-21 04:07:33] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 4 ms to minimize.
[2024-05-21 04:07:34] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 4 ms to minimize.
[2024-05-21 04:07:34] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 4 ms to minimize.
[2024-05-21 04:07:34] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 4 ms to minimize.
[2024-05-21 04:07:35] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-21 04:07:35] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 3 ms to minimize.
[2024-05-21 04:07:35] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 3 ms to minimize.
[2024-05-21 04:07:35] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 04:07:35] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 04:07:37] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-05-21 04:07:37] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-21 04:07:37] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 3 ms to minimize.
[2024-05-21 04:07:37] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 3 ms to minimize.
[2024-05-21 04:07:37] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:07:38] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 3 ms to minimize.
[2024-05-21 04:07:39] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 4 ms to minimize.
[2024-05-21 04:07:39] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/882 variables, and 103 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 63/103 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:07:45] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 3 ms to minimize.
[2024-05-21 04:07:45] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-21 04:07:46] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 4 ms to minimize.
[2024-05-21 04:07:46] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 3 ms to minimize.
[2024-05-21 04:07:46] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-21 04:07:46] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:07:51] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 4 ms to minimize.
[2024-05-21 04:07:51] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 04:07:51] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-21 04:07:52] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-05-21 04:07:53] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2024-05-21 04:07:53] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 04:07:53] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-21 04:07:54] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
[2024-05-21 04:07:54] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2024-05-21 04:07:54] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-21 04:07:54] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-05-21 04:07:55] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:07:57] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-05-21 04:07:57] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-05-21 04:07:57] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 3 ms to minimize.
[2024-05-21 04:07:58] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 3 ms to minimize.
[2024-05-21 04:07:58] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 3 ms to minimize.
[2024-05-21 04:07:58] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-05-21 04:07:58] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-21 04:07:59] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-21 04:08:00] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 3 ms to minimize.
[2024-05-21 04:08:00] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-21 04:08:00] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-05-21 04:08:00] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-21 04:08:00] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-21 04:08:01] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2024-05-21 04:08:01] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 04:08:01] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-21 04:08:01] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
[2024-05-21 04:08:02] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 3 ms to minimize.
[2024-05-21 04:08:02] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 19/140 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:08:04] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-05-21 04:08:05] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
[2024-05-21 04:08:05] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-05-21 04:08:05] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/882 variables, and 144 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 0/433 constraints, Known Traps: 104/104 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 448/485 places, 434/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60846 ms. Remains : 448/485 places, 434/473 transitions.
[2024-05-21 04:08:10] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:08:10] [INFO ] Flatten gal took : 8 ms
[2024-05-21 04:08:10] [INFO ] Input system was already deterministic with 434 transitions.
[2024-05-21 04:08:10] [INFO ] Flatten gal took : 8 ms
[2024-05-21 04:08:10] [INFO ] Flatten gal took : 8 ms
[2024-05-21 04:08:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality11705552844012984867.gal : 2 ms
[2024-05-21 04:08:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality13048432714894859333.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/CTLCardinality11705552844012984867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13048432714894859333.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-05-21 04:08:40] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:08:40] [INFO ] Applying decomposition
[2024-05-21 04:08:40] [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/graph4337992151755858353.txt' '-o' '/tmp/graph4337992151755858353.bin' '-w' '/tmp/graph4337992151755858353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4337992151755858353.bin' '-l' '-1' '-v' '-w' '/tmp/graph4337992151755858353.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:08:40] [INFO ] Decomposing Gal with order
[2024-05-21 04:08:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:08:40] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-21 04:08:40] [INFO ] Flatten gal took : 19 ms
[2024-05-21 04:08:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 04:08:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality1257079512587824797.gal : 4 ms
[2024-05-21 04:08:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality9772298162731284522.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/CTLCardinality1257079512587824797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9772298162731284522.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,6.82304e+32,9.75204,247312,24446,14,473390,284,773,763744,31,623,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 461 transition count 449
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 461 transition count 449
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 461 transition count 447
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 452 transition count 438
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 452 transition count 438
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 449 transition count 435
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 449 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 448 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 448 transition count 434
Applied a total of 76 rules in 49 ms. Remains 448 /485 variables (removed 37) and now considering 434/473 (removed 39) transitions.
// Phase 1: matrix 434 rows 448 cols
[2024-05-21 04:09:10] [INFO ] Computed 40 invariants in 2 ms
[2024-05-21 04:09:11] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 04:09:11] [INFO ] Invariant cache hit.
[2024-05-21 04:09:11] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-21 04:09:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:09:19] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 5 ms to minimize.
[2024-05-21 04:09:19] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 5 ms to minimize.
[2024-05-21 04:09:20] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 4 ms to minimize.
[2024-05-21 04:09:20] [INFO ] Deduced a trap composed of 16 places in 345 ms of which 6 ms to minimize.
[2024-05-21 04:09:20] [INFO ] Deduced a trap composed of 69 places in 325 ms of which 4 ms to minimize.
[2024-05-21 04:09:21] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 4 ms to minimize.
[2024-05-21 04:09:21] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 4 ms to minimize.
[2024-05-21 04:09:21] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 4 ms to minimize.
[2024-05-21 04:09:21] [INFO ] Deduced a trap composed of 61 places in 223 ms of which 4 ms to minimize.
[2024-05-21 04:09:22] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 4 ms to minimize.
[2024-05-21 04:09:22] [INFO ] Deduced a trap composed of 68 places in 170 ms of which 4 ms to minimize.
[2024-05-21 04:09:22] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 4 ms to minimize.
[2024-05-21 04:09:22] [INFO ] Deduced a trap composed of 73 places in 224 ms of which 4 ms to minimize.
[2024-05-21 04:09:23] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 5 ms to minimize.
[2024-05-21 04:09:23] [INFO ] Deduced a trap composed of 73 places in 265 ms of which 4 ms to minimize.
[2024-05-21 04:09:23] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 4 ms to minimize.
[2024-05-21 04:09:24] [INFO ] Deduced a trap composed of 58 places in 297 ms of which 6 ms to minimize.
[2024-05-21 04:09:24] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 4 ms to minimize.
[2024-05-21 04:09:24] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 5 ms to minimize.
[2024-05-21 04:09:25] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:09:29] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-05-21 04:09:29] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-05-21 04:09:30] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 4 ms to minimize.
[2024-05-21 04:09:30] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 3 ms to minimize.
[2024-05-21 04:09:30] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 3 ms to minimize.
[2024-05-21 04:09:30] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-05-21 04:09:30] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2024-05-21 04:09:31] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-05-21 04:09:31] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 4 ms to minimize.
[2024-05-21 04:09:31] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-05-21 04:09:32] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 04:09:32] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-21 04:09:33] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 3 ms to minimize.
[2024-05-21 04:09:34] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:09:36] [INFO ] Deduced a trap composed of 70 places in 233 ms of which 4 ms to minimize.
[2024-05-21 04:09:36] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 4 ms to minimize.
[2024-05-21 04:09:37] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 4 ms to minimize.
[2024-05-21 04:09:37] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 3 ms to minimize.
[2024-05-21 04:09:37] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-21 04:09:38] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 3 ms to minimize.
[2024-05-21 04:09:38] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-21 04:09:38] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 3 ms to minimize.
[2024-05-21 04:09:38] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 4 ms to minimize.
[2024-05-21 04:09:38] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 3 ms to minimize.
[2024-05-21 04:09:39] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 3 ms to minimize.
[2024-05-21 04:09:39] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 4 ms to minimize.
[2024-05-21 04:09:39] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-05-21 04:09:39] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-05-21 04:09:39] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-05-21 04:09:40] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-05-21 04:09:40] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-05-21 04:09:40] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-21 04:09:40] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-21 04:09:40] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 04:09:41] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 3 ms to minimize.
[2024-05-21 04:09:41] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 4 ms to minimize.
SMT process timed out in 30067ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 30071ms
Starting structural reductions in LTL mode, iteration 1 : 448/485 places, 434/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30835 ms. Remains : 448/485 places, 434/473 transitions.
[2024-05-21 04:09:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 04:09:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 04:09:41] [INFO ] Input system was already deterministic with 434 transitions.
[2024-05-21 04:09:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 04:09:41] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:09:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality14858120735578229628.gal : 5 ms
[2024-05-21 04:09:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality8949402142887552991.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/CTLCardinality14858120735578229628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8949402142887552991.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-05-21 04:10:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:10:11] [INFO ] Applying decomposition
[2024-05-21 04:10:11] [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/graph15099416612125914041.txt' '-o' '/tmp/graph15099416612125914041.bin' '-w' '/tmp/graph15099416612125914041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15099416612125914041.bin' '-l' '-1' '-v' '-w' '/tmp/graph15099416612125914041.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:10:11] [INFO ] Decomposing Gal with order
[2024-05-21 04:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:10:11] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-21 04:10:11] [INFO ] Flatten gal took : 19 ms
[2024-05-21 04:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 04:10:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality15461819005291735578.gal : 4 ms
[2024-05-21 04:10:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality13978254314925621035.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/CTLCardinality15461819005291735578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13978254314925621035.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,6.58739e+32,1.89216,56388,13722,16,103246,257,736,167726,35,399,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 473/473 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 462 transition count 450
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 462 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 462 transition count 448
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 453 transition count 439
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 453 transition count 439
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 450 transition count 436
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 449 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 449 transition count 435
Applied a total of 74 rules in 45 ms. Remains 449 /485 variables (removed 36) and now considering 435/473 (removed 38) transitions.
// Phase 1: matrix 435 rows 449 cols
[2024-05-21 04:10:41] [INFO ] Computed 40 invariants in 2 ms
[2024-05-21 04:10:42] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 04:10:42] [INFO ] Invariant cache hit.
[2024-05-21 04:10:42] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-05-21 04:10:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:10:50] [INFO ] Deduced a trap composed of 59 places in 289 ms of which 5 ms to minimize.
[2024-05-21 04:10:51] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 4 ms to minimize.
[2024-05-21 04:10:51] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 4 ms to minimize.
[2024-05-21 04:10:51] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 4 ms to minimize.
[2024-05-21 04:10:52] [INFO ] Deduced a trap composed of 73 places in 339 ms of which 6 ms to minimize.
[2024-05-21 04:10:52] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 4 ms to minimize.
[2024-05-21 04:10:52] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 4 ms to minimize.
[2024-05-21 04:10:53] [INFO ] Deduced a trap composed of 60 places in 312 ms of which 9 ms to minimize.
[2024-05-21 04:10:53] [INFO ] Deduced a trap composed of 66 places in 336 ms of which 4 ms to minimize.
[2024-05-21 04:10:53] [INFO ] Deduced a trap composed of 87 places in 254 ms of which 5 ms to minimize.
[2024-05-21 04:10:54] [INFO ] Deduced a trap composed of 70 places in 240 ms of which 4 ms to minimize.
[2024-05-21 04:10:54] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 4 ms to minimize.
[2024-05-21 04:10:54] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 4 ms to minimize.
[2024-05-21 04:10:54] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 4 ms to minimize.
[2024-05-21 04:10:55] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 3 ms to minimize.
[2024-05-21 04:10:56] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-05-21 04:10:56] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-21 04:10:56] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-21 04:10:56] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
[2024-05-21 04:10:56] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:11:01] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 4 ms to minimize.
[2024-05-21 04:11:01] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 4 ms to minimize.
[2024-05-21 04:11:01] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 4 ms to minimize.
[2024-05-21 04:11:01] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 5 ms to minimize.
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 5 ms to minimize.
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 75 places in 198 ms of which 3 ms to minimize.
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 3 ms to minimize.
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 3 ms to minimize.
[2024-05-21 04:11:03] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 3 ms to minimize.
[2024-05-21 04:11:03] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
[2024-05-21 04:11:03] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-05-21 04:11:05] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 4 ms to minimize.
[2024-05-21 04:11:05] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 4 ms to minimize.
[2024-05-21 04:11:05] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2024-05-21 04:11:06] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-05-21 04:11:06] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2024-05-21 04:11:06] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-05-21 04:11:06] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-05-21 04:11:07] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:11:07] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-21 04:11:08] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 3 ms to minimize.
[2024-05-21 04:11:08] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 3 ms to minimize.
[2024-05-21 04:11:08] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 4 ms to minimize.
[2024-05-21 04:11:08] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 3 ms to minimize.
[2024-05-21 04:11:08] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 3 ms to minimize.
[2024-05-21 04:11:08] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 4 ms to minimize.
[2024-05-21 04:11:09] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 3 ms to minimize.
[2024-05-21 04:11:09] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 3 ms to minimize.
[2024-05-21 04:11:09] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-21 04:11:09] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/884 variables, and 91 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 51/91 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:11:17] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 4 ms to minimize.
[2024-05-21 04:11:18] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 4 ms to minimize.
[2024-05-21 04:11:18] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 4 ms to minimize.
[2024-05-21 04:11:18] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 4 ms to minimize.
[2024-05-21 04:11:18] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 3 ms to minimize.
[2024-05-21 04:11:18] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-05-21 04:11:18] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 3 ms to minimize.
[2024-05-21 04:11:19] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 3 ms to minimize.
[2024-05-21 04:11:19] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 3 ms to minimize.
[2024-05-21 04:11:19] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-21 04:11:19] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-05-21 04:11:19] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 3 ms to minimize.
[2024-05-21 04:11:19] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2024-05-21 04:11:20] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-21 04:11:20] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
[2024-05-21 04:11:20] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 3 ms to minimize.
[2024-05-21 04:11:20] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 3 ms to minimize.
[2024-05-21 04:11:20] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 4 ms to minimize.
[2024-05-21 04:11:21] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 3 ms to minimize.
[2024-05-21 04:11:21] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:11:21] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 3 ms to minimize.
[2024-05-21 04:11:22] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 3 ms to minimize.
[2024-05-21 04:11:22] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 3 ms to minimize.
[2024-05-21 04:11:22] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-05-21 04:11:23] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 4 ms to minimize.
[2024-05-21 04:11:23] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-05-21 04:11:23] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-05-21 04:11:23] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-21 04:11:23] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 3 ms to minimize.
[2024-05-21 04:11:23] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-21 04:11:24] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 3 ms to minimize.
[2024-05-21 04:11:24] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-21 04:11:24] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 3 ms to minimize.
[2024-05-21 04:11:24] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-05-21 04:11:24] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-21 04:11:24] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-21 04:11:25] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-05-21 04:11:25] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2024-05-21 04:11:25] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 3 ms to minimize.
[2024-05-21 04:11:25] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:11:26] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 3 ms to minimize.
[2024-05-21 04:11:26] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 3 ms to minimize.
[2024-05-21 04:11:26] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-21 04:11:26] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-21 04:11:27] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 3 ms to minimize.
[2024-05-21 04:11:27] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-21 04:11:27] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 04:11:28] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-21 04:11:30] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:11:32] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 3 ms to minimize.
[2024-05-21 04:11:32] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-05-21 04:11:33] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
[2024-05-21 04:11:33] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-21 04:11:33] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-21 04:11:35] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-21 04:11:36] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 7/147 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-21 04:11:38] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 3 ms to minimize.
[2024-05-21 04:11:39] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-05-21 04:11:39] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 04:11:41] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-21 04:11:41] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/884 variables, and 152 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 112/112 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 449/485 places, 435/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60824 ms. Remains : 449/485 places, 435/473 transitions.
[2024-05-21 04:11:42] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:11:42] [INFO ] Flatten gal took : 8 ms
[2024-05-21 04:11:42] [INFO ] Input system was already deterministic with 435 transitions.
[2024-05-21 04:11:42] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:11:42] [INFO ] Flatten gal took : 8 ms
[2024-05-21 04:11:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality7722864795815046068.gal : 2 ms
[2024-05-21 04:11:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17357972978658978321.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/CTLCardinality7722864795815046068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17357972978658978321.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-05-21 04:12:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 04:12:12] [INFO ] Applying decomposition
[2024-05-21 04:12:12] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2700186548855721839.txt' '-o' '/tmp/graph2700186548855721839.bin' '-w' '/tmp/graph2700186548855721839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2700186548855721839.bin' '-l' '-1' '-v' '-w' '/tmp/graph2700186548855721839.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:12:12] [INFO ] Decomposing Gal with order
[2024-05-21 04:12:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:12:12] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-21 04:12:12] [INFO ] Flatten gal took : 19 ms
[2024-05-21 04:12:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 04:12:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality5386596696025124642.gal : 4 ms
[2024-05-21 04:12:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality10181509469057611584.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/CTLCardinality5386596696025124642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10181509469057611584.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,7.12805e+32,3.17715,86628,14623,19,167558,322,709,244317,36,649,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 04:12:42] [INFO ] Flatten gal took : 14 ms
[2024-05-21 04:12:43] [INFO ] Flatten gal took : 10 ms
[2024-05-21 04:12:43] [INFO ] Applying decomposition
[2024-05-21 04:12:43] [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/graph17725547468445370676.txt' '-o' '/tmp/graph17725547468445370676.bin' '-w' '/tmp/graph17725547468445370676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17725547468445370676.bin' '-l' '-1' '-v' '-w' '/tmp/graph17725547468445370676.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:12:43] [INFO ] Decomposing Gal with order
[2024-05-21 04:12:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:12:43] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 04:12:43] [INFO ] Flatten gal took : 24 ms
[2024-05-21 04:12:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 04:12:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality17820671594917815588.gal : 5 ms
[2024-05-21 04:12:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality17614955492763432140.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/CTLCardinality17820671594917815588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17614955492763432140.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 11 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.73895e+33,36.2048,789672,52554,28,1.40414e+06,425,780,2.80118e+06,48,1158,0


Converting to forward existential form...Done !
original formula: ((!(E(AG(AX((i9.u49.p154==0))) U AF(EG(((i12.u57.p180==0)||(i12.u55.p174==1)))))) * EX(AG(EF(((i27.u0.p2==0)&&(i12.u54.p172==1)))))) * EF...268
=> equivalent forward existential formula: (([(FwdU(Init,!(E(TRUE U !(!(EX(!((i9.u49.p154==0)))))))) * !(EG(!(EG(((i12.u57.p180==0)||(i12.u55.p174==1))))))...402
Reverse transition relation is NOT exact ! Due to transitions t159, t162, t173, t201, t270, t314, t350, t457, t458, t459, t460, t461, t462, t463, t464, i0....1297
Detected timeout of ITS tools.
[2024-05-21 04:40:09] [INFO ] Applying decomposition
[2024-05-21 04:40:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 04:40:09] [INFO ] Decomposing Gal with order
[2024-05-21 04:40:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:40:09] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-21 04:40:09] [INFO ] Flatten gal took : 16 ms
[2024-05-21 04:40:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 34 ms.
[2024-05-21 04:40:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9852384250129192178.gal : 10 ms
[2024-05-21 04:40:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality17753998662932988526.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9852384250129192178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17753998662932988526.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 11 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 04:48:23] [INFO ] Flatten gal took : 12 ms
[2024-05-21 04:48:23] [INFO ] Input system was already deterministic with 473 transitions.
[2024-05-21 04:48:23] [INFO ] Transformed 485 places.
[2024-05-21 04:48:23] [INFO ] Transformed 473 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 04:48:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality13782731255539381046.gal : 3 ms
[2024-05-21 04:48:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5868715250635152338.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/CTLCardinality13782731255539381046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5868715250635152338.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 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="AutoFlight-PT-06b"
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 AutoFlight-PT-06b, 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 r026-smll-171620167100145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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