Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761500639.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761500639
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 376K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717257829138

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:03:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:03:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:03:50] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-06-01 16:03:50] [INFO ] Transformed 1563 places.
[2024-06-01 16:03:50] [INFO ] Transformed 1423 transitions.
[2024-06-01 16:03:50] [INFO ] Found NUPN structural information;
[2024-06-01 16:03:50] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1665 ms. (24 steps per ms) remains 8/16 properties
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1092 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
// Phase 1: matrix 1423 rows 1563 cols
[2024-06-01 16:03:51] [INFO ] Computed 221 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1376/1551 variables, 220/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1551 variables, 1376/1771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1551 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 12/1563 variables, 1/1772 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1563 variables, 12/1784 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1563 variables, 0/1784 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1423/2986 variables, 1563/3347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2986 variables, 0/3347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2986 variables, 0/3347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2986/2986 variables, and 3347 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2604 ms.
Refiners :[Domain max(s): 1563/1563 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1563/1563 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1376/1551 variables, 220/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1551 variables, 1376/1771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 16:03:55] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 39 ms to minimize.
[2024-06-01 16:03:55] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 5 ms to minimize.
[2024-06-01 16:03:55] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 5 ms to minimize.
[2024-06-01 16:03:55] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 4 ms to minimize.
[2024-06-01 16:03:56] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:03:56] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:03:56] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 4 ms to minimize.
[2024-06-01 16:03:56] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 4 ms to minimize.
[2024-06-01 16:03:56] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 4 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:03:57] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1551 variables, 20/1791 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:03:58] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:03:59] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(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 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(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 1)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(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 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(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 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 1)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(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 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 0)
(s352 1)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 1)
(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 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 1)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 1)
(s433 1)
(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 1)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 1)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 1)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 1)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 0)
(s509 1)
(s510 0)
(s511 0)
(s512 0)
(s513 1)
(s514 0)
(s515 1)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 1)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 1)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 1)
(s578 0)
(s579 1)
(s580 0)
(s581 1)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 1)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 1)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 1)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 1)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 1)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 1)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 1)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 0)
(s666 1)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 1)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 1)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 1)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 1)
(s725 0)
(s726 0)
(s727 1)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 1)
(s739 1)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 1)
(s746 1)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 1)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 1)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 1)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 1)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 1)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 1)
(s808 0)
(s809 1)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 1)
(s815 0)
(s816 1)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 1)
(s822 0)
(s823 0)
(s824 1)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 1)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 1)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 1)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 1)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 1)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 1)
(s886 1)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 1)
(s892 0)
(s893 1)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 1)
(s900 0)
(s901 1)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 1)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 1)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 1)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 1)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 1)
(s958 1)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 1)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 1)
(s977 0)
(s978 1)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 1)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 1)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 1)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 1)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 1)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 1)
(s1054 0)
(s1055 1)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 1)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 1)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 1)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 1)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 1)
(s1111 0)
(s1112 1)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 1)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 1)
(s1131 1)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 1)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 1)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 1)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 1)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 1)
(s1189 1)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 1)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 1)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 1)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 1)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 1)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 1)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 1)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 1)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 1)
(s1277 0)
(s1278 1)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 1)
(s1285 0)
(s1286 1)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1551/2986 variables, and 1799 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5017 ms.
Refiners :[Domain max(s): 1551/1563 constraints, Positive P Invariants (semi-flows): 220/221 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 28/28 constraints]
After SMT, in 7762ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 175 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 1563 transition count 1172
Reduce places removed 251 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 1 with 301 rules applied. Total rules applied 552 place count 1312 transition count 1122
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 602 place count 1262 transition count 1122
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 602 place count 1262 transition count 1038
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 770 place count 1178 transition count 1038
Discarding 114 places :
Symmetric choice reduction at 3 with 114 rule applications. Total rules 884 place count 1064 transition count 924
Iterating global reduction 3 with 114 rules applied. Total rules applied 998 place count 1064 transition count 924
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 999 place count 1064 transition count 923
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 999 place count 1064 transition count 892
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1061 place count 1033 transition count 892
Performed 265 Post agglomeration using F-continuation condition.Transition count delta: 265
Deduced a syphon composed of 265 places in 4 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 4 with 530 rules applied. Total rules applied 1591 place count 768 transition count 627
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1653 place count 737 transition count 627
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1654 place count 737 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1655 place count 736 transition count 626
Partial Free-agglomeration rule applied 50 times.
Drop transitions (Partial Free agglomeration) removed 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 1705 place count 736 transition count 626
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1706 place count 735 transition count 625
Applied a total of 1706 rules in 503 ms. Remains 735 /1563 variables (removed 828) and now considering 625/1423 (removed 798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 735/1563 places, 625/1423 transitions.
RANDOM walk for 40000 steps (8 resets) in 623 ms. (64 steps per ms) remains 4/8 properties
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
// Phase 1: matrix 625 rows 735 cols
[2024-06-01 16:04:00] [INFO ] Computed 221 invariants in 5 ms
[2024-06-01 16:04:00] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 588/726 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/726 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/735 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/735 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 625/1360 variables, 735/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 56/1012 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1360/1360 variables, and 1012 constraints, problems are : Problem set: 0 solved, 4 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 735/735 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 588/726 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:01] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:04:01] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:04:01] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:04:01] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 4 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 3 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 3 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:04:02] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/726 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:04:03] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:04:04] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:04:04] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:04:04] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 9 ms to minimize.
[2024-06-01 16:04:04] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:04:04] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 10/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:04] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/726 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:04] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:04:04] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:04:04] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 9/735 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:04:05] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:04:06] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:04:06] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/735 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 625/1360 variables, 735/1001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1360 variables, 56/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1360 variables, 4/1061 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:07] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:04:07] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:04:07] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 3 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:04:08] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:04:09] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:04:09] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:04:09] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:04:09] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1360 variables, 14/1075 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1360 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1360 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1360/1360 variables, and 1075 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9328 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 735/735 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 59/59 constraints]
After SMT, in 10157ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2586 ms.
Support contains 138 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 625/625 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 735 transition count 619
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 729 transition count 619
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 729 transition count 614
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 724 transition count 614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 722 transition count 611
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 722 transition count 611
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 722 transition count 610
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 721 transition count 610
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 68 place count 701 transition count 590
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 699 transition count 590
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 699 transition count 588
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 697 transition count 588
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 81 place count 697 transition count 588
Applied a total of 81 rules in 156 ms. Remains 697 /735 variables (removed 38) and now considering 588/625 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 697/735 places, 588/625 transitions.
RANDOM walk for 40000 steps (8 resets) in 409 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 201070 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 4
Probabilistic random walk after 201070 steps, saw 117619 distinct states, run finished after 3005 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 588 rows 697 cols
[2024-06-01 16:04:16] [INFO ] Computed 221 invariants in 9 ms
[2024-06-01 16:04:16] [INFO ] State equation strengthened by 66 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 550/688 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/697 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 588/1285 variables, 697/918 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1285 variables, 66/984 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1285 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1285 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1285/1285 variables, and 984 constraints, problems are : Problem set: 0 solved, 4 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 697/697 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 550/688 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:17] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:04:17] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 3 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 3 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:04:18] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:04:19] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 10/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 3 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:04:20] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:21] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:21] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-06-01 16:04:21] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:21] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:21] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 9/697 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/697 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 588/1285 variables, 697/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1285 variables, 66/1022 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1285 variables, 4/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:04:23] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:04:24] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1285 variables, 8/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1285 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1285 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1285/1285 variables, and 1034 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8437 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 697/697 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 46/46 constraints]
After SMT, in 9248ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 6271 ms.
Support contains 138 out of 697 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 697/697 places, 588/588 transitions.
Applied a total of 0 rules in 18 ms. Remains 697 /697 variables (removed 0) and now considering 588/588 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 697/697 places, 588/588 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 697/697 places, 588/588 transitions.
Applied a total of 0 rules in 16 ms. Remains 697 /697 variables (removed 0) and now considering 588/588 (removed 0) transitions.
[2024-06-01 16:04:32] [INFO ] Invariant cache hit.
[2024-06-01 16:04:32] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 16:04:32] [INFO ] Invariant cache hit.
[2024-06-01 16:04:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 16:04:33] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
[2024-06-01 16:04:33] [INFO ] Redundant transitions in 32 ms returned []
Running 586 sub problems to find dead transitions.
[2024-06-01 16:04:33] [INFO ] Invariant cache hit.
[2024-06-01 16:04:33] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/695 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (OVERLAPS) 2/697 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/697 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/697 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:04:57] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 16:04:57] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:04:57] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:04:57] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:04:57] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:04:58] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:04:58] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:04:58] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:04:58] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
SMT process timed out in 30179ms, After SMT, problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 30187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31639 ms. Remains : 697/697 places, 588/588 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 61 times.
Drop transitions (Partial Free agglomeration) removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 697 transition count 588
Applied a total of 61 rules in 29 ms. Remains 697 /697 variables (removed 0) and now considering 588/588 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 588 rows 697 cols
[2024-06-01 16:05:04] [INFO ] Computed 221 invariants in 2 ms
[2024-06-01 16:05:04] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 16:05:04] [INFO ] [Nat]Absence check using 221 positive place invariants in 39 ms returned sat
[2024-06-01 16:05:04] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 16:05:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 16:05:05] [INFO ] After 437ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 16:05:05] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:05:05] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 3 ms to minimize.
[2024-06-01 16:05:05] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:05:05] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 3 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:05:06] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 3 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:05:07] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2741 ms
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 3 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1511 ms
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:05:10] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1266 ms
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 3 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:05:11] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 775 ms
TRAPS : Iteration 1
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:05:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 567 ms
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:05:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 889 ms
[2024-06-01 16:05:13] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 614 ms
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:05:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
TRAPS : Iteration 2
[2024-06-01 16:05:15] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:05:15] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:05:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2024-06-01 16:05:15] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:15] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:05:15] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:05:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 356 ms
[2024-06-01 16:05:16] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
TRAPS : Iteration 3
[2024-06-01 16:05:16] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:05:16] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2024-06-01 16:05:16] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 3 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 847 ms
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:05:18] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:05:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 357 ms
[2024-06-01 16:05:18] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:05:18] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:05:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
TRAPS : Iteration 4
[2024-06-01 16:05:18] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-06-01 16:05:18] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:05:19] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:05:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2024-06-01 16:05:19] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
TRAPS : Iteration 5
[2024-06-01 16:05:19] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2024-06-01 16:05:20] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
TRAPS : Iteration 6
[2024-06-01 16:05:20] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:05:21] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:05:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2024-06-01 16:05:21] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:05:21] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
TRAPS : Iteration 7
[2024-06-01 16:05:21] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:05:21] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 3 ms to minimize.
[2024-06-01 16:05:22] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:05:22] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:05:22] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 3 ms to minimize.
[2024-06-01 16:05:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 656 ms
[2024-06-01 16:05:22] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:05:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-06-01 16:05:23] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
TRAPS : Iteration 8
[2024-06-01 16:05:23] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
TRAPS : Iteration 9
[2024-06-01 16:05:24] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:05:24] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:05:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2024-06-01 16:05:24] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
TRAPS : Iteration 10
[2024-06-01 16:05:25] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-06-01 16:05:25] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:05:26] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:05:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2024-06-01 16:05:26] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:05:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2024-06-01 16:05:26] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
TRAPS : Iteration 11
[2024-06-01 16:05:26] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:05:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-06-01 16:05:27] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-06-01 16:05:27] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
TRAPS : Iteration 12
[2024-06-01 16:05:28] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
TRAPS : Iteration 13
[2024-06-01 16:05:28] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 3 ms to minimize.
[2024-06-01 16:05:28] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 3 ms to minimize.
[2024-06-01 16:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2024-06-01 16:05:29] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:05:29] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2024-06-01 16:05:29] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:05:29] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
TRAPS : Iteration 14
[2024-06-01 16:05:30] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
TRAPS : Iteration 15
[2024-06-01 16:05:31] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-06-01 16:05:31] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-06-01 16:05:31] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
TRAPS : Iteration 16
[2024-06-01 16:05:32] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:05:33] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:05:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
TRAPS : Iteration 17
[2024-06-01 16:05:33] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:05:33] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:05:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
TRAPS : Iteration 18
[2024-06-01 16:05:34] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2024-06-01 16:05:34] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:05:34] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:05:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
TRAPS : Iteration 19
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:05:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 448 ms
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:05:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-06-01 16:05:36] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:05:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
TRAPS : Iteration 20
[2024-06-01 16:05:37] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:05:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
TRAPS : Iteration 21
[2024-06-01 16:05:38] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
TRAPS : Iteration 22
[2024-06-01 16:05:39] [INFO ] After 34213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 16:05:39] [INFO ] After 35662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 35845 ms.
[2024-06-01 16:05:39] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-01 16:05:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 697 places, 588 transitions and 2167 arcs took 14 ms.
[2024-06-01 16:05:40] [INFO ] Flatten gal took : 79 ms
Total runtime 109950 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPt-PT-020B-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldPPPt-PT-020B-ReachabilityFireability-2024-11
Could not compute solution for formula : ShieldPPPt-PT-020B-ReachabilityFireability-2024-12
Could not compute solution for formula : ShieldPPPt-PT-020B-ReachabilityFireability-2024-14

BK_STOP 1717257940433

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldPPPt-PT-020B-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/1614/inv_0_
rfs formula name ShieldPPPt-PT-020B-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/1614/inv_1_
rfs formula name ShieldPPPt-PT-020B-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/1614/inv_2_
rfs formula name ShieldPPPt-PT-020B-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/1614/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761500639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;