fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r044-tall-174854028300363
Last Updated
June 24, 2025

About the Execution of ITS-Tools for CloudReconfiguration-PT-401

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 830770.00 0.00 0.00 TFFFFFFFFFFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028300363.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CloudReconfiguration-PT-401, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028300363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 912K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-401-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748602439313

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-401
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 10:54:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 10:54:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:54:00] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-05-30 10:54:00] [INFO ] Transformed 3554 places.
[2025-05-30 10:54:00] [INFO ] Transformed 4263 transitions.
[2025-05-30 10:54:00] [INFO ] Found NUPN structural information;
[2025-05-30 10:54:00] [INFO ] Parsed PT model containing 3554 places and 4263 transitions and 8889 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudReconfiguration-PT-401-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-401-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-401-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-401-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-401-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-401-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-401-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 3554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3554/3554 places, 4263/4263 transitions.
Discarding 717 places :
Symmetric choice reduction at 0 with 717 rule applications. Total rules 717 place count 2837 transition count 3546
Iterating global reduction 0 with 717 rules applied. Total rules applied 1434 place count 2837 transition count 3546
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 1472 place count 2837 transition count 3508
Discarding 326 places :
Symmetric choice reduction at 1 with 326 rule applications. Total rules 1798 place count 2511 transition count 3182
Iterating global reduction 1 with 326 rules applied. Total rules applied 2124 place count 2511 transition count 3182
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 2243 place count 2392 transition count 3063
Iterating global reduction 1 with 119 rules applied. Total rules applied 2362 place count 2392 transition count 3063
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 2389 place count 2392 transition count 3036
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 2450 place count 2331 transition count 2975
Iterating global reduction 2 with 61 rules applied. Total rules applied 2511 place count 2331 transition count 2975
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2521 place count 2331 transition count 2965
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2570 place count 2282 transition count 2910
Iterating global reduction 3 with 49 rules applied. Total rules applied 2619 place count 2282 transition count 2910
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 2655 place count 2246 transition count 2874
Iterating global reduction 3 with 36 rules applied. Total rules applied 2691 place count 2246 transition count 2874
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 2725 place count 2212 transition count 2840
Iterating global reduction 3 with 34 rules applied. Total rules applied 2759 place count 2212 transition count 2840
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 2793 place count 2178 transition count 2806
Iterating global reduction 3 with 34 rules applied. Total rules applied 2827 place count 2178 transition count 2806
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 2856 place count 2149 transition count 2758
Iterating global reduction 3 with 29 rules applied. Total rules applied 2885 place count 2149 transition count 2758
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2896 place count 2138 transition count 2740
Iterating global reduction 3 with 11 rules applied. Total rules applied 2907 place count 2138 transition count 2740
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2918 place count 2127 transition count 2726
Iterating global reduction 3 with 11 rules applied. Total rules applied 2929 place count 2127 transition count 2726
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2933 place count 2127 transition count 2722
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2936 place count 2124 transition count 2719
Iterating global reduction 4 with 3 rules applied. Total rules applied 2939 place count 2124 transition count 2719
Applied a total of 2939 rules in 2243 ms. Remains 2124 /3554 variables (removed 1430) and now considering 2719/4263 (removed 1544) transitions.
// Phase 1: matrix 2719 rows 2124 cols
[2025-05-30 10:54:03] [INFO ] Computed 5 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:54:04] [INFO ] Implicit Places using invariants in 769 ms returned []
[2025-05-30 10:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:54:05] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 2424 ms to find 0 implicit places.
Running 2718 sub problems to find dead transitions.
[2025-05-30 10:54:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.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 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 1.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 0.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 0.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 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 1.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 1.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 1.0)
(s890 1.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 1.0)
(s897 1.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 1.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 1.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 1.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 1.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 1.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 1.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 1.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 1.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 1.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 1.0)
(s1297 1.0)
(s1298 0.0)
(s1299 0.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 1.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 1.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 1.0)
(s1319 0.0)
(s1320 1.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 1.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 1.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 1.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 1.0)
(s1711 1.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 1.0)
(s1716 0.0)
(s1717 0.0)
(s1718 1.0)
(s1719 0.0)
(s1720 1.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 1.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 1.0)
(s1740 1.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 0.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 0.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 0.0)
(s1830 0.0)
(s1831 0.0)
(s1832 0.0)
(s1833 0.0)
(s1834 0.0)
(s1835 0.0)
(s1836 0.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 0.0)
(s1842 0.0)
(s1843 0.0)
(s1844 0.0)
(s1845 0.0)
(s1846 0.0)
(s1847 0.0)
(s1848 0.0)
(s1849 timeout
0.0)
(s1850 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2123/4843 variables, and 5 constraints, problems are : Problem set: 0 solved, 2718 unsolved in 30079 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 2718/2718 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2718 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2718 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(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 1)
(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 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 1)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2123/4843 variables, and 5 constraints, problems are : Problem set: 0 solved, 2718 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 0/2718 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60998ms problems are : Problem set: 0 solved, 2718 unsolved
Search for dead transitions found 0 dead transitions in 61017ms
Starting structural reductions in LTL mode, iteration 1 : 2124/3554 places, 2719/4263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65723 ms. Remains : 2124/3554 places, 2719/4263 transitions.
Support contains 32 out of 2124 places after structural reductions.
[2025-05-30 10:55:07] [INFO ] Flatten gal took : 257 ms
[2025-05-30 10:55:07] [INFO ] Flatten gal took : 117 ms
[2025-05-30 10:55:07] [INFO ] Input system was already deterministic with 2719 transitions.
RANDOM walk for 40000 steps (217 resets) in 2027 ms. (19 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (47 resets) in 304 ms. (131 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (50 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (50 resets) in 137 ms. (289 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (52 resets) in 224 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (49 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (52 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (52 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
[2025-05-30 10:55:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2095/2111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2707/4818 variables, 2111/2116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4818 variables, 0/2116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/4820 variables, 1/2117 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4820 variables, 0/2117 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/4822 variables, 1/2118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4822 variables, 0/2118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 2/4824 variables, 1/2119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4824 variables, 0/2119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/4826 variables, 1/2120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4826 variables, 0/2120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/4828 variables, 1/2121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4828 variables, 0/2121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/4830 variables, 1/2122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4830 variables, 0/2122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 2/4832 variables, 1/2123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
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 4832/4843 variables, and 2123 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2118/2124 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2095/2111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2707/4818 variables, 2111/2116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4818 variables, 9/2125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4818 variables, 0/2125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/4820 variables, 1/2126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4820 variables, 0/2126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/4822 variables, 1/2127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4822/4843 variables, and 2127 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5020 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2113/2124 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10084ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 2124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Graph (trivial) has 2573 edges and 2124 vertex of which 951 / 2124 are part of one of the 84 SCC in 7 ms
Free SCC test removed 867 places
Drop transitions (Empty/Sink Transition effects.) removed 1100 transitions
Reduce isomorphic transitions removed 1100 transitions.
Graph (complete) has 1852 edges and 1257 vertex of which 1246 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 706 rules applied. Total rules applied 708 place count 1246 transition count 908
Reduce places removed 697 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 790 rules applied. Total rules applied 1498 place count 549 transition count 815
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 61 rules applied. Total rules applied 1559 place count 490 transition count 813
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 3 rules applied. Total rules applied 1562 place count 489 transition count 811
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1566 place count 488 transition count 808
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 1571 place count 486 transition count 805
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1574 place count 483 transition count 805
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 64 Pre rules applied. Total rules applied 1574 place count 483 transition count 741
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 128 rules applied. Total rules applied 1702 place count 419 transition count 741
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1716 place count 405 transition count 720
Iterating global reduction 7 with 14 rules applied. Total rules applied 1730 place count 405 transition count 720
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 7 with 4 rules applied. Total rules applied 1734 place count 405 transition count 716
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1738 place count 401 transition count 716
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1747 place count 392 transition count 705
Iterating global reduction 9 with 9 rules applied. Total rules applied 1756 place count 392 transition count 705
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1763 place count 392 transition count 698
Performed 194 Post agglomeration using F-continuation condition with reduction of 127 identical transitions.
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 10 with 388 rules applied. Total rules applied 2151 place count 198 transition count 377
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 2172 place count 198 transition count 356
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 2177 place count 193 transition count 351
Iterating global reduction 11 with 5 rules applied. Total rules applied 2182 place count 193 transition count 351
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2183 place count 192 transition count 350
Iterating global reduction 11 with 1 rules applied. Total rules applied 2184 place count 192 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2185 place count 192 transition count 349
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2217 place count 176 transition count 329
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 2235 place count 176 transition count 311
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 2236 place count 175 transition count 309
Iterating global reduction 13 with 1 rules applied. Total rules applied 2237 place count 175 transition count 309
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 13 with 2 rules applied. Total rules applied 2239 place count 174 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 2241 place count 174 transition count 306
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 14 with 2 rules applied. Total rules applied 2243 place count 173 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 2245 place count 173 transition count 303
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 15 with 2 rules applied. Total rules applied 2247 place count 172 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2249 place count 172 transition count 300
Performed 44 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 16 with 88 rules applied. Total rules applied 2337 place count 128 transition count 350
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 16 with 51 rules applied. Total rules applied 2388 place count 128 transition count 299
Discarding 28 places :
Symmetric choice reduction at 17 with 28 rule applications. Total rules 2416 place count 100 transition count 258
Iterating global reduction 17 with 28 rules applied. Total rules applied 2444 place count 100 transition count 258
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 17 with 16 rules applied. Total rules applied 2460 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 18 with 3 rule applications. Total rules 2463 place count 97 transition count 236
Iterating global reduction 18 with 3 rules applied. Total rules applied 2466 place count 97 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2469 place count 97 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 19 with 31 rules applied. Total rules applied 2500 place count 97 transition count 202
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 2503 place count 94 transition count 195
Iterating global reduction 19 with 3 rules applied. Total rules applied 2506 place count 94 transition count 195
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 2508 place count 92 transition count 193
Iterating global reduction 19 with 2 rules applied. Total rules applied 2510 place count 92 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 2512 place count 92 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 2514 place count 92 transition count 189
Free-agglomeration rule applied 6 times.
Iterating global reduction 20 with 6 rules applied. Total rules applied 2520 place count 92 transition count 183
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 7 rules applied. Total rules applied 2527 place count 86 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 2528 place count 86 transition count 181
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 2531 place count 86 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 2532 place count 86 transition count 180
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 2533 place count 85 transition count 179
Iterating global reduction 21 with 1 rules applied. Total rules applied 2534 place count 85 transition count 179
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 2535 place count 85 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 2536 place count 85 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 2537 place count 84 transition count 177
Applied a total of 2537 rules in 248 ms. Remains 84 /2124 variables (removed 2040) and now considering 177/2719 (removed 2542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 84/2124 places, 177/2719 transitions.
RANDOM walk for 19002 steps (242 resets) in 319 ms. (59 steps per ms) remains 0/9 properties
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2958 edges and 2124 vertex of which 2113 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.34 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2105 transition count 2700
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2105 transition count 2700
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 2105 transition count 2698
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 2094 transition count 2687
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 2094 transition count 2687
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 2094 transition count 2685
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 2089 transition count 2680
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 2089 transition count 2680
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 2085 transition count 2675
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 2085 transition count 2675
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 2082 transition count 2672
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 2082 transition count 2672
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 2080 transition count 2669
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 2080 transition count 2669
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 2078 transition count 2666
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 2078 transition count 2666
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 2076 transition count 2664
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 2076 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 2075 transition count 2662
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 2075 transition count 2662
Applied a total of 102 rules in 1132 ms. Remains 2075 /2124 variables (removed 49) and now considering 2662/2719 (removed 57) transitions.
// Phase 1: matrix 2662 rows 2075 cols
[2025-05-30 10:55:20] [INFO ] Computed 5 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:55:21] [INFO ] Implicit Places using invariants in 333 ms returned []
[2025-05-30 10:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:55:22] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
Running 2661 sub problems to find dead transitions.
[2025-05-30 10:55:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2074 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2074/4737 variables, and 5 constraints, problems are : Problem set: 0 solved, 2661 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2075 constraints, PredecessorRefiner: 2661/2661 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2661 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2074 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2074/4737 variables, and 5 constraints, problems are : Problem set: 0 solved, 2661 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2075 constraints, PredecessorRefiner: 0/2661 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60753ms problems are : Problem set: 0 solved, 2661 unsolved
Search for dead transitions found 0 dead transitions in 60760ms
Starting structural reductions in LTL mode, iteration 1 : 2075/2124 places, 2662/2719 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63767 ms. Remains : 2075/2124 places, 2662/2719 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-02
Stuttering criterion allowed to conclude after 211 steps with 0 reset in 3 ms.
FORMULA CloudReconfiguration-PT-401-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-02 finished in 64103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 2124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Graph (trivial) has 2594 edges and 2124 vertex of which 976 / 2124 are part of one of the 88 SCC in 3 ms
Free SCC test removed 888 places
Ensure Unique test removed 1038 transitions
Reduce isomorphic transitions removed 1038 transitions.
Graph (complete) has 1913 edges and 1236 vertex of which 1225 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 670 transitions
Trivial Post-agglo rules discarded 670 transitions
Performed 670 trivial Post agglomeration. Transition count delta: 670
Iterating post reduction 0 with 670 rules applied. Total rules applied 672 place count 1224 transition count 1004
Reduce places removed 670 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 707 rules applied. Total rules applied 1379 place count 554 transition count 967
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 1397 place count 537 transition count 966
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1398 place count 536 transition count 966
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 1398 place count 536 transition count 901
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 1528 place count 471 transition count 901
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 1550 place count 449 transition count 866
Iterating global reduction 4 with 22 rules applied. Total rules applied 1572 place count 449 transition count 866
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 4 with 4 rules applied. Total rules applied 1576 place count 449 transition count 862
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1580 place count 445 transition count 862
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1594 place count 431 transition count 843
Iterating global reduction 6 with 14 rules applied. Total rules applied 1608 place count 431 transition count 843
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 1617 place count 431 transition count 834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1618 place count 430 transition count 834
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1621 place count 427 transition count 828
Iterating global reduction 8 with 3 rules applied. Total rules applied 1624 place count 427 transition count 828
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1627 place count 424 transition count 822
Iterating global reduction 8 with 3 rules applied. Total rules applied 1630 place count 424 transition count 822
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1633 place count 421 transition count 816
Iterating global reduction 8 with 3 rules applied. Total rules applied 1636 place count 421 transition count 816
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1639 place count 418 transition count 810
Iterating global reduction 8 with 3 rules applied. Total rules applied 1642 place count 418 transition count 810
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1645 place count 415 transition count 804
Iterating global reduction 8 with 3 rules applied. Total rules applied 1648 place count 415 transition count 804
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1651 place count 412 transition count 798
Iterating global reduction 8 with 3 rules applied. Total rules applied 1654 place count 412 transition count 798
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1656 place count 410 transition count 794
Iterating global reduction 8 with 2 rules applied. Total rules applied 1658 place count 410 transition count 794
Performed 189 Post agglomeration using F-continuation condition with reduction of 108 identical transitions.
Deduced a syphon composed of 189 places in 13 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 8 with 378 rules applied. Total rules applied 2036 place count 221 transition count 497
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2054 place count 221 transition count 479
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2061 place count 214 transition count 467
Iterating global reduction 9 with 7 rules applied. Total rules applied 2068 place count 214 transition count 467
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2069 place count 213 transition count 466
Iterating global reduction 9 with 1 rules applied. Total rules applied 2070 place count 213 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2071 place count 213 transition count 465
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 2103 place count 197 transition count 445
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 2119 place count 197 transition count 429
Performed 25 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 50 rules applied. Total rules applied 2169 place count 172 transition count 480
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 11 with 26 rules applied. Total rules applied 2195 place count 172 transition count 454
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 2207 place count 160 transition count 430
Iterating global reduction 12 with 12 rules applied. Total rules applied 2219 place count 160 transition count 430
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 2227 place count 160 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 13 with 56 rules applied. Total rules applied 2283 place count 160 transition count 366
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2284 place count 159 transition count 365
Applied a total of 2284 rules in 420 ms. Remains 159 /2124 variables (removed 1965) and now considering 365/2719 (removed 2354) transitions.
[2025-05-30 10:56:24] [INFO ] Flow matrix only has 289 transitions (discarded 76 similar events)
// Phase 1: matrix 289 rows 159 cols
[2025-05-30 10:56:24] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:24] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-05-30 10:56:24] [INFO ] Flow matrix only has 289 transitions (discarded 76 similar events)
[2025-05-30 10:56:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 10:56:24] [INFO ] Implicit Places using invariants and state equation in 489 ms returned [17, 83, 118]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 619 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/2124 places, 365/2719 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 154 transition count 363
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 153 transition count 362
Applied a total of 3 rules in 27 ms. Remains 153 /156 variables (removed 3) and now considering 362/365 (removed 3) transitions.
[2025-05-30 10:56:24] [INFO ] Flow matrix only has 286 transitions (discarded 76 similar events)
// Phase 1: matrix 286 rows 153 cols
[2025-05-30 10:56:24] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:25] [INFO ] Implicit Places using invariants in 489 ms returned []
[2025-05-30 10:56:25] [INFO ] Flow matrix only has 286 transitions (discarded 76 similar events)
[2025-05-30 10:56:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:56:25] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 153/2124 places, 362/2719 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1751 ms. Remains : 153/2124 places, 362/2719 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-401-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-03 finished in 1818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X((G(p1)&&p0))))))))'
Support contains 3 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2105 transition count 2700
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2105 transition count 2700
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 2105 transition count 2698
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 2096 transition count 2689
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 2096 transition count 2689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 2096 transition count 2688
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 2091 transition count 2683
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 2091 transition count 2683
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 2087 transition count 2678
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 2087 transition count 2678
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 2084 transition count 2675
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 2084 transition count 2675
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 2082 transition count 2672
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 2082 transition count 2672
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 2080 transition count 2669
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 2080 transition count 2669
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 2078 transition count 2667
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 2078 transition count 2667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 2077 transition count 2665
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 2077 transition count 2665
Applied a total of 97 rules in 1127 ms. Remains 2077 /2124 variables (removed 47) and now considering 2665/2719 (removed 54) transitions.
// Phase 1: matrix 2665 rows 2077 cols
[2025-05-30 10:56:26] [INFO ] Computed 5 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:27] [INFO ] Implicit Places using invariants in 442 ms returned []
[2025-05-30 10:56:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:28] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
Running 2664 sub problems to find dead transitions.
[2025-05-30 10:56:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2076 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2076/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2077 constraints, PredecessorRefiner: 2664/2664 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2664 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2076 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2076/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2077 constraints, PredecessorRefiner: 0/2664 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60732ms problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 60746ms
Starting structural reductions in LTL mode, iteration 1 : 2077/2124 places, 2665/2719 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63670 ms. Remains : 2077/2124 places, 2665/2719 transitions.
Stuttering acceptance computed with spot in 368 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-07
Product exploration explored 100000 steps with 547 reset in 257 ms.
Entered a terminal (fully accepting) state of product in 46455 steps with 253 reset in 105 ms.
FORMULA CloudReconfiguration-PT-401-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-07 finished in 64425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2104 transition count 2699
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2104 transition count 2699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 2104 transition count 2697
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 2093 transition count 2686
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 2093 transition count 2686
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 2093 transition count 2684
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 2088 transition count 2679
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 2088 transition count 2679
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 2084 transition count 2674
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 2084 transition count 2674
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 2081 transition count 2671
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 2081 transition count 2671
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 2079 transition count 2668
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 2079 transition count 2668
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 2077 transition count 2665
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 2077 transition count 2665
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 2075 transition count 2663
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 2075 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 2074 transition count 2661
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 2074 transition count 2661
Applied a total of 104 rules in 1112 ms. Remains 2074 /2124 variables (removed 50) and now considering 2661/2719 (removed 58) transitions.
// Phase 1: matrix 2661 rows 2074 cols
[2025-05-30 10:57:31] [INFO ] Computed 5 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:57:31] [INFO ] Implicit Places using invariants in 325 ms returned []
[2025-05-30 10:57:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:57:32] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
Running 2660 sub problems to find dead transitions.
[2025-05-30 10:57:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2073 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2073/4735 variables, and 5 constraints, problems are : Problem set: 0 solved, 2660 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2074 constraints, PredecessorRefiner: 2660/2660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2073 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2073/4735 variables, and 5 constraints, problems are : Problem set: 0 solved, 2660 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2074 constraints, PredecessorRefiner: 0/2660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60702ms problems are : Problem set: 0 solved, 2660 unsolved
Search for dead transitions found 0 dead transitions in 60705ms
Starting structural reductions in LTL mode, iteration 1 : 2074/2124 places, 2661/2719 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63609 ms. Remains : 2074/2124 places, 2661/2719 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-08
Product exploration explored 100000 steps with 553 reset in 168 ms.
Product exploration explored 100000 steps with 549 reset in 373 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2896 edges and 2074 vertex of which 2063 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.11 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (222 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 304642 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 304642 steps, saw 74973 distinct states, run finished after 3006 ms. (steps per millisecond=101 ) properties seen :0
[2025-05-30 10:58:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 821/823 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/823 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1238/2061 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2061 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2649/4710 variables, 2061/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4710 variables, 0/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/4712 variables, 1/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4712 variables, 0/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/4714 variables, 1/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4714 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/4716 variables, 1/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4716 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4718 variables, 1/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4718 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4720 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4720 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/4722 variables, 1/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4722 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/4724 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4724 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/4726 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4726 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/4728 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4728 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/4730 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4730 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/4732 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4732 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/4734 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4734 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/4735 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4735 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/4735 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4735/4735 variables, and 2079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1744 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2074/2074 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 821/823 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/823 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1238/2061 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2061 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2649/4710 variables, 2061/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4710 variables, 1/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4710 variables, 0/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/4712 variables, 1/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4712 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/4714 variables, 1/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4714 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4716 variables, 1/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4716 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/4718 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4718 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/4720 variables, 1/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4720 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/4722 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4722 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/4724 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4724 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/4726 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4726 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/4728 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4728 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/4730 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4730 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/4732 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4732 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/4734 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4734 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 1/4735 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4735 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/4735 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4735/4735 variables, and 2080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3134 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2074/2074 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4892ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 363 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=181 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-401-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-08 finished in 72593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(X(p0))))||F(p1)))))'
Support contains 3 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2106 transition count 2701
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2106 transition count 2701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 2106 transition count 2699
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 2096 transition count 2689
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 2096 transition count 2689
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 2096 transition count 2687
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 2092 transition count 2683
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 2092 transition count 2683
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 2089 transition count 2679
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 2089 transition count 2679
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 2087 transition count 2677
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 2087 transition count 2677
Applied a total of 78 rules in 688 ms. Remains 2087 /2124 variables (removed 37) and now considering 2677/2719 (removed 42) transitions.
// Phase 1: matrix 2677 rows 2087 cols
[2025-05-30 10:58:43] [INFO ] Computed 5 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:58:43] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-05-30 10:58:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:58:45] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
Running 2676 sub problems to find dead transitions.
[2025-05-30 10:58:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2086 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2086/4764 variables, and 5 constraints, problems are : Problem set: 0 solved, 2676 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2087 constraints, PredecessorRefiner: 2676/2676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2676 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2086 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2676 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2086/4764 variables, and 5 constraints, problems are : Problem set: 0 solved, 2676 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2087 constraints, PredecessorRefiner: 0/2676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60847ms problems are : Problem set: 0 solved, 2676 unsolved
Search for dead transitions found 0 dead transitions in 60851ms
Starting structural reductions in LTL mode, iteration 1 : 2087/2124 places, 2677/2719 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63340 ms. Remains : 2087/2124 places, 2677/2719 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-09
Product exploration explored 100000 steps with 545 reset in 297 ms.
Product exploration explored 100000 steps with 538 reset in 212 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2914 edges and 2087 vertex of which 2076 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.9 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (219 resets) in 302 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (53 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (49 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 246504 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 3
Probabilistic random walk after 246504 steps, saw 63187 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2025-05-30 10:59:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1237 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 837/2074 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2074 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2665/4739 variables, 2074/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4739 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/4741 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4741 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/4743 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4743 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4745 variables, 1/2082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4745 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4747 variables, 1/2083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4747 variables, 0/2083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/4749 variables, 1/2084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4749 variables, 0/2084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/4751 variables, 1/2085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4751 variables, 0/2085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/4753 variables, 1/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4753 variables, 0/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/4755 variables, 1/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4755 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/4757 variables, 1/2088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4757 variables, 0/2088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/4759 variables, 1/2089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4759 variables, 0/2089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 2/4761 variables, 1/2090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4761 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 2/4763 variables, 1/2091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4763 variables, 0/2091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 1/4764 variables, 1/2092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4764 variables, 0/2092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/4764 variables, 0/2092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4764/4764 variables, and 2092 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3406 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2087/2087 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1237 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 837/2074 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2074 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2665/4739 variables, 2074/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4739 variables, 3/2082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4739 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/4741 variables, 1/2083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4741 variables, 0/2083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/4743 variables, 1/2084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4743 variables, 0/2084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/4745 variables, 1/2085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4745 variables, 0/2085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/4747 variables, 1/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4747 variables, 0/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/4749 variables, 1/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4749 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/4751 variables, 1/2088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4751 variables, 0/2088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/4753 variables, 1/2089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4753 variables, 0/2089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/4755 variables, 1/2090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4755/4764 variables, and 2090 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2082/2087 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8457ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2087/2087 places, 2677/2677 transitions.
Graph (trivial) has 2556 edges and 2087 vertex of which 974 / 2087 are part of one of the 87 SCC in 2 ms
Free SCC test removed 887 places
Drop transitions (Empty/Sink Transition effects.) removed 1127 transitions
Reduce isomorphic transitions removed 1127 transitions.
Graph (complete) has 1780 edges and 1200 vertex of which 1189 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 681 rules applied. Total rules applied 683 place count 1189 transition count 864
Reduce places removed 672 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 764 rules applied. Total rules applied 1447 place count 517 transition count 772
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1507 place count 457 transition count 772
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1507 place count 457 transition count 707
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1637 place count 392 transition count 707
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1652 place count 377 transition count 685
Iterating global reduction 3 with 15 rules applied. Total rules applied 1667 place count 377 transition count 685
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 3 with 4 rules applied. Total rules applied 1671 place count 377 transition count 681
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1675 place count 373 transition count 681
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1686 place count 362 transition count 667
Iterating global reduction 5 with 11 rules applied. Total rules applied 1697 place count 362 transition count 667
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1705 place count 362 transition count 659
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1708 place count 359 transition count 641
Iterating global reduction 6 with 3 rules applied. Total rules applied 1711 place count 359 transition count 641
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 1 rules applied. Total rules applied 1712 place count 359 transition count 640
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1713 place count 358 transition count 640
Performed 190 Post agglomeration using F-continuation condition with reduction of 132 identical transitions.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 8 with 380 rules applied. Total rules applied 2093 place count 168 transition count 318
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 8 with 14 rules applied. Total rules applied 2107 place count 168 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2109 place count 167 transition count 303
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2113 place count 163 transition count 299
Iterating global reduction 10 with 4 rules applied. Total rules applied 2117 place count 163 transition count 299
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 2149 place count 147 transition count 279
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 2167 place count 147 transition count 261
Performed 45 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 11 with 90 rules applied. Total rules applied 2257 place count 102 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 11 with 76 rules applied. Total rules applied 2333 place count 102 transition count 235
Discarding 32 places :
Symmetric choice reduction at 12 with 32 rule applications. Total rules 2365 place count 70 transition count 203
Iterating global reduction 12 with 32 rules applied. Total rules applied 2397 place count 70 transition count 203
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 2417 place count 70 transition count 183
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 2425 place count 62 transition count 167
Iterating global reduction 13 with 8 rules applied. Total rules applied 2433 place count 62 transition count 167
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 2441 place count 62 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 14 with 45 rules applied. Total rules applied 2486 place count 62 transition count 114
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2490 place count 58 transition count 102
Iterating global reduction 14 with 4 rules applied. Total rules applied 2494 place count 58 transition count 102
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2497 place count 55 transition count 99
Iterating global reduction 14 with 3 rules applied. Total rules applied 2500 place count 55 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2503 place count 55 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 2507 place count 55 transition count 92
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 2511 place count 55 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 2515 place count 51 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2516 place count 51 transition count 88
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2517 place count 51 transition count 88
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2518 place count 51 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 2519 place count 50 transition count 86
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 48 edges and 49 vertex of which 31 / 49 are part of one of the 12 SCC in 0 ms
Free SCC test removed 19 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 2521 place count 30 transition count 86
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 18 with 39 rules applied. Total rules applied 2560 place count 30 transition count 47
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 2563 place count 27 transition count 44
Iterating global reduction 19 with 3 rules applied. Total rules applied 2566 place count 27 transition count 44
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 19 with 12 rules applied. Total rules applied 2578 place count 21 transition count 38
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 19 with 11 rules applied. Total rules applied 2589 place count 21 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 2591 place count 20 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 2595 place count 20 transition count 23
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 2597 place count 20 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 2599 place count 18 transition count 21
Applied a total of 2599 rules in 72 ms. Remains 18 /2087 variables (removed 2069) and now considering 21/2677 (removed 2656) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 18/2087 places, 21/2677 transitions.
RANDOM walk for 88 steps (4 resets) in 4 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2087/2087 places, 2677/2677 transitions.
Applied a total of 0 rules in 112 ms. Remains 2087 /2087 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2025-05-30 10:59:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:00:00] [INFO ] Implicit Places using invariants in 457 ms returned []
[2025-05-30 11:00:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:00:01] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
Running 2676 sub problems to find dead transitions.
[2025-05-30 11:00:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2086 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2086/4764 variables, and 5 constraints, problems are : Problem set: 0 solved, 2676 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2087 constraints, PredecessorRefiner: 2676/2676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2676 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2086 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2676 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2086/4764 variables, and 5 constraints, problems are : Problem set: 0 solved, 2676 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2087 constraints, PredecessorRefiner: 0/2676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60772ms problems are : Problem set: 0 solved, 2676 unsolved
Search for dead transitions found 0 dead transitions in 60775ms
Finished structural reductions in LTL mode , in 1 iterations and 62741 ms. Remains : 2087/2087 places, 2677/2677 transitions.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2914 edges and 2087 vertex of which 2076 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (218 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (49 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (53 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 248886 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 3
Probabilistic random walk after 248886 steps, saw 63642 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2025-05-30 11:01:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1237 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 837/2074 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2074 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2665/4739 variables, 2074/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4739 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/4741 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4741 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/4743 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4743 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4745 variables, 1/2082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4745 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4747 variables, 1/2083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4747 variables, 0/2083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/4749 variables, 1/2084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4749 variables, 0/2084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/4751 variables, 1/2085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4751 variables, 0/2085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/4753 variables, 1/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4753 variables, 0/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/4755 variables, 1/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4755 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/4757 variables, 1/2088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4757 variables, 0/2088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/4759 variables, 1/2089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4759 variables, 0/2089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 2/4761 variables, 1/2090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4761 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 2/4763 variables, 1/2091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4763 variables, 0/2091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 1/4764 variables, 1/2092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4764 variables, 0/2092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/4764 variables, 0/2092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4764/4764 variables, and 2092 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3427 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2087/2087 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1237 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 837/2074 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2074 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2665/4739 variables, 2074/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4739 variables, 3/2082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4739 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/4741 variables, 1/2083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4741 variables, 0/2083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/4743 variables, 1/2084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4743 variables, 0/2084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/4745 variables, 1/2085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4745 variables, 0/2085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/4747 variables, 1/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4747 variables, 0/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/4749 variables, 1/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4749 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/4751 variables, 1/2088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4751 variables, 0/2088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/4753 variables, 1/2089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4753 variables, 0/2089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/4755 variables, 1/2090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4755 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/4757 variables, 1/2091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4757/4764 variables, and 2091 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5025 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2083/2087 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8467ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2087/2087 places, 2677/2677 transitions.
Graph (trivial) has 2556 edges and 2087 vertex of which 974 / 2087 are part of one of the 87 SCC in 6 ms
Free SCC test removed 887 places
Drop transitions (Empty/Sink Transition effects.) removed 1127 transitions
Reduce isomorphic transitions removed 1127 transitions.
Graph (complete) has 1780 edges and 1200 vertex of which 1189 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 681 rules applied. Total rules applied 683 place count 1189 transition count 864
Reduce places removed 672 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 764 rules applied. Total rules applied 1447 place count 517 transition count 772
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1507 place count 457 transition count 772
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1507 place count 457 transition count 707
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1637 place count 392 transition count 707
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1652 place count 377 transition count 685
Iterating global reduction 3 with 15 rules applied. Total rules applied 1667 place count 377 transition count 685
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 3 with 4 rules applied. Total rules applied 1671 place count 377 transition count 681
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1675 place count 373 transition count 681
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1686 place count 362 transition count 667
Iterating global reduction 5 with 11 rules applied. Total rules applied 1697 place count 362 transition count 667
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1705 place count 362 transition count 659
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1708 place count 359 transition count 641
Iterating global reduction 6 with 3 rules applied. Total rules applied 1711 place count 359 transition count 641
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 1 rules applied. Total rules applied 1712 place count 359 transition count 640
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1713 place count 358 transition count 640
Performed 190 Post agglomeration using F-continuation condition with reduction of 132 identical transitions.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 8 with 380 rules applied. Total rules applied 2093 place count 168 transition count 318
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 8 with 14 rules applied. Total rules applied 2107 place count 168 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2109 place count 167 transition count 303
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2113 place count 163 transition count 299
Iterating global reduction 10 with 4 rules applied. Total rules applied 2117 place count 163 transition count 299
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 2149 place count 147 transition count 279
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 2167 place count 147 transition count 261
Performed 45 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 11 with 90 rules applied. Total rules applied 2257 place count 102 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 11 with 76 rules applied. Total rules applied 2333 place count 102 transition count 235
Discarding 32 places :
Symmetric choice reduction at 12 with 32 rule applications. Total rules 2365 place count 70 transition count 203
Iterating global reduction 12 with 32 rules applied. Total rules applied 2397 place count 70 transition count 203
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 2417 place count 70 transition count 183
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 2425 place count 62 transition count 167
Iterating global reduction 13 with 8 rules applied. Total rules applied 2433 place count 62 transition count 167
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 2441 place count 62 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 14 with 45 rules applied. Total rules applied 2486 place count 62 transition count 114
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2490 place count 58 transition count 102
Iterating global reduction 14 with 4 rules applied. Total rules applied 2494 place count 58 transition count 102
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2497 place count 55 transition count 99
Iterating global reduction 14 with 3 rules applied. Total rules applied 2500 place count 55 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2503 place count 55 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 2507 place count 55 transition count 92
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 2511 place count 55 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 2515 place count 51 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2516 place count 51 transition count 88
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2517 place count 51 transition count 88
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2518 place count 51 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 2519 place count 50 transition count 86
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 48 edges and 49 vertex of which 31 / 49 are part of one of the 12 SCC in 0 ms
Free SCC test removed 19 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 2521 place count 30 transition count 86
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 18 with 39 rules applied. Total rules applied 2560 place count 30 transition count 47
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 2563 place count 27 transition count 44
Iterating global reduction 19 with 3 rules applied. Total rules applied 2566 place count 27 transition count 44
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 19 with 12 rules applied. Total rules applied 2578 place count 21 transition count 38
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 19 with 11 rules applied. Total rules applied 2589 place count 21 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 2591 place count 20 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 2595 place count 20 transition count 23
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 2597 place count 20 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 2599 place count 18 transition count 21
Applied a total of 2599 rules in 84 ms. Remains 18 /2087 variables (removed 2069) and now considering 21/2677 (removed 2656) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 18/2087 places, 21/2677 transitions.
RANDOM walk for 144 steps (8 resets) in 4 ms. (28 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 554 reset in 236 ms.
Product exploration explored 100000 steps with 556 reset in 249 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2087 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2087/2087 places, 2677/2677 transitions.
Graph (trivial) has 2556 edges and 2087 vertex of which 974 / 2087 are part of one of the 87 SCC in 2 ms
Free SCC test removed 887 places
Ensure Unique test removed 1039 transitions
Reduce isomorphic transitions removed 1039 transitions.
Graph (complete) has 1867 edges and 1200 vertex of which 1189 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 648 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 648 rules applied. Total rules applied 650 place count 1189 transition count 1632
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 666 place count 1189 transition count 1616
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 666 place count 1189 transition count 1633
Deduced a syphon composed of 676 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 694 place count 1189 transition count 1633
Discarding 387 places :
Symmetric choice reduction at 2 with 387 rule applications. Total rules 1081 place count 802 transition count 1232
Deduced a syphon composed of 311 places in 1 ms
Iterating global reduction 2 with 387 rules applied. Total rules applied 1468 place count 802 transition count 1232
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1485 place count 785 transition count 1209
Deduced a syphon composed of 308 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1502 place count 785 transition count 1209
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1510 place count 785 transition count 1201
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1527 place count 768 transition count 1184
Deduced a syphon composed of 294 places in 1 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 1544 place count 768 transition count 1184
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1547 place count 765 transition count 1178
Deduced a syphon composed of 294 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1550 place count 765 transition count 1178
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1553 place count 762 transition count 1172
Deduced a syphon composed of 294 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1556 place count 762 transition count 1172
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1562 place count 756 transition count 1166
Deduced a syphon composed of 291 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1568 place count 756 transition count 1166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1571 place count 753 transition count 1160
Deduced a syphon composed of 291 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1574 place count 753 transition count 1160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1577 place count 750 transition count 1154
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1580 place count 750 transition count 1154
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1586 place count 744 transition count 1148
Deduced a syphon composed of 288 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1592 place count 744 transition count 1148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1595 place count 741 transition count 1142
Deduced a syphon composed of 288 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1598 place count 741 transition count 1142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1601 place count 738 transition count 1136
Deduced a syphon composed of 288 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1604 place count 738 transition count 1136
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1610 place count 732 transition count 1127
Deduced a syphon composed of 285 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1616 place count 732 transition count 1127
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1622 place count 726 transition count 1103
Deduced a syphon composed of 282 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1628 place count 726 transition count 1103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1629 place count 726 transition count 1103
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1635 place count 720 transition count 1097
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1641 place count 720 transition count 1097
Performed 141 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 421 places in 0 ms
Iterating global reduction 4 with 141 rules applied. Total rules applied 1782 place count 720 transition count 1201
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 1833 place count 720 transition count 1150
Discarding 132 places :
Symmetric choice reduction at 5 with 132 rule applications. Total rules 1965 place count 588 transition count 1004
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 5 with 132 rules applied. Total rules applied 2097 place count 588 transition count 1004
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2099 place count 588 transition count 1002
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2107 place count 580 transition count 991
Deduced a syphon composed of 294 places in 1 ms
Iterating global reduction 6 with 8 rules applied. Total rules applied 2115 place count 580 transition count 991
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 303 places in 1 ms
Iterating global reduction 6 with 9 rules applied. Total rules applied 2124 place count 580 transition count 991
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2129 place count 580 transition count 986
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2148 place count 561 transition count 962
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 7 with 19 rules applied. Total rules applied 2167 place count 561 transition count 962
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 2175 place count 561 transition count 954
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2180 place count 556 transition count 949
Deduced a syphon composed of 284 places in 1 ms
Iterating global reduction 8 with 5 rules applied. Total rules applied 2185 place count 556 transition count 949
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 288 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 2189 place count 556 transition count 949
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2197 place count 556 transition count 941
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2201 place count 552 transition count 937
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2205 place count 552 transition count 937
Performed 94 Post agglomeration using F-continuation condition with reduction of 154 identical transitions.
Deduced a syphon composed of 378 places in 0 ms
Iterating global reduction 9 with 94 rules applied. Total rules applied 2299 place count 552 transition count 1374
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 9 with 156 rules applied. Total rules applied 2455 place count 552 transition count 1218
Discarding 168 places :
Symmetric choice reduction at 10 with 168 rule applications. Total rules 2623 place count 384 transition count 766
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 10 with 168 rules applied. Total rules applied 2791 place count 384 transition count 766
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 2811 place count 384 transition count 746
Discarding 34 places :
Symmetric choice reduction at 11 with 34 rule applications. Total rules 2845 place count 350 transition count 675
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 11 with 34 rules applied. Total rules applied 2879 place count 350 transition count 675
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 192 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2883 place count 350 transition count 743
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2887 place count 346 transition count 705
Deduced a syphon composed of 188 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2891 place count 346 transition count 705
Deduced a syphon composed of 188 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 11 with 64 rules applied. Total rules applied 2955 place count 346 transition count 641
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 2960 place count 341 transition count 636
Deduced a syphon composed of 183 places in 0 ms
Iterating global reduction 11 with 5 rules applied. Total rules applied 2965 place count 341 transition count 636
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2968 place count 341 transition count 696
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2971 place count 338 transition count 681
Deduced a syphon composed of 183 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2974 place count 338 transition count 681
Deduced a syphon composed of 183 places in 0 ms
Applied a total of 2974 rules in 586 ms. Remains 338 /2087 variables (removed 1749) and now considering 681/2677 (removed 1996) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:01:16] [INFO ] Redundant transitions in 40 ms returned []
Running 680 sub problems to find dead transitions.
[2025-05-30 11:01:16] [INFO ] Flow matrix only has 607 transitions (discarded 74 similar events)
// Phase 1: matrix 607 rows 338 cols
[2025-05-30 11:01:16] [INFO ] Computed 0 invariants in 3 ms
[2025-05-30 11:01:16] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
At refinement iteration 1 (OVERLAPS) 606/943 variables, 337/337 constraints. Problems are: Problem set: 330 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/943 variables, 2/339 constraints. Problems are: Problem set: 330 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/943 variables, 0/339 constraints. Problems are: Problem set: 330 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 1/944 variables, 1/340 constraints. Problems are: Problem set: 330 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 944/945 variables, and 340 constraints, problems are : Problem set: 330 solved, 350 unsolved in 30013 ms.
Refiners :[State Equation: 338/338 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 330 solved, 350 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 330 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 602/756 variables, 154/154 constraints. Problems are: Problem set: 330 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/756 variables, 2/156 constraints. Problems are: Problem set: 330 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 350/506 constraints. Problems are: Problem set: 330 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/506 constraints. Problems are: Problem set: 330 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 188/944 variables, 184/690 constraints. Problems are: Problem set: 330 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 944/945 variables, and 690 constraints, problems are : Problem set: 330 solved, 350 unsolved in 30021 ms.
Refiners :[State Equation: 338/338 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 350/680 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 330 solved, 350 unsolved
Search for dead transitions found 330 dead transitions in 60202ms
Found 330 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 330 transitions
Dead transitions reduction (with SMT) removed 330 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 338/2087 places, 351/2677 transitions.
Graph (complete) has 549 edges and 338 vertex of which 155 are kept as prefixes of interest. Removing 183 places using SCC suffix rule.0 ms
Discarding 183 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 371
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 7 ms. Remains 155 /338 variables (removed 183) and now considering 371/351 (removed -20) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/2087 places, 371/2677 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60848 ms. Remains : 155/2087 places, 371/2677 transitions.
Built C files in :
/tmp/ltsmin8040514840879346125
[2025-05-30 11:02:17] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8040514840879346125
Running compilation step : cd /tmp/ltsmin8040514840879346125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8040514840879346125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8040514840879346125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 2087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2087/2087 places, 2677/2677 transitions.
Applied a total of 0 rules in 93 ms. Remains 2087 /2087 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
// Phase 1: matrix 2677 rows 2087 cols
[2025-05-30 11:02:20] [INFO ] Computed 5 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:02:20] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-05-30 11:02:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:02:22] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
Running 2676 sub problems to find dead transitions.
[2025-05-30 11:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2086 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2086/4764 variables, and 5 constraints, problems are : Problem set: 0 solved, 2676 unsolved in 30059 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2087 constraints, PredecessorRefiner: 2676/2676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2676 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2086 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2676 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2086/4764 variables, and 5 constraints, problems are : Problem set: 0 solved, 2676 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2087 constraints, PredecessorRefiner: 0/2676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60740ms problems are : Problem set: 0 solved, 2676 unsolved
Search for dead transitions found 0 dead transitions in 60743ms
Finished structural reductions in LTL mode , in 1 iterations and 62692 ms. Remains : 2087/2087 places, 2677/2677 transitions.
Built C files in :
/tmp/ltsmin10522467894867829809
[2025-05-30 11:03:23] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10522467894867829809
Running compilation step : cd /tmp/ltsmin10522467894867829809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10522467894867829809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10522467894867829809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 11:03:26] [INFO ] Flatten gal took : 74 ms
[2025-05-30 11:03:26] [INFO ] Flatten gal took : 65 ms
[2025-05-30 11:03:26] [INFO ] Time to serialize gal into /tmp/LTL10402723544550342335.gal : 30 ms
[2025-05-30 11:03:26] [INFO ] Time to serialize properties into /tmp/LTL13172452332107120854.prop : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10402723544550342335.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15529354912849940397.hoa' '-atoms' '/tmp/LTL13172452332107120854.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13172452332107120854.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15529354912849940397.hoa
Detected timeout of ITS tools.
[2025-05-30 11:03:41] [INFO ] Flatten gal took : 50 ms
[2025-05-30 11:03:41] [INFO ] Flatten gal took : 65 ms
[2025-05-30 11:03:41] [INFO ] Time to serialize gal into /tmp/LTL17113109638792821692.gal : 11 ms
[2025-05-30 11:03:41] [INFO ] Time to serialize properties into /tmp/LTL18107284035949081933.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17113109638792821692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18107284035949081933.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X(X("(p1396==1)")))))||(F("((p3409==0)||(p1627==1))"))))))
Formula 0 simplified : XF(XXXX!"(p1396==1)" & G!"((p3409==0)||(p1627==1))")
Detected timeout of ITS tools.
[2025-05-30 11:03:56] [INFO ] Flatten gal took : 48 ms
[2025-05-30 11:03:56] [INFO ] Applying decomposition
[2025-05-30 11:03:56] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10603406240857991862.txt' '-o' '/tmp/graph10603406240857991862.bin' '-w' '/tmp/graph10603406240857991862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10603406240857991862.bin' '-l' '-1' '-v' '-w' '/tmp/graph10603406240857991862.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:03:57] [INFO ] Decomposing Gal with order
[2025-05-30 11:03:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:03:57] [INFO ] Removed a total of 699 redundant transitions.
[2025-05-30 11:03:57] [INFO ] Flatten gal took : 215 ms
[2025-05-30 11:03:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 45 ms.
[2025-05-30 11:03:57] [INFO ] Time to serialize gal into /tmp/LTL14409684807848526254.gal : 25 ms
[2025-05-30 11:03:57] [INFO ] Time to serialize properties into /tmp/LTL15910961059297539458.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14409684807848526254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15910961059297539458.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(X(X("(i17.i0.i6.u325.p1396==1)")))))||(F("((i27.i2.i2.u710.p3409==0)||(i19.i2.i1.u387.p1627==1))"))))))
Formula 0 simplified : XF(XXXX!"(i17.i0.i6.u325.p1396==1)" & G!"((i27.i2.i2.u710.p3409==0)||(i19.i2.i1.u387.p1627==1))")
Reverse transition relation is NOT exact ! Due to transitions t31, t193, t222, t274, t305, t455, t507, t690, t742, t802, t853, t924, t979, t1132, t1161, t1...2947
Computing Next relation with stutter on 4.17432e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-09 finished in 330323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((p1&&X(X(X(!p0)))) U G(p2))))'
Support contains 6 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2106 transition count 2701
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2106 transition count 2701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 2106 transition count 2699
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 2097 transition count 2690
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 2097 transition count 2690
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 2097 transition count 2688
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 2093 transition count 2684
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 2093 transition count 2684
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 2090 transition count 2680
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 2090 transition count 2680
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 2087 transition count 2677
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 2087 transition count 2677
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 2085 transition count 2674
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 2085 transition count 2674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 2083 transition count 2671
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 2083 transition count 2671
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 2081 transition count 2669
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 2081 transition count 2669
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 2080 transition count 2667
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 2080 transition count 2667
Applied a total of 92 rules in 1039 ms. Remains 2080 /2124 variables (removed 44) and now considering 2667/2719 (removed 52) transitions.
// Phase 1: matrix 2667 rows 2080 cols
[2025-05-30 11:04:13] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:04:14] [INFO ] Implicit Places using invariants in 474 ms returned []
[2025-05-30 11:04:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:04:15] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
Running 2666 sub problems to find dead transitions.
[2025-05-30 11:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2079 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2079/4747 variables, and 5 constraints, problems are : Problem set: 0 solved, 2666 unsolved in 30056 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2080 constraints, PredecessorRefiner: 2666/2666 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2666 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2079 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2079/4747 variables, and 5 constraints, problems are : Problem set: 0 solved, 2666 unsolved in 30064 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2080 constraints, PredecessorRefiner: 0/2666 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60752ms problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 60764ms
Starting structural reductions in LTL mode, iteration 1 : 2080/2124 places, 2667/2719 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63597 ms. Remains : 2080/2124 places, 2667/2719 transitions.
Stuttering acceptance computed with spot in 682 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p0), p0, (NOT p2), (NOT p2), (AND p0 (NOT p2)), false, (AND (NOT p0) (NOT p2)), false, p0, p0, (AND p0 (NOT p2)), false, false, (AND (NOT p2) p0), false, false]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-10
Product exploration explored 100000 steps with 544 reset in 196 ms.
Product exploration explored 100000 steps with 559 reset in 207 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2904 edges and 2080 vertex of which 2069 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X p0), (X p1), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 43 factoid took 166 ms. Reduced automaton from 18 states, 49 edges and 3 AP (stutter sensitive) to 18 states, 49 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 575 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p0), p0, (NOT p2), (NOT p2), (AND p0 (NOT p2)), false, (AND (NOT p0) (NOT p2)), false, p0, p0, (AND p0 (NOT p2)), false, false, (AND (NOT p2) p0), false, false]
RANDOM walk for 40000 steps (220 resets) in 476 ms. (83 steps per ms) remains 14/21 properties
BEST_FIRST walk for 40003 steps (49 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 104 ms. (380 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40003 steps (47 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (50 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (51 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (51 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (49 resets) in 53 ms. (740 steps per ms) remains 4/10 properties
[2025-05-30 11:05:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 856/862 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/862 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1205/2067 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2067 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2655/4722 variables, 2067/2072 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4722 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/4724 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4724 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/4726 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4726 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/4728 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4728 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/4730 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4730 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/4732 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4732 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/4734 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4734 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/4736 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4736 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/4738 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4738 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/4740 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4740 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/4742 variables, 1/2082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4742 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 2/4744 variables, 1/2083 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4744 variables, 0/2083 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 2/4746 variables, 1/2084 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4746 variables, 0/2084 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 1/4747 variables, 1/2085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4747 variables, 0/2085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 0/4747 variables, 0/2085 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4747/4747 variables, and 2085 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4741 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2080/2080 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 856/862 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/862 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1205/2067 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2067 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2655/4722 variables, 2067/2072 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4722 variables, 4/2076 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4722 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/4724 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4724 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/4726 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4726 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/4728 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4728 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/4730 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4730 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/4732 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4732 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/4734 variables, 1/2082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4734/4747 variables, and 2082 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5029 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2073/2080 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9792ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 2080 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2080/2080 places, 2667/2667 transitions.
Graph (trivial) has 2538 edges and 2080 vertex of which 949 / 2080 are part of one of the 86 SCC in 1 ms
Free SCC test removed 863 places
Drop transitions (Empty/Sink Transition effects.) removed 1092 transitions
Reduce isomorphic transitions removed 1092 transitions.
Graph (complete) has 1805 edges and 1217 vertex of which 1206 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 671 transitions
Trivial Post-agglo rules discarded 671 transitions
Performed 671 trivial Post agglomeration. Transition count delta: 671
Iterating post reduction 0 with 680 rules applied. Total rules applied 682 place count 1206 transition count 890
Reduce places removed 671 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 1 with 756 rules applied. Total rules applied 1438 place count 535 transition count 805
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 59 rules applied. Total rules applied 1497 place count 480 transition count 801
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 1503 place count 478 transition count 797
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 1508 place count 476 transition count 794
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 1512 place count 474 transition count 792
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 6 with 4 rules applied. Total rules applied 1516 place count 472 transition count 790
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1517 place count 471 transition count 790
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 69 Pre rules applied. Total rules applied 1517 place count 471 transition count 721
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 8 with 138 rules applied. Total rules applied 1655 place count 402 transition count 721
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1671 place count 386 transition count 698
Iterating global reduction 8 with 16 rules applied. Total rules applied 1687 place count 386 transition count 698
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 8 with 4 rules applied. Total rules applied 1691 place count 386 transition count 694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1695 place count 382 transition count 694
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1703 place count 374 transition count 686
Iterating global reduction 10 with 8 rules applied. Total rules applied 1711 place count 374 transition count 686
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1719 place count 374 transition count 678
Performed 194 Post agglomeration using F-continuation condition with reduction of 126 identical transitions.
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 11 with 388 rules applied. Total rules applied 2107 place count 180 transition count 358
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 2131 place count 180 transition count 334
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2135 place count 176 transition count 330
Iterating global reduction 12 with 4 rules applied. Total rules applied 2139 place count 176 transition count 330
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 2173 place count 159 transition count 309
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 12 with 21 rules applied. Total rules applied 2194 place count 159 transition count 288
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 13 with 2 rules applied. Total rules applied 2196 place count 158 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 2200 place count 158 transition count 283
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 14 with 2 rules applied. Total rules applied 2202 place count 157 transition count 282
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2203 place count 157 transition count 281
Performed 46 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 15 with 92 rules applied. Total rules applied 2295 place count 111 transition count 322
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 15 with 47 rules applied. Total rules applied 2342 place count 111 transition count 275
Discarding 29 places :
Symmetric choice reduction at 16 with 29 rule applications. Total rules 2371 place count 82 transition count 225
Iterating global reduction 16 with 29 rules applied. Total rules applied 2400 place count 82 transition count 225
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 2417 place count 82 transition count 208
Discarding 8 places :
Symmetric choice reduction at 17 with 8 rule applications. Total rules 2425 place count 74 transition count 192
Iterating global reduction 17 with 8 rules applied. Total rules applied 2433 place count 74 transition count 192
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 2440 place count 74 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 18 with 15 rules applied. Total rules applied 2455 place count 74 transition count 170
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 2456 place count 73 transition count 167
Iterating global reduction 18 with 1 rules applied. Total rules applied 2457 place count 73 transition count 167
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 2458 place count 72 transition count 166
Iterating global reduction 18 with 1 rules applied. Total rules applied 2459 place count 72 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 2460 place count 72 transition count 165
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 19 with 2 rules applied. Total rules applied 2462 place count 71 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2463 place count 71 transition count 163
Free-agglomeration rule applied 5 times.
Iterating global reduction 19 with 5 rules applied. Total rules applied 2468 place count 71 transition count 158
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 2475 place count 66 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 2476 place count 66 transition count 155
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 2479 place count 66 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 2480 place count 66 transition count 154
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 2481 place count 65 transition count 153
Iterating global reduction 20 with 1 rules applied. Total rules applied 2482 place count 65 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 2483 place count 64 transition count 152
Applied a total of 2483 rules in 108 ms. Remains 64 /2080 variables (removed 2016) and now considering 152/2667 (removed 2515) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 64/2080 places, 152/2667 transitions.
RANDOM walk for 40000 steps (508 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (179 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (160 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (153 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (177 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
Probably explored full state space saw : 149262 states, properties seen :0
Probabilistic random walk after 673136 steps, saw 149262 distinct states, run finished after 2652 ms. (steps per millisecond=253 ) properties seen :0
Explored full state space saw : 149262 states, properties seen :0
Exhaustive walk after 673136 steps, saw 149262 distinct states, run finished after 2055 ms. (steps per millisecond=327 ) properties seen :0
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X p0), (X p1), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p2))))), (G (OR p0 p2)), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (AND p2 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 47 factoid took 567 ms. Reduced automaton from 18 states, 49 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0)]
Support contains 4 out of 2080 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2080/2080 places, 2667/2667 transitions.
Graph (trivial) has 2538 edges and 2080 vertex of which 949 / 2080 are part of one of the 86 SCC in 2 ms
Free SCC test removed 863 places
Ensure Unique test removed 1005 transitions
Reduce isomorphic transitions removed 1005 transitions.
Graph (complete) has 1891 edges and 1217 vertex of which 1206 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 649 transitions
Trivial Post-agglo rules discarded 649 transitions
Performed 649 trivial Post agglomeration. Transition count delta: 649
Iterating post reduction 0 with 649 rules applied. Total rules applied 651 place count 1205 transition count 1006
Reduce places removed 649 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 683 rules applied. Total rules applied 1334 place count 556 transition count 972
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 21 rules applied. Total rules applied 1355 place count 539 transition count 968
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 1361 place count 537 transition count 964
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 1366 place count 535 transition count 961
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 1370 place count 533 transition count 959
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 6 with 4 rules applied. Total rules applied 1374 place count 531 transition count 957
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1375 place count 530 transition count 957
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 69 Pre rules applied. Total rules applied 1375 place count 530 transition count 888
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 8 with 138 rules applied. Total rules applied 1513 place count 461 transition count 888
Discarding 21 places :
Symmetric choice reduction at 8 with 21 rule applications. Total rules 1534 place count 440 transition count 854
Iterating global reduction 8 with 21 rules applied. Total rules applied 1555 place count 440 transition count 854
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 8 with 4 rules applied. Total rules applied 1559 place count 440 transition count 850
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1563 place count 436 transition count 850
Discarding 13 places :
Symmetric choice reduction at 10 with 13 rule applications. Total rules 1576 place count 423 transition count 832
Iterating global reduction 10 with 13 rules applied. Total rules applied 1589 place count 423 transition count 832
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1597 place count 423 transition count 824
Performed 186 Post agglomeration using F-continuation condition with reduction of 103 identical transitions.
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 11 with 372 rules applied. Total rules applied 1969 place count 237 transition count 535
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 1985 place count 237 transition count 519
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1990 place count 232 transition count 513
Iterating global reduction 12 with 5 rules applied. Total rules applied 1995 place count 232 transition count 513
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 2029 place count 215 transition count 492
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 2049 place count 215 transition count 472
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 2050 place count 214 transition count 470
Iterating global reduction 13 with 1 rules applied. Total rules applied 2051 place count 214 transition count 470
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 13 with 64 rules applied. Total rules applied 2115 place count 182 transition count 537
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 13 with 39 rules applied. Total rules applied 2154 place count 182 transition count 498
Discarding 12 places :
Symmetric choice reduction at 14 with 12 rule applications. Total rules 2166 place count 170 transition count 474
Iterating global reduction 14 with 12 rules applied. Total rules applied 2178 place count 170 transition count 474
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 2186 place count 170 transition count 466
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 15 with 78 rules applied. Total rules applied 2264 place count 170 transition count 388
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 2265 place count 169 transition count 387
Applied a total of 2265 rules in 89 ms. Remains 169 /2080 variables (removed 1911) and now considering 387/2667 (removed 2280) transitions.
[2025-05-30 11:05:34] [INFO ] Flow matrix only has 305 transitions (discarded 82 similar events)
// Phase 1: matrix 305 rows 169 cols
[2025-05-30 11:05:34] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:34] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-05-30 11:05:34] [INFO ] Flow matrix only has 305 transitions (discarded 82 similar events)
[2025-05-30 11:05:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 11:05:34] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [28, 94, 127]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 326 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/2080 places, 387/2667 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 164 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 163 transition count 384
Applied a total of 3 rules in 14 ms. Remains 163 /166 variables (removed 3) and now considering 384/387 (removed 3) transitions.
[2025-05-30 11:05:35] [INFO ] Flow matrix only has 302 transitions (discarded 82 similar events)
// Phase 1: matrix 302 rows 163 cols
[2025-05-30 11:05:35] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:35] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-30 11:05:35] [INFO ] Flow matrix only has 302 transitions (discarded 82 similar events)
[2025-05-30 11:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 11:05:35] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 163/2080 places, 384/2667 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 615 ms. Remains : 163/2080 places, 384/2667 transitions.
Computed a total of 3 stabilizing places and 22 stable transitions
Computed a total of 3 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p2 p0), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p2))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 117 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (3582 resets) in 409 ms. (97 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (331 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2025-05-30 11:05:35] [INFO ] Flow matrix only has 302 transitions (discarded 82 similar events)
[2025-05-30 11:05:35] [INFO ] Invariant cache hit.
[2025-05-30 11:05:35] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/174 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 274/448 variables, 136/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/464 variables, 15/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/464 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/465 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[State Equation: 163/163 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/174 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 274/448 variables, 136/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 464/465 variables, and 169 constraints, problems are : Problem set: 1 solved, 0 unsolved in 116 ms.
Refiners :[State Equation: 163/163 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p2))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p2))), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 345 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 7290 reset in 258 ms.
Product exploration explored 100000 steps with 7319 reset in 255 ms.
Built C files in :
/tmp/ltsmin13181479589663083744
[2025-05-30 11:05:37] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2025-05-30 11:05:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:05:37] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2025-05-30 11:05:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:05:37] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2025-05-30 11:05:37] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:05:37] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13181479589663083744
Running compilation step : cd /tmp/ltsmin13181479589663083744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 777 ms.
Running link step : cd /tmp/ltsmin13181479589663083744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin13181479589663083744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8036117432297112964.hoa' '--buchi-type=spotba'
LTSmin run took 985 ms.
FORMULA CloudReconfiguration-PT-401-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-10 finished in 86112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 2124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Graph (trivial) has 2590 edges and 2124 vertex of which 951 / 2124 are part of one of the 86 SCC in 2 ms
Free SCC test removed 865 places
Ensure Unique test removed 1013 transitions
Reduce isomorphic transitions removed 1013 transitions.
Graph (complete) has 1939 edges and 1259 vertex of which 1248 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 681 transitions
Trivial Post-agglo rules discarded 681 transitions
Performed 681 trivial Post agglomeration. Transition count delta: 681
Iterating post reduction 0 with 681 rules applied. Total rules applied 683 place count 1247 transition count 1018
Reduce places removed 681 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 720 rules applied. Total rules applied 1403 place count 566 transition count 979
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 21 rules applied. Total rules applied 1424 place count 547 transition count 977
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1426 place count 545 transition count 977
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 69 Pre rules applied. Total rules applied 1426 place count 545 transition count 908
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 1564 place count 476 transition count 908
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1585 place count 455 transition count 874
Iterating global reduction 4 with 21 rules applied. Total rules applied 1606 place count 455 transition count 874
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 4 with 4 rules applied. Total rules applied 1610 place count 455 transition count 870
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1614 place count 451 transition count 870
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1627 place count 438 transition count 852
Iterating global reduction 6 with 13 rules applied. Total rules applied 1640 place count 438 transition count 852
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 1648 place count 438 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1649 place count 437 transition count 844
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1652 place count 434 transition count 838
Iterating global reduction 8 with 3 rules applied. Total rules applied 1655 place count 434 transition count 838
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1658 place count 431 transition count 832
Iterating global reduction 8 with 3 rules applied. Total rules applied 1661 place count 431 transition count 832
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1664 place count 428 transition count 826
Iterating global reduction 8 with 3 rules applied. Total rules applied 1667 place count 428 transition count 826
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1670 place count 425 transition count 820
Iterating global reduction 8 with 3 rules applied. Total rules applied 1673 place count 425 transition count 820
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1676 place count 422 transition count 814
Iterating global reduction 8 with 3 rules applied. Total rules applied 1679 place count 422 transition count 814
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1682 place count 419 transition count 808
Iterating global reduction 8 with 3 rules applied. Total rules applied 1685 place count 419 transition count 808
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1687 place count 417 transition count 804
Iterating global reduction 8 with 2 rules applied. Total rules applied 1689 place count 417 transition count 804
Performed 189 Post agglomeration using F-continuation condition with reduction of 110 identical transitions.
Deduced a syphon composed of 189 places in 0 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 8 with 378 rules applied. Total rules applied 2067 place count 228 transition count 505
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2085 place count 228 transition count 487
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2091 place count 222 transition count 476
Iterating global reduction 9 with 6 rules applied. Total rules applied 2097 place count 222 transition count 476
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 2131 place count 205 transition count 455
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 2147 place count 205 transition count 439
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2148 place count 204 transition count 435
Iterating global reduction 10 with 1 rules applied. Total rules applied 2149 place count 204 transition count 435
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 10 with 2 rules applied. Total rules applied 2151 place count 203 transition count 434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2153 place count 203 transition count 432
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 11 with 52 rules applied. Total rules applied 2205 place count 177 transition count 486
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 2229 place count 177 transition count 462
Discarding 11 places :
Symmetric choice reduction at 12 with 11 rule applications. Total rules 2240 place count 166 transition count 440
Iterating global reduction 12 with 11 rules applied. Total rules applied 2251 place count 166 transition count 440
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 2258 place count 166 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 13 with 53 rules applied. Total rules applied 2311 place count 166 transition count 380
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2312 place count 165 transition count 379
Applied a total of 2312 rules in 137 ms. Remains 165 /2124 variables (removed 1959) and now considering 379/2719 (removed 2340) transitions.
[2025-05-30 11:05:39] [INFO ] Flow matrix only has 304 transitions (discarded 75 similar events)
// Phase 1: matrix 304 rows 165 cols
[2025-05-30 11:05:39] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:39] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-30 11:05:39] [INFO ] Flow matrix only has 304 transitions (discarded 75 similar events)
[2025-05-30 11:05:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 11:05:39] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [14, 85, 124]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 248 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/2124 places, 379/2719 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 159 transition count 376
Applied a total of 3 rules in 12 ms. Remains 159 /162 variables (removed 3) and now considering 376/379 (removed 3) transitions.
[2025-05-30 11:05:39] [INFO ] Flow matrix only has 301 transitions (discarded 75 similar events)
// Phase 1: matrix 301 rows 159 cols
[2025-05-30 11:05:39] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 11:05:39] [INFO ] Flow matrix only has 301 transitions (discarded 75 similar events)
[2025-05-30 11:05:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 11:05:39] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 159/2124 places, 376/2719 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 582 ms. Remains : 159/2124 places, 376/2719 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-401-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-11 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2103 transition count 2698
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2103 transition count 2698
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 2103 transition count 2696
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 2092 transition count 2685
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 2092 transition count 2685
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 2092 transition count 2683
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 2087 transition count 2678
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 2087 transition count 2678
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 2083 transition count 2673
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 2083 transition count 2673
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 2080 transition count 2670
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 2080 transition count 2670
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 2078 transition count 2667
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 2078 transition count 2667
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 2076 transition count 2664
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 2076 transition count 2664
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 2074 transition count 2662
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 2074 transition count 2662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 2073 transition count 2660
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 2073 transition count 2660
Applied a total of 106 rules in 1122 ms. Remains 2073 /2124 variables (removed 51) and now considering 2660/2719 (removed 59) transitions.
// Phase 1: matrix 2660 rows 2073 cols
[2025-05-30 11:05:40] [INFO ] Computed 5 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:41] [INFO ] Implicit Places using invariants in 338 ms returned []
[2025-05-30 11:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:42] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
Running 2659 sub problems to find dead transitions.
[2025-05-30 11:05:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.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 1.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2072 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2072/4733 variables, and 5 constraints, problems are : Problem set: 0 solved, 2659 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2073 constraints, PredecessorRefiner: 2659/2659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2072 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2072/4733 variables, and 5 constraints, problems are : Problem set: 0 solved, 2659 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2073 constraints, PredecessorRefiner: 0/2659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60787ms problems are : Problem set: 0 solved, 2659 unsolved
Search for dead transitions found 0 dead transitions in 60791ms
Starting structural reductions in LTL mode, iteration 1 : 2073/2124 places, 2660/2719 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63703 ms. Remains : 2073/2124 places, 2660/2719 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 572 ms.
Product exploration explored 100000 steps with 50000 reset in 551 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2895 edges and 2073 vertex of which 2062 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.14 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 9 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-401-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-12 finished in 65004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1)))&&X(X(G(p2))))))'
Support contains 5 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2108 transition count 2703
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2108 transition count 2703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 2108 transition count 2702
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 2099 transition count 2693
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 2099 transition count 2693
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 2099 transition count 2691
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 2096 transition count 2688
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 2096 transition count 2688
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 2093 transition count 2684
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 2093 transition count 2684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 2091 transition count 2682
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 2091 transition count 2682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 2090 transition count 2681
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 2090 transition count 2681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 2089 transition count 2680
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 2089 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 2088 transition count 2679
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 2088 transition count 2679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 2087 transition count 2677
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 2087 transition count 2677
Applied a total of 77 rules in 1059 ms. Remains 2087 /2124 variables (removed 37) and now considering 2677/2719 (removed 42) transitions.
// Phase 1: matrix 2677 rows 2087 cols
[2025-05-30 11:06:45] [INFO ] Computed 5 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:06:46] [INFO ] Implicit Places using invariants in 301 ms returned []
[2025-05-30 11:06:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:06:47] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
Running 2676 sub problems to find dead transitions.
[2025-05-30 11:06:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.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 0.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 0.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 0.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 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 1.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 1.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 1.0)
(s1237 1.0)
(s1238 0.0)
(s1239 0.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 0.0)
(s1244 0.0)
(s1245 1.0)
(s1246 1.0)
(s1247 0.0)
(s1248 1.0)
(s1249 1.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 1.0)
(s1255 1.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 1.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 1.0)
(s1276 1.0)
(s1277 0.0)
(s1278 1.0)
(s1279 1.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 1.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 1.0)
(s1288 1.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 1.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 1.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 1.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2086 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2086/4764 variables, and 5 constraints, problems are : Problem set: 0 solved, 2676 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2087 constraints, PredecessorRefiner: 2676/2676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2676 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2086 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2086/4764 variables, and 5 constraints, problems are : Problem set: 0 solved, 2676 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2087 constraints, PredecessorRefiner: 0/2676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60712ms problems are : Problem set: 0 solved, 2676 unsolved
Search for dead transitions found 0 dead transitions in 60715ms
Starting structural reductions in LTL mode, iteration 1 : 2087/2124 places, 2677/2719 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63537 ms. Remains : 2087/2124 places, 2677/2719 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-401-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-14 finished in 63820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(X(p0))))||F(p1)))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-401-LTLCardinality-09
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2124/2124 places, 2719/2719 transitions.
Graph (trivial) has 2597 edges and 2124 vertex of which 978 / 2124 are part of one of the 87 SCC in 1 ms
Free SCC test removed 891 places
Ensure Unique test removed 1044 transitions
Reduce isomorphic transitions removed 1044 transitions.
Graph (complete) has 1907 edges and 1233 vertex of which 1222 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 675 transitions
Trivial Post-agglo rules discarded 675 transitions
Performed 675 trivial Post agglomeration. Transition count delta: 675
Iterating post reduction 0 with 675 rules applied. Total rules applied 677 place count 1221 transition count 993
Reduce places removed 675 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 712 rules applied. Total rules applied 1389 place count 546 transition count 956
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1406 place count 529 transition count 956
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1406 place count 529 transition count 891
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1536 place count 464 transition count 891
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1558 place count 442 transition count 855
Iterating global reduction 3 with 22 rules applied. Total rules applied 1580 place count 442 transition count 855
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 3 with 4 rules applied. Total rules applied 1584 place count 442 transition count 851
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1588 place count 438 transition count 851
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1602 place count 424 transition count 831
Iterating global reduction 5 with 14 rules applied. Total rules applied 1616 place count 424 transition count 831
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1623 place count 424 transition count 824
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1626 place count 421 transition count 818
Iterating global reduction 6 with 3 rules applied. Total rules applied 1629 place count 421 transition count 818
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1632 place count 418 transition count 812
Iterating global reduction 6 with 3 rules applied. Total rules applied 1635 place count 418 transition count 812
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1638 place count 415 transition count 806
Iterating global reduction 6 with 3 rules applied. Total rules applied 1641 place count 415 transition count 806
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1644 place count 412 transition count 800
Iterating global reduction 6 with 3 rules applied. Total rules applied 1647 place count 412 transition count 800
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1650 place count 409 transition count 794
Iterating global reduction 6 with 3 rules applied. Total rules applied 1653 place count 409 transition count 794
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1656 place count 406 transition count 788
Iterating global reduction 6 with 3 rules applied. Total rules applied 1659 place count 406 transition count 788
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1662 place count 403 transition count 782
Iterating global reduction 6 with 3 rules applied. Total rules applied 1665 place count 403 transition count 782
Performed 186 Post agglomeration using F-continuation condition with reduction of 107 identical transitions.
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 6 with 372 rules applied. Total rules applied 2037 place count 217 transition count 489
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2054 place count 217 transition count 472
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2062 place count 209 transition count 455
Iterating global reduction 7 with 8 rules applied. Total rules applied 2070 place count 209 transition count 455
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2071 place count 208 transition count 454
Iterating global reduction 7 with 1 rules applied. Total rules applied 2072 place count 208 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2073 place count 208 transition count 453
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2105 place count 192 transition count 433
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2120 place count 192 transition count 418
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2121 place count 191 transition count 414
Iterating global reduction 9 with 1 rules applied. Total rules applied 2122 place count 191 transition count 414
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 9 with 2 rules applied. Total rules applied 2124 place count 190 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2126 place count 190 transition count 411
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 48 rules applied. Total rules applied 2174 place count 166 transition count 462
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 2196 place count 166 transition count 440
Discarding 12 places :
Symmetric choice reduction at 11 with 12 rule applications. Total rules 2208 place count 154 transition count 416
Iterating global reduction 11 with 12 rules applied. Total rules applied 2220 place count 154 transition count 416
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 2228 place count 154 transition count 408
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2229 place count 154 transition count 408
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2230 place count 154 transition count 407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2231 place count 153 transition count 406
Applied a total of 2231 rules in 119 ms. Remains 153 /2124 variables (removed 1971) and now considering 406/2719 (removed 2313) transitions.
[2025-05-30 11:07:49] [INFO ] Flow matrix only has 329 transitions (discarded 77 similar events)
// Phase 1: matrix 329 rows 153 cols
[2025-05-30 11:07:49] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:07:49] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-30 11:07:49] [INFO ] Flow matrix only has 329 transitions (discarded 77 similar events)
[2025-05-30 11:07:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:07:49] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 11:07:49] [INFO ] Implicit Places using invariants and state equation in 319 ms returned [10, 79, 112]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 435 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 150/2124 places, 406/2719 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 147 transition count 403
Applied a total of 3 rules in 19 ms. Remains 147 /150 variables (removed 3) and now considering 403/406 (removed 3) transitions.
[2025-05-30 11:07:49] [INFO ] Flow matrix only has 326 transitions (discarded 77 similar events)
// Phase 1: matrix 326 rows 147 cols
[2025-05-30 11:07:49] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:07:49] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-30 11:07:49] [INFO ] Flow matrix only has 326 transitions (discarded 77 similar events)
[2025-05-30 11:07:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:07:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 11:07:49] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 147/2124 places, 403/2719 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 913 ms. Remains : 147/2124 places, 403/2719 transitions.
Running random walk in product with property : CloudReconfiguration-PT-401-LTLCardinality-09
Stuttering criterion allowed to conclude after 3857 steps with 289 reset in 6 ms.
Treatment of property CloudReconfiguration-PT-401-LTLCardinality-09 finished in 1254 ms.
FORMULA CloudReconfiguration-PT-401-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-05-30 11:07:49] [INFO ] Flatten gal took : 64 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 829392 ms.

BK_STOP 1748603270083

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="CloudReconfiguration-PT-401"
export BK_EXAMINATION="LTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-401, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028300363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-401.tgz
mv CloudReconfiguration-PT-401 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;