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.r355-tall-171683758200166.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 greatspnxred
Input is ShieldIIPs-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758200166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 868K 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 ShieldIIPs-PT-100A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716920349113

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 18:19:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 18:19:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:19:10] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-05-28 18:19:10] [INFO ] Transformed 2503 places.
[2024-05-28 18:19:10] [INFO ] Transformed 2403 transitions.
[2024-05-28 18:19:10] [INFO ] Found NUPN structural information;
[2024-05-28 18:19:10] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2444 ms. (16 steps per ms) remains 5/14 properties
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 730 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 582 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 554 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 862 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 5/5 properties
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-28 18:19:12] [INFO ] Computed 901 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/275 variables, 90/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 190/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2228/2503 variables, 811/1176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 2228/3404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2403/4906 variables, 2503/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4906/4906 variables, and 5907 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2611 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/275 variables, 90/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 190/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2228/2503 variables, 811/1176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 2228/3404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:19:16] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 13 ms to minimize.
[2024-05-28 18:19:16] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-28 18:19:16] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-28 18:19:16] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 18:19:16] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 5/3409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2503 variables, 0/3409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2403/4906 variables, 2503/5912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4906 variables, 5/5917 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 1)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 1)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 1)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 1)
(s283 1)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 1)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 0)
(s404 1)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 1)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 0)
(s453 0)
(s454 1)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 1)
(s472 0)
(s473 0)
(s474 0)
(s475 1)
(s476 0)
(s477 0)
(s478 0)
(s479 1)
(s480 0)
(s481 1)
(s482 0)
(s483 1)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 0)
(s499 1)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 1)
(s505 0)
(s506 0)
(s507 1)
(s508 1)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 1)
(s515 0)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 1)
(s521 0)
(s522 0)
(s523 0)
(s524 1)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 1)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 1)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 1)
(s555 0)
(s556 1)
(s557 0)
(s558 0)
(s559 1)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 1)
(s565 0)
(s566 0)
(s567 0)
(s568 1)
(s569 0)
(s570 0)
(s571 1)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4906/4906 variables, and 5917 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5019 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 7775ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 656 times.
Drop transitions (Partial Free agglomeration) removed 656 transitions
Iterating global reduction 0 with 656 rules applied. Total rules applied 660 place count 2501 transition count 2401
Applied a total of 660 rules in 768 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 779 ms. Remains : 2501/2503 places, 2401/2403 transitions.
RANDOM walk for 40000 steps (8 resets) in 1343 ms. (29 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 712 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 702 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 589 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 562 ms. (71 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 521 ms. (76 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 85475 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 5
Probabilistic random walk after 85475 steps, saw 82352 distinct states, run finished after 3005 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-28 18:19:25] [INFO ] Computed 901 invariants in 158 ms
[2024-05-28 18:19:25] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/275 variables, 90/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 190/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2206/2481 variables, 801/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2481 variables, 2206/3372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2481 variables, 0/3372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 20/2501 variables, 10/3382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 20/3402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2525 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 891/891 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/275 variables, 90/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 190/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2206/2481 variables, 801/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2481 variables, 2206/3372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:19:29] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2024-05-28 18:19:29] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-28 18:19:29] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-28 18:19:29] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-28 18:19:29] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-28 18:19:29] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:19:29] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-28 18:19:29] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-28 18:19:30] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:19:30] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:19:30] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:19:30] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:19:30] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-28 18:19:30] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2481 variables, 14/3386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2481 variables, 0/3386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 20/2501 variables, 10/3396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 20/3416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:19:31] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2501 variables, 1/3417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2501 variables, 0/3417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2401/4902 variables, 2501/5918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4902 variables, 4/5922 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4902 variables, 5/5927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:19:38] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-05-28 18:19:38] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 2 ms to minimize.
[2024-05-28 18:19:38] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 3 ms to minimize.
[2024-05-28 18:19:39] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-05-28 18:19:39] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-28 18:19:39] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-28 18:19:39] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-28 18:19:40] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-05-28 18:19:40] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-05-28 18:19:40] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-28 18:19:41] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-28 18:19:41] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-28 18:19:41] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-28 18:19:42] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 4 ms to minimize.
[2024-05-28 18:19:42] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-28 18:19:42] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-28 18:19:42] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:19:42] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:19:43] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 18:19:44] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4902 variables, 20/5947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:19:45] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:19:45] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:19:46] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2024-05-28 18:19:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:19:46] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4902 variables, 5/5952 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:19:49] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 1/5953 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:19:51] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:19:51] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-28 18:19:51] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 3/5956 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4902 variables, 0/5956 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/4902 variables, 0/5956 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5956 constraints, problems are : Problem set: 0 solved, 5 unsolved in 29089 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 891/891 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 44/44 constraints]
After SMT, in 31836ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 88180 steps, including 1000 resets, run visited all 5 properties in 2189 ms. (steps per millisecond=40 )
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 2199 ms.
All properties solved without resorting to model-checking.
Total runtime 49339 ms.
ITS solved all properties within timeout

BK_STOP 1716920399697

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="ShieldIIPs-PT-100A"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldIIPs-PT-100A, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758200166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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