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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.9K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 9.2K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 22:14 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 70K 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-03b-CTLCardinality-2024-00
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-01
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-02
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-03
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-04
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-05
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-06
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-07
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-08
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-09
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-10
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2024-11
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2023-12
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2023-13
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2023-14
FORMULA_NAME AutoFlight-PT-03b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716248806106

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-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-20 23:46:48] [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-20 23:46:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:46:48] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2024-05-20 23:46:48] [INFO ] Transformed 298 places.
[2024-05-20 23:46:48] [INFO ] Transformed 296 transitions.
[2024-05-20 23:46:48] [INFO ] Found NUPN structural information;
[2024-05-20 23:46:48] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Support contains 67 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 270 transition count 268
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 270 transition count 268
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 270 transition count 264
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 69 place count 261 transition count 255
Iterating global reduction 1 with 9 rules applied. Total rules applied 78 place count 261 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 260 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 260 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 259 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 259 transition count 253
Applied a total of 82 rules in 186 ms. Remains 259 /298 variables (removed 39) and now considering 253/296 (removed 43) transitions.
// Phase 1: matrix 253 rows 259 cols
[2024-05-20 23:46:49] [INFO ] Computed 22 invariants in 42 ms
[2024-05-20 23:46:49] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-20 23:46:49] [INFO ] Invariant cache hit.
[2024-05-20 23:46:50] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-20 23:46:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-20 23:46:55] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 24 ms to minimize.
[2024-05-20 23:46:55] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:46:55] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:46:56] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 2 ms to minimize.
[2024-05-20 23:46:56] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 5 ms to minimize.
[2024-05-20 23:46:56] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 3 ms to minimize.
[2024-05-20 23:46:56] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:46:56] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 4 ms to minimize.
[2024-05-20 23:46:57] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 4 ms to minimize.
[2024-05-20 23:46:57] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 3 ms to minimize.
[2024-05-20 23:46:57] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2024-05-20 23:46:57] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-20 23:46:57] [INFO ] Deduced a trap composed of 51 places in 244 ms of which 4 ms to minimize.
[2024-05-20 23:46:57] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 4 ms to minimize.
[2024-05-20 23:46:58] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-05-20 23:46:58] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-20 23:46:58] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-20 23:46:58] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:46:58] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-20 23:46:58] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-20 23:47:01] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 3 ms to minimize.
[2024-05-20 23:47:01] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 4 ms to minimize.
[2024-05-20 23:47:01] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 4 ms to minimize.
[2024-05-20 23:47:01] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-20 23:47:01] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 4 ms to minimize.
[2024-05-20 23:47:01] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 4 ms to minimize.
[2024-05-20 23:47:02] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 4 ms to minimize.
[2024-05-20 23:47:02] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:47:02] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 3 ms to minimize.
[2024-05-20 23:47:02] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 3 ms to minimize.
[2024-05-20 23:47:02] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 3 ms to minimize.
[2024-05-20 23:47:02] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 3 ms to minimize.
[2024-05-20 23:47:02] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-05-20 23:47:03] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 4 ms to minimize.
[2024-05-20 23:47:03] [INFO ] Deduced a trap composed of 62 places in 161 ms of which 3 ms to minimize.
[2024-05-20 23:47:03] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-05-20 23:47:03] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 3 ms to minimize.
[2024-05-20 23:47:03] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-20 23:47:03] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 4 ms to minimize.
[2024-05-20 23:47:04] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-20 23:47:04] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 4 ms to minimize.
[2024-05-20 23:47:05] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 4 ms to minimize.
[2024-05-20 23:47:05] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 4 ms to minimize.
[2024-05-20 23:47:05] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 3 ms to minimize.
[2024-05-20 23:47:05] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-05-20 23:47:05] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 4 ms to minimize.
[2024-05-20 23:47:06] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-20 23:47:06] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-20 23:47:06] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 3 ms to minimize.
[2024-05-20 23:47:06] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-20 23:47:06] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
[2024-05-20 23:47:06] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:47:07] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-20 23:47:09] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 3 ms to minimize.
[2024-05-20 23:47:09] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 4 ms to minimize.
[2024-05-20 23:47:10] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-20 23:47:10] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-20 23:47:14] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 3 ms to minimize.
[2024-05-20 23:47:14] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 3 ms to minimize.
[2024-05-20 23:47:14] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 3 ms to minimize.
[2024-05-20 23:47:14] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:47:14] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 3 ms to minimize.
[2024-05-20 23:47:15] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:47:15] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 4 ms to minimize.
[2024-05-20 23:47:15] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:47:15] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 2 ms to minimize.
[2024-05-20 23:47:16] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 3 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-20 23:47:17] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.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 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.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 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.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 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.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 1.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 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 259/512 variables, and 93 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/259 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 71/93 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-20 23:47:24] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 3 ms to minimize.
[2024-05-20 23:47:24] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 253/512 variables, 259/354 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-20 23:47:29] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:47:29] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 3 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:47:30] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 4 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 4 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 4 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 4 ms to minimize.
[2024-05-20 23:47:31] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 4 ms to minimize.
[2024-05-20 23:47:32] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 3 ms to minimize.
[2024-05-20 23:47:32] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 3 ms to minimize.
[2024-05-20 23:47:32] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 3 ms to minimize.
[2024-05-20 23:47:32] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 3 ms to minimize.
[2024-05-20 23:47:35] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-20 23:47:36] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 3 ms to minimize.
[2024-05-20 23:47:36] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-20 23:47:37] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:47:37] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 19/625 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-20 23:47:40] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-20 23:47:40] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-05-20 23:47:41] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 3 ms to minimize.
[2024-05-20 23:47:42] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 3 ms to minimize.
[2024-05-20 23:47:42] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
[2024-05-20 23:47:42] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 3 ms to minimize.
[2024-05-20 23:47:42] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 3 ms to minimize.
[2024-05-20 23:47:42] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 4 ms to minimize.
[2024-05-20 23:47:44] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 9/634 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 634 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 101/101 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Starting structural reductions in LTL mode, iteration 1 : 259/298 places, 253/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61636 ms. Remains : 259/298 places, 253/296 transitions.
Support contains 67 out of 259 places after structural reductions.
[2024-05-20 23:47:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-20 23:47:51] [INFO ] Flatten gal took : 96 ms
FORMULA AutoFlight-PT-03b-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 23:47:51] [INFO ] Flatten gal took : 39 ms
[2024-05-20 23:47:51] [INFO ] Input system was already deterministic with 253 transitions.
Support contains 56 out of 259 places (down from 67) after GAL structural reductions.
RANDOM walk for 40000 steps (250 resets) in 2242 ms. (17 steps per ms) remains 3/36 properties
BEST_FIRST walk for 40003 steps (24 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (37 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
[2024-05-20 23:47:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 202/210 variables, 17/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/241 variables, 4/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/259 variables, 1/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 253/512 variables, 259/281 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/512 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 281 constraints, problems are : Problem set: 2 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/86 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-20 23:47:52] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 155/241 variables, 18/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-20 23:47:52] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 1/23 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/259 variables, 1/24 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 253/512 variables, 259/283 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 1/284 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/284 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/512 variables, 0/284 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 284 constraints, problems are : Problem set: 2 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 609ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 253/253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 259 transition count 166
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 99 rules applied. Total rules applied 186 place count 172 transition count 154
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 193 place count 166 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 194 place count 165 transition count 153
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 194 place count 165 transition count 118
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 264 place count 130 transition count 118
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 273 place count 121 transition count 109
Iterating global reduction 4 with 9 rules applied. Total rules applied 282 place count 121 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 282 place count 121 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 292 place count 116 transition count 104
Performed 40 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 372 place count 76 transition count 59
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 384 place count 76 transition count 47
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 396 place count 64 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 397 place count 63 transition count 46
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 5 with 25 rules applied. Total rules applied 422 place count 51 transition count 33
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 435 place count 38 transition count 33
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 435 place count 38 transition count 22
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 457 place count 27 transition count 22
Applied a total of 457 rules in 83 ms. Remains 27 /259 variables (removed 232) and now considering 22/253 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 27/259 places, 22/253 transitions.
RANDOM walk for 67 steps (0 resets) in 7 ms. (8 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-20 23:47:53] [INFO ] Flatten gal took : 28 ms
[2024-05-20 23:47:53] [INFO ] Flatten gal took : 30 ms
[2024-05-20 23:47:53] [INFO ] Input system was already deterministic with 253 transitions.
Computed a total of 73 stabilizing places and 73 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 245 transition count 239
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 245 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 245 transition count 237
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 238 transition count 230
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 236 transition count 228
Applied a total of 48 rules in 49 ms. Remains 236 /259 variables (removed 23) and now considering 228/253 (removed 25) transitions.
// Phase 1: matrix 228 rows 236 cols
[2024-05-20 23:47:53] [INFO ] Computed 22 invariants in 10 ms
[2024-05-20 23:47:53] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-20 23:47:53] [INFO ] Invariant cache hit.
[2024-05-20 23:47:53] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-20 23:47:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:47:57] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 4 ms to minimize.
[2024-05-20 23:47:57] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 4 ms to minimize.
[2024-05-20 23:47:57] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 6 ms to minimize.
[2024-05-20 23:47:57] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 3 ms to minimize.
[2024-05-20 23:47:58] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 4 ms to minimize.
[2024-05-20 23:47:58] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 4 ms to minimize.
[2024-05-20 23:47:58] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-05-20 23:47:58] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:47:58] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 4 ms to minimize.
[2024-05-20 23:47:58] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 4 ms to minimize.
[2024-05-20 23:47:58] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 3 ms to minimize.
[2024-05-20 23:47:59] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 4 ms to minimize.
[2024-05-20 23:47:59] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 4 ms to minimize.
[2024-05-20 23:47:59] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-05-20 23:47:59] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 4 ms to minimize.
[2024-05-20 23:47:59] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 4 ms to minimize.
[2024-05-20 23:47:59] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:48:00] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-05-20 23:48:00] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
[2024-05-20 23:48:00] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:02] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 4 ms to minimize.
[2024-05-20 23:48:02] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-05-20 23:48:02] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 3 ms to minimize.
[2024-05-20 23:48:03] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:48:03] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 3 ms to minimize.
[2024-05-20 23:48:03] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:48:03] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 3 ms to minimize.
[2024-05-20 23:48:04] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 3 ms to minimize.
[2024-05-20 23:48:04] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:05] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 3 ms to minimize.
[2024-05-20 23:48:05] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 4 ms to minimize.
[2024-05-20 23:48:05] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 3 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-20 23:48:06] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 3 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 3 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-05-20 23:48:07] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:10] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:12] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-20 23:48:13] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (OVERLAPS) 228/464 variables, 236/302 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:19] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 303 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 45/67 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:26] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 3 ms to minimize.
[2024-05-20 23:48:26] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 3 ms to minimize.
[2024-05-20 23:48:27] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-20 23:48:28] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:29] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:48:29] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 228/464 variables, 236/309 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 227/536 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:34] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
[2024-05-20 23:48:35] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-20 23:48:35] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 3 ms to minimize.
[2024-05-20 23:48:35] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:42] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-20 23:48:42] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:48:48] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 4 ms to minimize.
[2024-05-20 23:48:49] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 4 ms to minimize.
[2024-05-20 23:48:49] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:48:49] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 546 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 61/61 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 236/259 places, 228/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60537 ms. Remains : 236/259 places, 228/253 transitions.
[2024-05-20 23:48:53] [INFO ] Flatten gal took : 25 ms
[2024-05-20 23:48:53] [INFO ] Flatten gal took : 25 ms
[2024-05-20 23:48:53] [INFO ] Input system was already deterministic with 228 transitions.
[2024-05-20 23:48:53] [INFO ] Flatten gal took : 25 ms
[2024-05-20 23:48:53] [INFO ] Flatten gal took : 23 ms
[2024-05-20 23:48:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality7164403504914051532.gal : 10 ms
[2024-05-20 23:48:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality1664340550678250095.ctl : 17 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/CTLCardinality7164403504914051532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1664340550678250095.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.35897e+17,6.69682,151076,2,49987,5,513990,6,0,1174,905676,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:49:24] [INFO ] Flatten gal took : 23 ms
[2024-05-20 23:49:24] [INFO ] Applying decomposition
[2024-05-20 23:49:24] [INFO ] Flatten gal took : 19 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/graph9460243859067683538.txt' '-o' '/tmp/graph9460243859067683538.bin' '-w' '/tmp/graph9460243859067683538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9460243859067683538.bin' '-l' '-1' '-v' '-w' '/tmp/graph9460243859067683538.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:49:24] [INFO ] Decomposing Gal with order
[2024-05-20 23:49:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:49:24] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-20 23:49:24] [INFO ] Flatten gal took : 137 ms
[2024-05-20 23:49:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-20 23:49:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality6463952966198196676.gal : 24 ms
[2024-05-20 23:49:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality447652030219471491.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/CTLCardinality6463952966198196676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality447652030219471491.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.35897e+17,0.570793,16060,2033,20,27151,214,482,31428,35,458,0


Converting to forward existential form...Done !
original formula: EG(((i9.u73.p235==0) + (AX((i4.u14.p43==1)) * !(E(EG(((i9.u37.p123==0)||(i17.i0.u83.p258==1))) U (i12.i1.u49.p172==0))))))
=> equivalent forward existential formula: [FwdG(Init,((i9.u73.p235==0) + (!(EX(!((i4.u14.p43==1)))) * !(E(EG(((i9.u37.p123==0)||(i17.i0.u83.p258==1))) U (...189
Reverse transition relation is NOT exact ! Due to transitions t86, t89, t102, t129, t144, t151, t166, t218, t219, t220, t222, i0.t99, i0.i2.t101, i1.u28.t6...644
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 245 transition count 239
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 245 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 245 transition count 237
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 239 transition count 231
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 236 transition count 228
Applied a total of 48 rules in 28 ms. Remains 236 /259 variables (removed 23) and now considering 228/253 (removed 25) transitions.
// Phase 1: matrix 228 rows 236 cols
[2024-05-20 23:49:54] [INFO ] Computed 22 invariants in 4 ms
[2024-05-20 23:49:54] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-20 23:49:54] [INFO ] Invariant cache hit.
[2024-05-20 23:49:55] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-20 23:49:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 5 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 4 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 4 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 4 ms to minimize.
[2024-05-20 23:49:59] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 4 ms to minimize.
[2024-05-20 23:50:00] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 4 ms to minimize.
[2024-05-20 23:50:00] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 4 ms to minimize.
[2024-05-20 23:50:00] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 4 ms to minimize.
[2024-05-20 23:50:00] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 4 ms to minimize.
[2024-05-20 23:50:00] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 4 ms to minimize.
[2024-05-20 23:50:01] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:50:01] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-05-20 23:50:01] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 3 ms to minimize.
[2024-05-20 23:50:01] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-20 23:50:01] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 4 ms to minimize.
[2024-05-20 23:50:01] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 3 ms to minimize.
[2024-05-20 23:50:01] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-20 23:50:02] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-20 23:50:02] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 3 ms to minimize.
[2024-05-20 23:50:02] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:04] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-20 23:50:05] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 3 ms to minimize.
[2024-05-20 23:50:05] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 3 ms to minimize.
[2024-05-20 23:50:05] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 3 ms to minimize.
[2024-05-20 23:50:06] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:07] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:09] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:13] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:50:14] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
[2024-05-20 23:50:14] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:16] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (OVERLAPS) 228/464 variables, 236/289 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:22] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2024-05-20 23:50:23] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 3 ms to minimize.
[2024-05-20 23:50:23] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 292 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:27] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 3 ms to minimize.
[2024-05-20 23:50:27] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:50:28] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:50:28] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-20 23:50:29] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-20 23:50:29] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 3 ms to minimize.
[2024-05-20 23:50:29] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 3 ms to minimize.
[2024-05-20 23:50:29] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:31] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 4 ms to minimize.
[2024-05-20 23:50:32] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 228/464 variables, 236/302 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 227/529 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:36] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-20 23:50:36] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 4 ms to minimize.
[2024-05-20 23:50:37] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-05-20 23:50:37] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-20 23:50:49] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/464 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 534 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 49/49 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 236/259 places, 228/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60582 ms. Remains : 236/259 places, 228/253 transitions.
[2024-05-20 23:50:55] [INFO ] Flatten gal took : 19 ms
[2024-05-20 23:50:55] [INFO ] Flatten gal took : 16 ms
[2024-05-20 23:50:55] [INFO ] Input system was already deterministic with 228 transitions.
[2024-05-20 23:50:55] [INFO ] Flatten gal took : 13 ms
[2024-05-20 23:50:55] [INFO ] Flatten gal took : 13 ms
[2024-05-20 23:50:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality218173391057020635.gal : 4 ms
[2024-05-20 23:50:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality7445444817173977851.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/CTLCardinality218173391057020635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7445444817173977851.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.66746e+17,8.5769,174280,2,41704,5,594250,6,0,1174,1.06251e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:51:25] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:51:25] [INFO ] Applying decomposition
[2024-05-20 23:51:25] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8986672656668422995.txt' '-o' '/tmp/graph8986672656668422995.bin' '-w' '/tmp/graph8986672656668422995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8986672656668422995.bin' '-l' '-1' '-v' '-w' '/tmp/graph8986672656668422995.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:51:25] [INFO ] Decomposing Gal with order
[2024-05-20 23:51:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:51:25] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-20 23:51:25] [INFO ] Flatten gal took : 53 ms
[2024-05-20 23:51:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-20 23:51:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality471283236998621818.gal : 25 ms
[2024-05-20 23:51:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality10938451927034783561.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/CTLCardinality471283236998621818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10938451927034783561.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.66746e+17,0.217631,10520,1267,14,14569,179,489,18091,29,358,0


Converting to forward existential form...Done !
original formula: AF(AX((((i19.i0.u95.p286==0)&&(i3.u16.p51==1))||((i16.i1.u80.p240==0)&&(i10.u43.p153==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((i19.i0.u95.p286==0)&&(i3.u16.p51==1))||((i16.i1.u80.p240==0)&&(i10.u43.p153==1))))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t86, t89, t122, t129, t151, t166, t219, t220, t222, i0.t104, i0.t101, i0.i2.t103, i1.u9.t0, i...605
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 244 transition count 238
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 244 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 244 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 238 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 235 transition count 227
Applied a total of 50 rules in 26 ms. Remains 235 /259 variables (removed 24) and now considering 227/253 (removed 26) transitions.
// Phase 1: matrix 227 rows 235 cols
[2024-05-20 23:51:55] [INFO ] Computed 22 invariants in 4 ms
[2024-05-20 23:51:55] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-20 23:51:55] [INFO ] Invariant cache hit.
[2024-05-20 23:51:56] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-20 23:51:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:00] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 5 ms to minimize.
[2024-05-20 23:52:00] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 4 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 4 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 4 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 3 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 4 ms to minimize.
[2024-05-20 23:52:01] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 4 ms to minimize.
[2024-05-20 23:52:02] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 3 ms to minimize.
[2024-05-20 23:52:02] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 3 ms to minimize.
[2024-05-20 23:52:02] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-05-20 23:52:03] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-20 23:52:03] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:06] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-05-20 23:52:06] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 3 ms to minimize.
[2024-05-20 23:52:06] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-05-20 23:52:07] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 5 ms to minimize.
[2024-05-20 23:52:07] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-05-20 23:52:08] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 227/462 variables, 235/276 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/462 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 276 constraints, problems are : Problem set: 0 solved, 226 unsolved in 23729 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:22] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-20 23:52:22] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 3 ms to minimize.
[2024-05-20 23:52:22] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-05-20 23:52:23] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-20 23:52:23] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-05-20 23:52:23] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 3 ms to minimize.
[2024-05-20 23:52:23] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 3 ms to minimize.
[2024-05-20 23:52:23] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2024-05-20 23:52:24] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 3 ms to minimize.
[2024-05-20 23:52:24] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:26] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:52:26] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 3 ms to minimize.
[2024-05-20 23:52:26] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-05-20 23:52:26] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:52:26] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 4 ms to minimize.
[2024-05-20 23:52:26] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 4 ms to minimize.
[2024-05-20 23:52:27] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-20 23:52:27] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-20 23:52:28] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:29] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 3 ms to minimize.
[2024-05-20 23:52:29] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 3 ms to minimize.
[2024-05-20 23:52:29] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:31] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:33] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:36] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 227/462 variables, 235/301 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 226/527 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:52:40] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-20 23:52:40] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-20 23:52:41] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-20 23:52:41] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 226 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 1)
(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 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 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(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 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 531 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 48/48 constraints]
After SMT, in 53805ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 53810ms
Starting structural reductions in LTL mode, iteration 1 : 235/259 places, 227/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54337 ms. Remains : 235/259 places, 227/253 transitions.
[2024-05-20 23:52:50] [INFO ] Flatten gal took : 12 ms
[2024-05-20 23:52:50] [INFO ] Flatten gal took : 15 ms
[2024-05-20 23:52:50] [INFO ] Input system was already deterministic with 227 transitions.
[2024-05-20 23:52:50] [INFO ] Flatten gal took : 11 ms
[2024-05-20 23:52:50] [INFO ] Flatten gal took : 11 ms
[2024-05-20 23:52:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14261839975278359.gal : 14 ms
[2024-05-20 23:52:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11161512730153762443.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/CTLCardinality14261839975278359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11161512730153762443.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,4.53577e+17,6.2557,123816,2,49776,5,432401,6,0,1169,725230,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:53:20] [INFO ] Flatten gal took : 15 ms
[2024-05-20 23:53:20] [INFO ] Applying decomposition
[2024-05-20 23:53:20] [INFO ] Flatten gal took : 18 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/graph8936463992510383441.txt' '-o' '/tmp/graph8936463992510383441.bin' '-w' '/tmp/graph8936463992510383441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8936463992510383441.bin' '-l' '-1' '-v' '-w' '/tmp/graph8936463992510383441.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:53:20] [INFO ] Decomposing Gal with order
[2024-05-20 23:53:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:53:20] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-20 23:53:20] [INFO ] Flatten gal took : 17 ms
[2024-05-20 23:53:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-20 23:53:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality8548698314109885389.gal : 17 ms
[2024-05-20 23:53:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1568215301187273925.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/CTLCardinality8548698314109885389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1568215301187273925.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,4.53577e+17,0.433143,13676,1987,16,21749,216,498,23043,36,415,0


Converting to forward existential form...Done !
original formula: AX(EG(EF((i2.u6.p27==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U (i2.u6.p27==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t86, t89, t120, t127, t149, t164, t218, t219, t221, i0.t73, i0.i1.t75, i1.t102, i1.t99, ...602
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 243 transition count 237
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 243 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 243 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 236 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 233 transition count 225
Applied a total of 54 rules in 14 ms. Remains 233 /259 variables (removed 26) and now considering 225/253 (removed 28) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-20 23:53:50] [INFO ] Computed 22 invariants in 2 ms
[2024-05-20 23:53:50] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-20 23:53:50] [INFO ] Invariant cache hit.
[2024-05-20 23:53:50] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-20 23:53:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:53:54] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 5 ms to minimize.
[2024-05-20 23:53:55] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 3 ms to minimize.
[2024-05-20 23:53:55] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 3 ms to minimize.
[2024-05-20 23:53:55] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 4 ms to minimize.
[2024-05-20 23:53:55] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 4 ms to minimize.
[2024-05-20 23:53:55] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 4 ms to minimize.
[2024-05-20 23:53:56] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 4 ms to minimize.
[2024-05-20 23:53:56] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 3 ms to minimize.
[2024-05-20 23:53:56] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 3 ms to minimize.
[2024-05-20 23:53:56] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
[2024-05-20 23:53:56] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 3 ms to minimize.
[2024-05-20 23:53:56] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-05-20 23:53:57] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 ms to minimize.
[2024-05-20 23:53:57] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-20 23:53:57] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-20 23:53:57] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:53:57] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-20 23:53:57] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 3 ms to minimize.
[2024-05-20 23:53:57] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:53:58] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 3 ms to minimize.
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-20 23:54:00] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 3 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-20 23:54:01] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-20 23:54:02] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-20 23:54:02] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:54:02] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:54:03] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-20 23:54:03] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:54:03] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-20 23:54:03] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27692 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:54:24] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 4 ms to minimize.
[2024-05-20 23:54:25] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2024-05-20 23:54:25] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2024-05-20 23:54:25] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-05-20 23:54:25] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 3 ms to minimize.
[2024-05-20 23:54:26] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:54:32] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 4 ms to minimize.
[2024-05-20 23:54:32] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-20 23:54:33] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:54:33] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
[2024-05-20 23:54:33] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 3 ms to minimize.
[2024-05-20 23:54:33] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:54:41] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 57738ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 57741ms
Starting structural reductions in LTL mode, iteration 1 : 233/259 places, 225/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58217 ms. Remains : 233/259 places, 225/253 transitions.
[2024-05-20 23:54:48] [INFO ] Flatten gal took : 11 ms
[2024-05-20 23:54:48] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:54:48] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-20 23:54:48] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:54:48] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:54:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality18322919354742977131.gal : 4 ms
[2024-05-20 23:54:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality9333320286157265182.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/CTLCardinality18322919354742977131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9333320286157265182.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,4.14476e+17,3.88716,91508,2,38479,5,316411,6,0,1159,509810,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:55:18] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:55:18] [INFO ] Applying decomposition
[2024-05-20 23:55:18] [INFO ] Flatten gal took : 5 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/graph2129204988190447350.txt' '-o' '/tmp/graph2129204988190447350.bin' '-w' '/tmp/graph2129204988190447350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2129204988190447350.bin' '-l' '-1' '-v' '-w' '/tmp/graph2129204988190447350.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:55:18] [INFO ] Decomposing Gal with order
[2024-05-20 23:55:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:55:18] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-20 23:55:18] [INFO ] Flatten gal took : 35 ms
[2024-05-20 23:55:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 23:55:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4599636456352799767.gal : 5 ms
[2024-05-20 23:55:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality1119370910860968736.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/CTLCardinality4599636456352799767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1119370910860968736.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,4.14476e+17,0.18409,7876,1084,14,8337,177,494,9207,29,337,0


Converting to forward existential form...Done !
original formula: AF(EG(A(AX((((i18.i1.u76.p222==0)||(i0.i0.u2.p6==1))||((i16.i0.u89.p272==0)||(i11.u88.p268==1)))) U EF((i7.u91.p280==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((E(!(E(TRUE U (i7.u91.p280==0))) U (!(!(EX(!((((i18.i1.u76.p222==0)||(i0.i0.u2.p6==1))||((i16....279
Reverse transition relation is NOT exact ! Due to transitions t85, t88, t119, t126, t141, t163, t216, t217, t219, i0.t101, i0.t98, i0.i2.t100, i1.u7.t0, i1...590
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 244 transition count 238
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 244 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 244 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 238 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 235 transition count 227
Applied a total of 50 rules in 22 ms. Remains 235 /259 variables (removed 24) and now considering 227/253 (removed 26) transitions.
// Phase 1: matrix 227 rows 235 cols
[2024-05-20 23:55:49] [INFO ] Computed 22 invariants in 4 ms
[2024-05-20 23:55:49] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-20 23:55:49] [INFO ] Invariant cache hit.
[2024-05-20 23:55:49] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-20 23:55:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:55:52] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 4 ms to minimize.
[2024-05-20 23:55:53] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 4 ms to minimize.
[2024-05-20 23:55:53] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 4 ms to minimize.
[2024-05-20 23:55:53] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 4 ms to minimize.
[2024-05-20 23:55:53] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 4 ms to minimize.
[2024-05-20 23:55:53] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 4 ms to minimize.
[2024-05-20 23:55:54] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 3 ms to minimize.
[2024-05-20 23:55:54] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
[2024-05-20 23:55:54] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 4 ms to minimize.
[2024-05-20 23:55:54] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-05-20 23:55:54] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 3 ms to minimize.
[2024-05-20 23:55:54] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 4 ms to minimize.
[2024-05-20 23:55:54] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-20 23:55:55] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 9 ms to minimize.
[2024-05-20 23:55:55] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:55:55] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:55:55] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-05-20 23:55:55] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 3 ms to minimize.
[2024-05-20 23:55:56] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 3 ms to minimize.
[2024-05-20 23:55:56] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:55:58] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2024-05-20 23:55:58] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 3 ms to minimize.
[2024-05-20 23:55:58] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-20 23:55:59] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
[2024-05-20 23:55:59] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 3 ms to minimize.
[2024-05-20 23:55:59] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 3 ms to minimize.
[2024-05-20 23:55:59] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:55:59] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-05-20 23:55:59] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:55:59] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
[2024-05-20 23:56:00] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-20 23:56:00] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-20 23:56:00] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-05-20 23:56:00] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 4 ms to minimize.
[2024-05-20 23:56:01] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-20 23:56:01] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 227/462 variables, 235/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:56:10] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-20 23:56:11] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:56:11] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2024-05-20 23:56:11] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 3 ms to minimize.
[2024-05-20 23:56:11] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 3 ms to minimize.
[2024-05-20 23:56:12] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 3 ms to minimize.
[2024-05-20 23:56:12] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 3 ms to minimize.
[2024-05-20 23:56:12] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/462 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/462 variables, and 301 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 44/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:56:22] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:56:23] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 3 ms to minimize.
[2024-05-20 23:56:23] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:56:24] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:56:27] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:56:27] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 3 ms to minimize.
[2024-05-20 23:56:28] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 227/462 variables, 235/308 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 226/534 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:56:32] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-20 23:56:32] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 4 ms to minimize.
[2024-05-20 23:56:33] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:56:33] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:56:39] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:56:39] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-20 23:56:47] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 541 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 58/58 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 235/259 places, 227/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60487 ms. Remains : 235/259 places, 227/253 transitions.
[2024-05-20 23:56:49] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:56:49] [INFO ] Flatten gal took : 12 ms
[2024-05-20 23:56:49] [INFO ] Input system was already deterministic with 227 transitions.
[2024-05-20 23:56:49] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:56:49] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:56:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality15827149995602841053.gal : 4 ms
[2024-05-20 23:56:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality15895587556234707732.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/CTLCardinality15827149995602841053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15895587556234707732.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.52538e+17,5.61083,125456,2,51863,5,432107,6,0,1169,745548,0


Converting to forward existential form...Done !
original formula: AX((EF((p173==0)) * AG(((p96==0)||(p279==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (p173==0))))] = FALSE * [(FwdU(EY(Init),TRUE) * !(((p96==0)||(p279==1))))] = FALSE)
(forward)formula 0,0,9.26736,137864,1,0,10,492515,10,2,2287,867782,4
FORMULA AutoFlight-PT-03b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 243 transition count 237
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 243 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 243 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 236 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 234 transition count 226
Applied a total of 52 rules in 13 ms. Remains 234 /259 variables (removed 25) and now considering 226/253 (removed 27) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-05-20 23:56:58] [INFO ] Computed 22 invariants in 2 ms
[2024-05-20 23:56:59] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-20 23:56:59] [INFO ] Invariant cache hit.
[2024-05-20 23:56:59] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-20 23:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:01] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 4 ms to minimize.
[2024-05-20 23:57:02] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 4 ms to minimize.
[2024-05-20 23:57:02] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 3 ms to minimize.
[2024-05-20 23:57:02] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 3 ms to minimize.
[2024-05-20 23:57:02] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 4 ms to minimize.
[2024-05-20 23:57:02] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 4 ms to minimize.
[2024-05-20 23:57:03] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 3 ms to minimize.
[2024-05-20 23:57:03] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-20 23:57:03] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 3 ms to minimize.
[2024-05-20 23:57:03] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-05-20 23:57:03] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-20 23:57:03] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 4 ms to minimize.
[2024-05-20 23:57:03] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-20 23:57:04] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2024-05-20 23:57:04] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-05-20 23:57:04] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 3 ms to minimize.
[2024-05-20 23:57:04] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 3 ms to minimize.
[2024-05-20 23:57:05] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:57:05] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-20 23:57:05] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:07] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-20 23:57:07] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:57:08] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:08] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 3 ms to minimize.
[2024-05-20 23:57:09] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 3 ms to minimize.
[2024-05-20 23:57:09] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 3 ms to minimize.
[2024-05-20 23:57:09] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-20 23:57:09] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 3 ms to minimize.
[2024-05-20 23:57:09] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-20 23:57:10] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-20 23:57:10] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 3 ms to minimize.
[2024-05-20 23:57:10] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 3 ms to minimize.
[2024-05-20 23:57:11] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:12] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 3 ms to minimize.
[2024-05-20 23:57:12] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-20 23:57:12] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-20 23:57:12] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 3 ms to minimize.
[2024-05-20 23:57:12] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:15] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:17] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2024-05-20 23:57:17] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:57:18] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-20 23:57:18] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:19] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:23] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (OVERLAPS) 226/460 variables, 234/301 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:28] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-20 23:57:28] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 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 460/460 variables, and 303 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 47/69 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:31] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-05-20 23:57:31] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 3 ms to minimize.
[2024-05-20 23:57:31] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:57:32] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/460 variables, 234/307 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 225/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:36] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-05-20 23:57:36] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:41] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-05-20 23:57:41] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-20 23:57:54] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 2 ms to minimize.
[2024-05-20 23:57:54] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-20 23:57:55] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/460 variables, 3/539 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 539 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 58/58 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 234/259 places, 226/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60447 ms. Remains : 234/259 places, 226/253 transitions.
[2024-05-20 23:57:59] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:57:59] [INFO ] Flatten gal took : 10 ms
[2024-05-20 23:57:59] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-20 23:57:59] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:57:59] [INFO ] Flatten gal took : 9 ms
[2024-05-20 23:57:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality11226836891663550799.gal : 4 ms
[2024-05-20 23:57:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality10716651629241030820.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/CTLCardinality11226836891663550799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10716651629241030820.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.21698e+17,8.49218,164884,2,49843,5,560877,6,0,1164,987088,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 23:58:29] [INFO ] Flatten gal took : 8 ms
[2024-05-20 23:58:29] [INFO ] Applying decomposition
[2024-05-20 23:58:29] [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/graph9586823661113396850.txt' '-o' '/tmp/graph9586823661113396850.bin' '-w' '/tmp/graph9586823661113396850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9586823661113396850.bin' '-l' '-1' '-v' '-w' '/tmp/graph9586823661113396850.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:58:29] [INFO ] Decomposing Gal with order
[2024-05-20 23:58:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:58:29] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-20 23:58:29] [INFO ] Flatten gal took : 33 ms
[2024-05-20 23:58:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-20 23:58:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality8299532354143450783.gal : 7 ms
[2024-05-20 23:58:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1635481668108836691.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/CTLCardinality8299532354143450783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1635481668108836691.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,4.21698e+17,0.323408,9736,1550,14,13902,187,494,12536,30,429,0


Converting to forward existential form...Done !
original formula: EG(A(EX(AF(AG((i13.i2.u67.p219==0)))) U (i12.u26.p78==1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((i12.u26.p78==1)) U (!(EX(!(EG(!(!(E(TRUE U !((i13.i2.u67.p219==0))))))))) * !((i12.u26.p78==1...198
Reverse transition relation is NOT exact ! Due to transitions t75, t98, t101, t126, t149, t164, t217, t218, t220, i0.t72, i0.i2.t74, i1.t88, i1.t85, i1.i2....612
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 243 transition count 237
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 243 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 243 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 236 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 233 transition count 225
Applied a total of 54 rules in 12 ms. Remains 233 /259 variables (removed 26) and now considering 225/253 (removed 28) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-20 23:58:59] [INFO ] Computed 22 invariants in 2 ms
[2024-05-20 23:58:59] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-20 23:58:59] [INFO ] Invariant cache hit.
[2024-05-20 23:59:00] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-20 23:59:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:59:03] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 3 ms to minimize.
[2024-05-20 23:59:03] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 3 ms to minimize.
[2024-05-20 23:59:03] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 3 ms to minimize.
[2024-05-20 23:59:03] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 4 ms to minimize.
[2024-05-20 23:59:04] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 4 ms to minimize.
[2024-05-20 23:59:04] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 4 ms to minimize.
[2024-05-20 23:59:04] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
[2024-05-20 23:59:04] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 3 ms to minimize.
[2024-05-20 23:59:04] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:59:04] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-20 23:59:05] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 4 ms to minimize.
[2024-05-20 23:59:05] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-20 23:59:05] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-05-20 23:59:05] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 3 ms to minimize.
[2024-05-20 23:59:05] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-20 23:59:06] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-05-20 23:59:06] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-20 23:59:06] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:59:06] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-20 23:59:06] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:59:08] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-05-20 23:59:08] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-05-20 23:59:08] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-20 23:59:08] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-05-20 23:59:08] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 3 ms to minimize.
[2024-05-20 23:59:09] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 3 ms to minimize.
[2024-05-20 23:59:09] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 3 ms to minimize.
[2024-05-20 23:59:09] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 3 ms to minimize.
[2024-05-20 23:59:09] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-20 23:59:09] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:59:10] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
[2024-05-20 23:59:10] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 3 ms to minimize.
[2024-05-20 23:59:10] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-20 23:59:10] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 22253 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:59:26] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-20 23:59:27] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 3 ms to minimize.
[2024-05-20 23:59:27] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:59:27] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-20 23:59:27] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 3 ms to minimize.
[2024-05-20 23:59:27] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:59:32] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-20 23:59:33] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-20 23:59:33] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-20 23:59:33] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-05-20 23:59:34] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-20 23:59:34] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-20 23:59:41] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 52310ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 52314ms
Starting structural reductions in LTL mode, iteration 1 : 233/259 places, 225/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52683 ms. Remains : 233/259 places, 225/253 transitions.
[2024-05-20 23:59:52] [INFO ] Flatten gal took : 6 ms
[2024-05-20 23:59:52] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:59:52] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-20 23:59:52] [INFO ] Flatten gal took : 7 ms
[2024-05-20 23:59:52] [INFO ] Flatten gal took : 5 ms
[2024-05-20 23:59:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14181141097573951374.gal : 2 ms
[2024-05-20 23:59:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality13330394546361499512.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/CTLCardinality14181141097573951374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13330394546361499512.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.14476e+17,4.48476,90356,2,38479,5,316411,6,0,1159,509810,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:00:22] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:00:22] [INFO ] Applying decomposition
[2024-05-21 00:00:22] [INFO ] Flatten gal took : 5 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/graph16263241893697106184.txt' '-o' '/tmp/graph16263241893697106184.bin' '-w' '/tmp/graph16263241893697106184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16263241893697106184.bin' '-l' '-1' '-v' '-w' '/tmp/graph16263241893697106184.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:00:22] [INFO ] Decomposing Gal with order
[2024-05-21 00:00:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:00:22] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-21 00:00:22] [INFO ] Flatten gal took : 22 ms
[2024-05-21 00:00:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 00:00:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5049868945307532045.gal : 6 ms
[2024-05-21 00:00:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality15605958852548013672.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/CTLCardinality5049868945307532045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15605958852548013672.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,4.14476e+17,0.273366,8932,1297,16,11170,199,502,11124,35,427,0


Converting to forward existential form...Done !
original formula: EF(AX(AX(AF((i4.u17.p51==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(EG(!((i4.u17.p51==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t75, t85, t88, t98, t101, t119, t126, t141, t148, t163, t216, t217, t219, i0.t72, i0.i2.t74, ...584
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 258 transition count 163
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 101 rules applied. Total rules applied 190 place count 169 transition count 151
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 196 place count 163 transition count 151
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 196 place count 163 transition count 117
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 264 place count 129 transition count 117
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 274 place count 119 transition count 107
Iterating global reduction 3 with 10 rules applied. Total rules applied 284 place count 119 transition count 107
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 284 place count 119 transition count 102
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 294 place count 114 transition count 102
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 366 place count 78 transition count 66
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 371 place count 78 transition count 61
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 381 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 382 place count 72 transition count 55
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 387 place count 68 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 67 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 388 place count 67 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 394 place count 64 transition count 51
Applied a total of 394 rules in 46 ms. Remains 64 /259 variables (removed 195) and now considering 51/253 (removed 202) transitions.
// Phase 1: matrix 51 rows 64 cols
[2024-05-21 00:00:52] [INFO ] Computed 18 invariants in 2 ms
[2024-05-21 00:00:52] [INFO ] Implicit Places using invariants in 76 ms returned [26, 37, 48, 53, 57, 63]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 78 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/259 places, 51/253 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 52 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 51 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 51 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 50 transition count 43
Applied a total of 16 rules in 8 ms. Remains 50 /58 variables (removed 8) and now considering 43/51 (removed 8) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-05-21 00:00:52] [INFO ] Computed 12 invariants in 0 ms
[2024-05-21 00:00:52] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 00:00:52] [INFO ] Invariant cache hit.
[2024-05-21 00:00:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 00:00:52] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 50/259 places, 43/253 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 256 ms. Remains : 50/259 places, 43/253 transitions.
[2024-05-21 00:00:52] [INFO ] Flatten gal took : 1 ms
[2024-05-21 00:00:52] [INFO ] Flatten gal took : 2 ms
[2024-05-21 00:00:52] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-21 00:00:52] [INFO ] Flatten gal took : 1 ms
[2024-05-21 00:00:52] [INFO ] Flatten gal took : 1 ms
[2024-05-21 00:00:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7127872899124618304.gal : 1 ms
[2024-05-21 00:00:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality14322438820753162882.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/CTLCardinality7127872899124618304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14322438820753162882.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,228096,0.013875,3652,2,191,5,1252,6,0,240,1204,0


Converting to forward existential form...Done !
original formula: AG(EF((p71==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p71==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t42, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...169
(forward)formula 0,1,0.071527,5556,1,0,87,12109,107,39,1376,8999,96
FORMULA AutoFlight-PT-03b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 244 transition count 238
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 244 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 244 transition count 236
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 237 transition count 229
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 234 transition count 226
Applied a total of 52 rules in 35 ms. Remains 234 /259 variables (removed 25) and now considering 226/253 (removed 27) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-05-21 00:00:53] [INFO ] Computed 22 invariants in 3 ms
[2024-05-21 00:00:53] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 00:00:53] [INFO ] Invariant cache hit.
[2024-05-21 00:00:53] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 00:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:00:57] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 5 ms to minimize.
[2024-05-21 00:00:57] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 4 ms to minimize.
[2024-05-21 00:00:57] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 4 ms to minimize.
[2024-05-21 00:00:57] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2024-05-21 00:00:57] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 4 ms to minimize.
[2024-05-21 00:00:58] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-05-21 00:00:58] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-21 00:00:58] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 00:00:58] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 4 ms to minimize.
[2024-05-21 00:00:58] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 4 ms to minimize.
[2024-05-21 00:00:58] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 3 ms to minimize.
[2024-05-21 00:00:58] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-21 00:00:59] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:00:59] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 3 ms to minimize.
[2024-05-21 00:00:59] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 3 ms to minimize.
[2024-05-21 00:01:00] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:01:02] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:01:04] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-21 00:01:04] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-05-21 00:01:04] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-21 00:01:04] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 3 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 3 ms to minimize.
[2024-05-21 00:01:05] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-21 00:01:06] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:01:06] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 3 ms to minimize.
[2024-05-21 00:01:06] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-21 00:01:07] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
[2024-05-21 00:01:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-21 00:01:07] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:01:08] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:01:11] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-21 00:01:11] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-21 00:01:12] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:01:13] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 3 ms to minimize.
[2024-05-21 00:01:13] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 4 ms to minimize.
[2024-05-21 00:01:13] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-05-21 00:01:13] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 226/460 variables, 234/299 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:01:17] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-05-21 00:01:18] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:01:20] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-21 00:01:20] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2024-05-21 00:01:20] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 304 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/460 variables, 234/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 225/529 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 00:01:27] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 4 ms to minimize.
[2024-05-21 00:01:27] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 3 ms to minimize.
[2024-05-21 00:01:28] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 4 ms to minimize.
[2024-05-21 00:01:28] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-05-21 00:01:30] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 5/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/460 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 534 constraints, problems are : Problem set: 0 solved, 225 unsolved in 22019 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 53/53 constraints]
After SMT, in 52073ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 52080ms
Starting structural reductions in LTL mode, iteration 1 : 234/259 places, 226/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52651 ms. Remains : 234/259 places, 226/253 transitions.
[2024-05-21 00:01:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:01:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:01:45] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-21 00:01:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:01:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:01:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2373992693351754842.gal : 2 ms
[2024-05-21 00:01:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality2369030843097981732.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/CTLCardinality2373992693351754842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2369030843097981732.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.29521e+17,7.09741,153616,2,52089,5,501066,6,0,1164,947207,0


Converting to forward existential form...Done !
original formula: EX(((p112==0)&&(p205==1)))
=> equivalent forward existential formula: [(EY(Init) * ((p112==0)&&(p205==1)))] != FALSE
(forward)formula 0,0,7.15784,153616,1,0,8,501066,8,1,1418,947207,2
FORMULA AutoFlight-PT-03b-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 258 transition count 165
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 96 rules applied. Total rules applied 183 place count 171 transition count 156
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 189 place count 167 transition count 154
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 193 place count 165 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 194 place count 164 transition count 152
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 194 place count 164 transition count 120
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 258 place count 132 transition count 120
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 267 place count 123 transition count 111
Iterating global reduction 5 with 9 rules applied. Total rules applied 276 place count 123 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 276 place count 123 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 284 place count 119 transition count 107
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 356 place count 83 transition count 71
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 361 place count 83 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 371 place count 78 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 372 place count 77 transition count 60
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 377 place count 73 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 378 place count 72 transition count 59
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 378 place count 72 transition count 56
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 384 place count 69 transition count 56
Applied a total of 384 rules in 65 ms. Remains 69 /259 variables (removed 190) and now considering 56/253 (removed 197) transitions.
// Phase 1: matrix 56 rows 69 cols
[2024-05-21 00:01:52] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 00:01:53] [INFO ] Implicit Places using invariants in 100 ms returned [30, 41, 52, 57, 62, 68]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 102 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/259 places, 56/253 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 58 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 58 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 57 transition count 50
Applied a total of 12 rules in 13 ms. Remains 57 /63 variables (removed 6) and now considering 50/56 (removed 6) transitions.
// Phase 1: matrix 50 rows 57 cols
[2024-05-21 00:01:53] [INFO ] Computed 12 invariants in 0 ms
[2024-05-21 00:01:53] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 00:01:53] [INFO ] Invariant cache hit.
[2024-05-21 00:01:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 00:01:53] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/259 places, 50/253 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 413 ms. Remains : 57/259 places, 50/253 transitions.
[2024-05-21 00:01:53] [INFO ] Flatten gal took : 3 ms
[2024-05-21 00:01:53] [INFO ] Flatten gal took : 2 ms
[2024-05-21 00:01:53] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-21 00:01:53] [INFO ] Flatten gal took : 2 ms
[2024-05-21 00:01:53] [INFO ] Flatten gal took : 2 ms
[2024-05-21 00:01:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality16507341628722142009.gal : 1 ms
[2024-05-21 00:01:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10959747539036694976.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/CTLCardinality16507341628722142009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10959747539036694976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00224e+06,0.031393,4020,2,196,5,2319,6,0,278,2445,0


Converting to forward existential form...Done !
original formula: AF((EF(((p262==1)&&((p124==0)||(p31==1)))) * AG(!(E((p31==1) U ((p104==0)||(p144==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((p262==1)&&((p124==0)||(p31==1)))) * !(E(TRUE U !(!(E((p31==1) U ((p104==0)||(p144==1)))...171
Reverse transition relation is NOT exact ! Due to transitions t0, t12, t48, t49, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,0,0.158786,6396,1,0,112,16237,130,56,1713,15295,128
FORMULA AutoFlight-PT-03b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 243 transition count 237
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 243 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 243 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 236 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 233 transition count 225
Applied a total of 54 rules in 44 ms. Remains 233 /259 variables (removed 26) and now considering 225/253 (removed 28) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-21 00:01:53] [INFO ] Computed 22 invariants in 6 ms
[2024-05-21 00:01:53] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 00:01:53] [INFO ] Invariant cache hit.
[2024-05-21 00:01:53] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-21 00:01:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:01:57] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 5 ms to minimize.
[2024-05-21 00:01:58] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 4 ms to minimize.
[2024-05-21 00:01:58] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 3 ms to minimize.
[2024-05-21 00:01:58] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 4 ms to minimize.
[2024-05-21 00:01:58] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-05-21 00:01:58] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 4 ms to minimize.
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 3 ms to minimize.
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 3 ms to minimize.
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 4 ms to minimize.
[2024-05-21 00:01:59] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-05-21 00:02:00] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-05-21 00:02:00] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 4 ms to minimize.
[2024-05-21 00:02:00] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:02:00] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 3 ms to minimize.
[2024-05-21 00:02:00] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
[2024-05-21 00:02:00] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 3 ms to minimize.
[2024-05-21 00:02:01] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-21 00:02:01] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:02:03] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
[2024-05-21 00:02:03] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 3 ms to minimize.
[2024-05-21 00:02:03] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-21 00:02:04] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 3 ms to minimize.
[2024-05-21 00:02:04] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2024-05-21 00:02:04] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-05-21 00:02:04] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
[2024-05-21 00:02:05] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
[2024-05-21 00:02:05] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-21 00:02:05] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:02:06] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-21 00:02:06] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 3 ms to minimize.
[2024-05-21 00:02:06] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 3 ms to minimize.
[2024-05-21 00:02:06] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27407 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:02:26] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 6 ms to minimize.
[2024-05-21 00:02:27] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:02:27] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
[2024-05-21 00:02:27] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-05-21 00:02:27] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 3 ms to minimize.
[2024-05-21 00:02:28] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:02:34] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-21 00:02:34] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 3 ms to minimize.
[2024-05-21 00:02:35] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 3 ms to minimize.
[2024-05-21 00:02:35] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-21 00:02:35] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-21 00:02:35] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:02:44] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 57459ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 57464ms
Starting structural reductions in LTL mode, iteration 1 : 233/259 places, 225/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57890 ms. Remains : 233/259 places, 225/253 transitions.
[2024-05-21 00:02:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:02:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:02:51] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-21 00:02:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:02:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:02:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality9289325167112011284.gal : 1 ms
[2024-05-21 00:02:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3716398460509986006.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/CTLCardinality9289325167112011284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3716398460509986006.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.14476e+17,4.31374,90936,2,38479,5,316411,6,0,1159,509810,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:03:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:03:21] [INFO ] Applying decomposition
[2024-05-21 00:03:21] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14234689225828884447.txt' '-o' '/tmp/graph14234689225828884447.bin' '-w' '/tmp/graph14234689225828884447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14234689225828884447.bin' '-l' '-1' '-v' '-w' '/tmp/graph14234689225828884447.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:03:21] [INFO ] Decomposing Gal with order
[2024-05-21 00:03:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:03:21] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-21 00:03:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 00:03:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 00:03:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality9090128882308407195.gal : 8 ms
[2024-05-21 00:03:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality4841734296726372198.ctl : 15 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/CTLCardinality9090128882308407195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4841734296726372198.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,4.14476e+17,0.131501,7584,1107,13,7631,191,491,7862,28,366,0


Converting to forward existential form...Done !
original formula: (EX(((i11.u81.p250==0)||(i4.u7.p24==1))) * EF(EX((i17.i0.u63.p214==1))))
=> equivalent forward existential formula: [(EY(FwdU((Init * EX(((i11.u81.p250==0)||(i4.u7.p24==1)))),TRUE)) * (i17.i0.u63.p214==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t72, t75, t85, t88, t98, t101, t119, t126, t148, t163, t216, t217, t219, i1.t115, i1.u35.t112...573
(forward)formula 0,1,1.04399,42432,1,0,99866,191,2842,105138,123,379,300265
FORMULA AutoFlight-PT-03b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 258 transition count 166
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 98 rules applied. Total rules applied 184 place count 172 transition count 154
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 191 place count 166 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 192 place count 165 transition count 153
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 192 place count 165 transition count 118
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 262 place count 130 transition count 118
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 272 place count 120 transition count 108
Iterating global reduction 4 with 10 rules applied. Total rules applied 282 place count 120 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 282 place count 120 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 290 place count 116 transition count 104
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 362 place count 80 transition count 68
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 367 place count 80 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 377 place count 75 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 378 place count 74 transition count 57
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 383 place count 70 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 384 place count 69 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 384 place count 69 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 390 place count 66 transition count 53
Applied a total of 390 rules in 35 ms. Remains 66 /259 variables (removed 193) and now considering 53/253 (removed 200) transitions.
// Phase 1: matrix 53 rows 66 cols
[2024-05-21 00:03:22] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 00:03:22] [INFO ] Implicit Places using invariants in 71 ms returned [26, 37, 50, 55, 59, 65]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 86 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/259 places, 53/253 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 55 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 55 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 54 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 53 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 52 transition count 45
Applied a total of 16 rules in 9 ms. Remains 52 /60 variables (removed 8) and now considering 45/53 (removed 8) transitions.
// Phase 1: matrix 45 rows 52 cols
[2024-05-21 00:03:22] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 00:03:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 00:03:22] [INFO ] Invariant cache hit.
[2024-05-21 00:03:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 00:03:22] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 52/259 places, 45/253 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 275 ms. Remains : 52/259 places, 45/253 transitions.
[2024-05-21 00:03:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 00:03:22] [INFO ] Flatten gal took : 1 ms
[2024-05-21 00:03:22] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-21 00:03:22] [INFO ] Flatten gal took : 1 ms
[2024-05-21 00:03:22] [INFO ] Flatten gal took : 1 ms
[2024-05-21 00:03:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6913942312402967972.gal : 1 ms
[2024-05-21 00:03:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality17841264134802966063.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/CTLCardinality6913942312402967972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17841264134802966063.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,221184,0.012511,3668,2,171,5,1111,6,0,250,1107,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(!(A(((p205==0)||(p90==1)) U (p229==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(!(!((E(!((p229==1)) U (!(((p205==0)||(p90==1))) * !((p229==1)))) + E...188
Reverse transition relation is NOT exact ! Due to transitions t42, t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...169
(forward)formula 0,1,0.417302,18040,1,0,324,89289,122,161,1500,92629,479
FORMULA AutoFlight-PT-03b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 248 transition count 242
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 248 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 248 transition count 241
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 243 transition count 236
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 243 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 242 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 242 transition count 235
Applied a total of 35 rules in 14 ms. Remains 242 /259 variables (removed 17) and now considering 235/253 (removed 18) transitions.
// Phase 1: matrix 235 rows 242 cols
[2024-05-21 00:03:23] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 00:03:23] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 00:03:23] [INFO ] Invariant cache hit.
[2024-05-21 00:03:23] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-21 00:03:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:27] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-21 00:03:27] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-21 00:03:27] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-21 00:03:28] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-21 00:03:28] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-21 00:03:28] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 3 ms to minimize.
[2024-05-21 00:03:28] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 3 ms to minimize.
[2024-05-21 00:03:28] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 3 ms to minimize.
[2024-05-21 00:03:28] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-21 00:03:28] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-21 00:03:28] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-21 00:03:28] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 00:03:29] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:03:29] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:03:29] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:03:29] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-21 00:03:29] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-21 00:03:29] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 00:03:29] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 3 ms to minimize.
[2024-05-21 00:03:30] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:31] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
[2024-05-21 00:03:31] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-21 00:03:32] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 3 ms to minimize.
[2024-05-21 00:03:32] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 3 ms to minimize.
[2024-05-21 00:03:32] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:03:33] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 00:03:33] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-21 00:03:33] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:34] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 3 ms to minimize.
[2024-05-21 00:03:34] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-21 00:03:35] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-21 00:03:35] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:36] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-05-21 00:03:36] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-05-21 00:03:37] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 3 ms to minimize.
[2024-05-21 00:03:37] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 3 ms to minimize.
[2024-05-21 00:03:37] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:40] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-05-21 00:03:41] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-21 00:03:41] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:42] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:44] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:48] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 3 ms to minimize.
[2024-05-21 00:03:48] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-21 00:03:50] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:51] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-21 00:03:51] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-05-21 00:03:51] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.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 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.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 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.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 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/477 variables, and 70 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/242 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:03:56] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-21 00:03:57] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 235/477 variables, 242/314 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 234/548 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:04:02] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-21 00:04:02] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-21 00:04:03] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-05-21 00:04:03] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 3 ms to minimize.
[2024-05-21 00:04:03] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 3 ms to minimize.
[2024-05-21 00:04:07] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 6/554 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 00:04:09] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-21 00:04:09] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 556 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 58/58 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 242/259 places, 235/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60504 ms. Remains : 242/259 places, 235/253 transitions.
[2024-05-21 00:04:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:04:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:04:23] [INFO ] Input system was already deterministic with 235 transitions.
[2024-05-21 00:04:23] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:04:23] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:04:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality18029906367758430631.gal : 1 ms
[2024-05-21 00:04:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality18328266379083066592.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/CTLCardinality18029906367758430631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18328266379083066592.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.11911e+17,10.8642,227344,2,60754,5,783929,6,0,1205,1.39704e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:04:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:04:53] [INFO ] Applying decomposition
[2024-05-21 00:04:53] [INFO ] Flatten gal took : 5 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/graph11231112293055736777.txt' '-o' '/tmp/graph11231112293055736777.bin' '-w' '/tmp/graph11231112293055736777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11231112293055736777.bin' '-l' '-1' '-v' '-w' '/tmp/graph11231112293055736777.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:04:53] [INFO ] Decomposing Gal with order
[2024-05-21 00:04:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:04:54] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-21 00:04:54] [INFO ] Flatten gal took : 13 ms
[2024-05-21 00:04:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 00:04:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality18256743460695639129.gal : 3 ms
[2024-05-21 00:04:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality15681787125974512076.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/CTLCardinality18256743460695639129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15681787125974512076.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.11911e+17,0.537593,19044,2293,14,32179,185,514,45237,31,374,0


Converting to forward existential form...Done !
original formula: AF(((EF((i19.u100.p292==1)) * EG((E(((i13.u52.p175==0)||(i10.i1.u37.p129==1)) U ((i12.u42.p147==0)||(i2.u81.p246==1))) + ((i10.i2.u38.p13...419
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U (i19.u100.p292==1)) * EG((E(((i13.u52.p175==0)||(i10.i1.u37.p129==1)) U ((i12.u42.p147==...494
Reverse transition relation is NOT exact ! Due to transitions t77, t102, t105, t127, t134, t149, t156, t171, t226, t227, i0.t92, i0.t89, i0.i2.t91, i1.u17....653
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 259/259 places, 253/253 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 258 transition count 164
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 100 rules applied. Total rules applied 188 place count 170 transition count 152
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 194 place count 164 transition count 152
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 194 place count 164 transition count 117
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 264 place count 129 transition count 117
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 273 place count 120 transition count 108
Iterating global reduction 3 with 9 rules applied. Total rules applied 282 place count 120 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 282 place count 120 transition count 104
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 290 place count 116 transition count 104
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 364 place count 79 transition count 67
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 369 place count 79 transition count 62
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 379 place count 74 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 380 place count 73 transition count 56
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 385 place count 69 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 386 place count 68 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 386 place count 68 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 392 place count 65 transition count 52
Applied a total of 392 rules in 28 ms. Remains 65 /259 variables (removed 194) and now considering 52/253 (removed 201) transitions.
// Phase 1: matrix 52 rows 65 cols
[2024-05-21 00:05:24] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 00:05:24] [INFO ] Implicit Places using invariants in 106 ms returned [27, 38, 49, 54, 58, 64]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 114 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/259 places, 52/253 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 48
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 54 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 52 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 51 transition count 44
Applied a total of 16 rules in 18 ms. Remains 51 /59 variables (removed 8) and now considering 44/52 (removed 8) transitions.
// Phase 1: matrix 44 rows 51 cols
[2024-05-21 00:05:24] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 00:05:24] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 00:05:24] [INFO ] Invariant cache hit.
[2024-05-21 00:05:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 00:05:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/259 places, 44/253 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 366 ms. Remains : 51/259 places, 44/253 transitions.
[2024-05-21 00:05:24] [INFO ] Flatten gal took : 1 ms
[2024-05-21 00:05:24] [INFO ] Flatten gal took : 2 ms
[2024-05-21 00:05:24] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-21 00:05:24] [INFO ] Flatten gal took : 1 ms
[2024-05-21 00:05:24] [INFO ] Flatten gal took : 1 ms
[2024-05-21 00:05:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4497069418410546618.gal : 1 ms
[2024-05-21 00:05:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7698392075799249447.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4497069418410546618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7698392075799249447.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 227 steps (11 resets) in 7 ms. (28 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-03b-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 253/253 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 243 transition count 237
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 243 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 243 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 236 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 233 transition count 225
Applied a total of 54 rules in 15 ms. Remains 233 /259 variables (removed 26) and now considering 225/253 (removed 28) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-21 00:05:24] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 00:05:24] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 00:05:24] [INFO ] Invariant cache hit.
[2024-05-21 00:05:24] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-21 00:05:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:05:28] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 5 ms to minimize.
[2024-05-21 00:05:29] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 4 ms to minimize.
[2024-05-21 00:05:29] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 4 ms to minimize.
[2024-05-21 00:05:29] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 3 ms to minimize.
[2024-05-21 00:05:29] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 3 ms to minimize.
[2024-05-21 00:05:29] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-21 00:05:29] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-05-21 00:05:30] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 3 ms to minimize.
[2024-05-21 00:05:30] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-05-21 00:05:30] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-21 00:05:30] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 3 ms to minimize.
[2024-05-21 00:05:30] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:05:30] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:05:30] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-21 00:05:31] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 3 ms to minimize.
[2024-05-21 00:05:31] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 3 ms to minimize.
[2024-05-21 00:05:31] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 3 ms to minimize.
[2024-05-21 00:05:31] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 3 ms to minimize.
[2024-05-21 00:05:31] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 3 ms to minimize.
[2024-05-21 00:05:31] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:05:34] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:05:34] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 3 ms to minimize.
[2024-05-21 00:05:34] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-05-21 00:05:34] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 2 ms to minimize.
[2024-05-21 00:05:34] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-21 00:05:34] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-21 00:05:35] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 3 ms to minimize.
[2024-05-21 00:05:35] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-21 00:05:35] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-21 00:05:35] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:05:36] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 3 ms to minimize.
[2024-05-21 00:05:36] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-05-21 00:05:36] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-21 00:05:36] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 289 constraints, problems are : Problem set: 0 solved, 224 unsolved in 26056 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/458 variables, 233/289 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 224/513 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:05:56] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 4 ms to minimize.
[2024-05-21 00:05:57] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-21 00:05:57] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:05:57] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-21 00:05:57] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 3 ms to minimize.
[2024-05-21 00:05:58] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:06:04] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-05-21 00:06:04] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-21 00:06:05] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 3 ms to minimize.
[2024-05-21 00:06:05] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 3 ms to minimize.
[2024-05-21 00:06:05] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 3 ms to minimize.
[2024-05-21 00:06:05] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 6/525 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 00:06:13] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 526 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 47/47 constraints]
After SMT, in 56119ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 56124ms
Starting structural reductions in LTL mode, iteration 1 : 233/259 places, 225/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56597 ms. Remains : 233/259 places, 225/253 transitions.
[2024-05-21 00:06:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:06:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 00:06:21] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-21 00:06:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:06:21] [INFO ] Flatten gal took : 23 ms
[2024-05-21 00:06:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality17226396882354542450.gal : 4 ms
[2024-05-21 00:06:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality16480046113870669544.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/CTLCardinality17226396882354542450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16480046113870669544.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.14476e+17,4.13929,91124,2,38479,5,316411,6,0,1159,509810,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:06:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:06:51] [INFO ] Applying decomposition
[2024-05-21 00:06:51] [INFO ] Flatten gal took : 4 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/graph17801049596020855955.txt' '-o' '/tmp/graph17801049596020855955.bin' '-w' '/tmp/graph17801049596020855955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17801049596020855955.bin' '-l' '-1' '-v' '-w' '/tmp/graph17801049596020855955.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:06:51] [INFO ] Decomposing Gal with order
[2024-05-21 00:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:06:51] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-21 00:06:51] [INFO ] Flatten gal took : 12 ms
[2024-05-21 00:06:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 00:06:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality12323235230722892943.gal : 4 ms
[2024-05-21 00:06:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality975912633770133719.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/CTLCardinality12323235230722892943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality975912633770133719.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,4.14476e+17,0.13705,7612,1179,16,8225,219,485,8620,35,407,0


Converting to forward existential form...Done !
original formula: AX(AF(EG(EX(TRUE))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG(EX(TRUE))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t75, t98, t101, t126, t148, t163, t216, t217, t219, i0.t72, i0.i2.t74, i1.t88, i1.t85, i1.i2....596
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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.
[2024-05-21 00:07:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:07:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:07:21] [INFO ] Applying decomposition
[2024-05-21 00:07:21] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10051334738234186448.txt' '-o' '/tmp/graph10051334738234186448.bin' '-w' '/tmp/graph10051334738234186448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10051334738234186448.bin' '-l' '-1' '-v' '-w' '/tmp/graph10051334738234186448.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:07:21] [INFO ] Decomposing Gal with order
[2024-05-21 00:07:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:07:21] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-21 00:07:21] [INFO ] Flatten gal took : 21 ms
[2024-05-21 00:07:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 00:07:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality12119848501170136197.gal : 4 ms
[2024-05-21 00:07:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality1756767089786994581.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/CTLCardinality12119848501170136197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1756767089786994581.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 8 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.41371e+18,1.36123,42424,6543,28,76020,299,582,126418,47,829,0


Converting to forward existential form...Done !
original formula: EG(((i9.u83.p235==0) + (AX((i3.u16.p43==1)) * !(E(EG(((i9.u36.p123==0)||(i17.i1.u92.p258==1))) U (i12.u54.p172==0))))))
=> equivalent forward existential formula: [FwdG(Init,((i9.u83.p235==0) + (!(EX(!((i3.u16.p43==1)))) * !(E(EG(((i9.u36.p123==0)||(i17.i1.u92.p258==1))) U (...186
Reverse transition relation is NOT exact ! Due to transitions t81, t99, t138, t164, t171, t188, t243, t244, t245, i0.t111, i0.i2.t113, i1.i1.t203, i1.i1.u7...805
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-21 00:09:34] [INFO ] Applying decomposition
[2024-05-21 00:09:34] [INFO ] Flatten gal took : 6 ms
[2024-05-21 00:09:34] [INFO ] Decomposing Gal with order
[2024-05-21 00:09:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:09:34] [INFO ] Removed a total of 8 redundant transitions.
[2024-05-21 00:09:34] [INFO ] Flatten gal took : 18 ms
[2024-05-21 00:09:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 8 ms.
[2024-05-21 00:09:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality5382452811097219297.gal : 27 ms
[2024-05-21 00:09:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality13014027199895882107.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/CTLCardinality5382452811097219297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13014027199895882107.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 8 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.41371e+18,61.9343,1845952,31938,738,2.30202e+06,1870,654,1.84033e+07,263,11290,0


Converting to forward existential form...Done !
original formula: EG(((i1.i0.i0.i0.i0.u36.p235==0) + (AX((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u17.p43==1)) * !(E(EG(((i0.i0.i0.i0.i0.i0.i0.u23.p123==0)|...210
=> equivalent forward existential formula: [FwdG(Init,((i1.i0.i0.i0.i0.u36.p235==0) + (!(EX(!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u17.p43==1)))) * !(E(...259
Reverse transition relation is NOT exact ! Due to transitions i0.t81, i0.u29.t83, i0.i0.u28.t17, i0.i0.u28.t85, i0.i0.i0.t96, i0.i0.i0.u27.t98, i0.i0.i0.i0...1966
ITS-tools command line returned an error code 137
[2024-05-21 00:18:38] [INFO ] Flatten gal took : 12 ms
[2024-05-21 00:18:38] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-21 00:18:38] [INFO ] Transformed 259 places.
[2024-05-21 00:18:38] [INFO ] Transformed 253 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 00:18:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality5795187149491143710.gal : 1 ms
[2024-05-21 00:18:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11588248559018700189.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/CTLCardinality5795187149491143710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11588248559018700189.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 8 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.41371e+18,16.142,335236,2,99711,5,1.13207e+06,6,0,1291,2.03092e+06,0


Converting to forward existential form...Done !
original formula: EG(((p235==0) + (AX((p43==1)) * !(E(EG(((p123==0)||(p258==1))) U (p172==0))))))
=> equivalent forward existential formula: [FwdG(Init,((p235==0) + (!(EX(!((p43==1)))) * !(E(EG(((p123==0)||(p258==1))) U (p172==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t7, t9, t10, t11, t12, t13, t17, t24, t32, t44, t47, t55, t63, t66, t77, ...477
ITS-tools command line returned an error code 137
Total runtime 2680521 ms.

BK_STOP 1716251489074

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

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