About the Execution of LTSMin+red for ShieldIIPt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 565.567 | 343069.00 | 631793.00 | 569.40 | F | normal |
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.r530-tall-171683778800203.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 ShieldIIPt-PT-050A, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683778800203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 3.4K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 23:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 22:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 22:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 265K 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1717223767137
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:36:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 06:36:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:36:08] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-01 06:36:08] [INFO ] Transformed 953 places.
[2024-06-01 06:36:08] [INFO ] Transformed 703 transitions.
[2024-06-01 06:36:08] [INFO ] Found NUPN structural information;
[2024-06-01 06:36:08] [INFO ] Parsed PT model containing 953 places and 703 transitions and 3006 arcs in 246 ms.
Structural test allowed to assert that 403 places are NOT stable. Took 10 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 3671 ms. (10 steps per ms) remains 374/550 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 30 ms. (12 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 374/374 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 374/374 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 374/374 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 374/374 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 374/374 properties
// Phase 1: matrix 702 rows 953 cols
[2024-06-01 06:36:09] [INFO ] Computed 451 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 374/374 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/1655 variables, and 374 constraints, problems are : Problem set: 0 solved, 374 unsolved in 5193 ms.
Refiners :[Domain max(s): 374/953 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/953 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 374/374 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 273/647 variables, 306/680 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 273/953 constraints. Problems are: Problem set: 0 solved, 374 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 1)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 0)
(s260 1)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 0)
(s267 1)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 0)
(s279 1)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 0)
(s298 1)
(s299 1)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 1)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 1)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 1)
(s356 1)
(s357 0)
(s358 1)
(s359 0)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 1)
(s371 0)
(s372 1)
(s373 0)
(s374 1)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 1)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 1)
(s395 0)
(s396 1)
(s397 0)
(s398 1)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 1)
(s409 0)
(s410 1)
(s411 0)
(s412 1)
(s413 1)
(s414 0)
(s415 1)
(s416 0)
(s417 1)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 1)
(s428 0)
(s429 1)
(s430 0)
(s431 1)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 1)
(s445 0)
(s446 1)
(s447 0)
(s448 1)
(s449 0)
(s450 1)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 1)
(s456 0)
(s457 1)
(s458 0)
(s459 0)
(s460 1)
(s461 0)
(s462 0)
(s463 1)
(s464 0)
(s465 1)
(s466 0)
(s467 1)
(s468 0)
(s469 1)
(s470 1)
(s471 0)
(s472 1)
(s473 0)
(s474 1)
(s475 0)
(s476 1)
(s477 0)
(s478 0)
(s479 1)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 1)
(s490 0)
(s491 1)
(s492 0)
(s493 1)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 1)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 1)
(s504 0)
(s505 1)
(s506 0)
(s507 1)
(s508 1)
(s509 0)
(s510 1)
(s511 0)
(s512 1)
(s513 0)
(s514 1)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 1)
(s521 0)
(s522 1)
(s523 0)
(s524 1)
(s525 0)
(s526 1)
(s527 1)
(s528 0)
(s529 1)
(s530 0)
(s531 1)
(s532 0)
(s533 1)
(s534 0)
(s535 0)
(s536 1)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 1)
(s542 0)
(s543 1)
(s544 0)
(s545 1)
(s546 1)
(s547 0)
(s548 1)
(s549 0)
(s550 1)
(s551 0)
(s552 1)
(s553 0)
(s554 0)
(s555 1)
(s556 0)
(s557 0)
(s558 1)
(s559 0)
(s560 1)
(s561 0)
(s562 1)
(s563 0)
(s564 1)
(s565 1)
(s566 0)
(s567timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/1655 variables, and 953 constraints, problems are : Problem set: 0 solved, 374 unsolved in 5016 ms.
Refiners :[Domain max(s): 647/953 constraints, Positive P Invariants (semi-flows): 306/451 constraints, State Equation: 0/953 constraints, PredecessorRefiner: 0/374 constraints, Known Traps: 0/0 constraints]
After SMT, in 10350ms problems are : Problem set: 0 solved, 374 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 374 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Partial Free-agglomeration rule applied 32 times.
Drop transitions (Partial Free agglomeration) removed 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 36 place count 951 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 950 transition count 699
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 39 place count 948 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 39 place count 948 transition count 698
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 947 transition count 698
Applied a total of 41 rules in 208 ms. Remains 947 /953 variables (removed 6) and now considering 698/702 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 947/953 places, 698/702 transitions.
RANDOM walk for 4000000 steps (8 resets) in 105501 ms. (37 steps per ms) remains 223/374 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 279 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 279 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 278 ms. (143 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (8 resets) in 284 ms. (140 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (8 resets) in 329 ms. (121 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 284 ms. (140 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 277 ms. (143 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (8 resets) in 276 ms. (144 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 223/223 properties
// Phase 1: matrix 698 rows 947 cols
[2024-06-01 06:36:53] [INFO ] Computed 449 invariants in 4 ms
[2024-06-01 06:36:53] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 160/383 variables, 181/404 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 160/564 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 284/667 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 47/714 variables, 22/969 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 22/991 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/714 variables, 11/1002 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/714 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 40/754 variables, 26/1028 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/754 variables, 26/1054 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/754 variables, 11/1065 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/754 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (OVERLAPS) 2/756 variables, 2/1067 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/756 variables, 2/1069 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/756 variables, 2/1071 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/756 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 19 (OVERLAPS) 4/760 variables, 2/1073 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/760 variables, 4/1077 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/760 variables, 4/1081 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/760 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 23 (OVERLAPS) 20/780 variables, 10/1091 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/780 variables, 10/1101 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/780 variables, 5/1106 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/780 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 27 (OVERLAPS) 15/795 variables, 10/1116 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/795 variables, 10/1126 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/795 variables, 3/1129 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 795/1645 variables, and 1129 constraints, problems are : Problem set: 0 solved, 223 unsolved in 45015 ms.
Refiners :[Domain max(s): 457/947 constraints, Positive P Invariants (semi-flows): 215/449 constraints, State Equation: 457/947 constraints, ReadFeed: 0/17 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 160/383 variables, 181/404 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 160/564 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 284/667 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 205/1152 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 47/714 variables, 22/1174 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/714 variables, 22/1196 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/714 variables, 11/1207 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 18/1225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 0/1225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (OVERLAPS) 40/754 variables, 26/1251 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/754 variables, 26/1277 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/754 variables, 11/1288 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/754 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 17 (OVERLAPS) 2/756 variables, 2/1290 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/756 variables, 2/1292 constraints. Problems are: Problem set: 0 solved, 223 unsolved
SMT process timed out in 90070ms, After SMT, problems are : Problem set: 0 solved, 223 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 223 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 698/698 transitions.
Applied a total of 0 rules in 38 ms. Remains 947 /947 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 947/947 places, 698/698 transitions.
RANDOM walk for 4000000 steps (8 resets) in 88536 ms. (45 steps per ms) remains 163/223 properties
BEST_FIRST walk for 40002 steps (8 resets) in 307 ms. (129 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 322 ms. (123 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 333 ms. (119 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 328 ms. (121 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 317 ms. (125 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 303 ms. (131 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 320 ms. (124 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 326 ms. (122 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 323 ms. (123 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 326 ms. (122 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40002 steps (8 resets) in 325 ms. (122 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40003 steps (8 resets) in 321 ms. (124 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 163/163 properties
[2024-06-01 06:38:52] [INFO ] Invariant cache hit.
[2024-06-01 06:38:52] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 118/281 variables, 133/296 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 118/414 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 211/492 variables, 281/695 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 90/582 variables, 40/735 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 40/775 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 20/795 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (OVERLAPS) 118/700 variables, 68/863 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/700 variables, 68/931 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/700 variables, 26/957 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 15 (OVERLAPS) 8/708 variables, 8/965 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/708 variables, 8/973 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/708 variables, 8/981 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/708 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 19 (OVERLAPS) 16/724 variables, 8/989 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/724 variables, 16/1005 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/724 variables, 12/1017 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/724 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 23 (OVERLAPS) 56/780 variables, 38/1055 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/780 variables, 34/1089 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/780 variables, 17/1106 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/780 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 27 (OVERLAPS) 15/795 variables, 10/1116 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/795 variables, 10/1126 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/795 variables, 3/1129 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/795 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 31 (OVERLAPS) 1/796 variables, 2/1131 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/796 variables, 1/1132 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/796 variables, 1/1133 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/796 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 35 (OVERLAPS) 17/813 variables, 8/1141 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/813 variables, 8/1149 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/813 variables, 4/1153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/813 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 39 (OVERLAPS) 15/828 variables, 10/1163 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/828 variables, 10/1173 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/828 variables, 3/1176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/828 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 43 (OVERLAPS) 1/829 variables, 2/1178 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/829 variables, 1/1179 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/829 variables, 1/1180 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/829 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 47 (OVERLAPS) 17/846 variables, 8/1188 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/846 variables, 8/1196 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/846 variables, 4/1200 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/846 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 51 (OVERLAPS) 15/861 variables, 10/1210 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/861 variables, 10/1220 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/861 variables, 3/1223 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/861 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 55 (OVERLAPS) 1/862 variables, 2/1225 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/862 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/862 variables, 1/1227 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/862 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 59 (OVERLAPS) 17/879 variables, 8/1235 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/879 variables, 8/1243 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/879 variables, 4/1247 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/879 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 63 (OVERLAPS) 15/894 variables, 10/1257 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/894 variables, 10/1267 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/894 variables, 3/1270 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/894 variables, 0/1270 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 67 (OVERLAPS) 1/895 variables, 2/1272 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/895 variables, 1/1273 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/895 variables, 1/1274 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/895 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 71 (OVERLAPS) 17/912 variables, 8/1282 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/912 variables, 8/1290 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/912 variables, 4/1294 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/912 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 75 (OVERLAPS) 15/927 variables, 10/1304 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/927 variables, 10/1314 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/927 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/927 variables, 0/1317 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 79 (OVERLAPS) 1/928 variables, 2/1319 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/928 variables, 1/1320 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/928 variables, 1/1321 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 75.0 76.0))
(s1 (/ 1.0 76.0))
(s2 (/ 75.0 76.0))
(s3 (/ 1.0 76.0))
(s4 0.0)
(s5 (/ 75.0 76.0))
(s6 (/ 1.0 76.0))
(s7 (/ 1.0 76.0))
(s8 (/ 75.0 76.0))
(s9 (/ 75.0 76.0))
(s10 (/ 1.0 76.0))
(s11 (/ 75.0 76.0))
(s12 (/ 1.0 76.0))
(s13 (/ 151.0 152.0))
(s14 (/ 1.0 152.0))
(s15 (/ 1.0 76.0))
(s16 (/ 75.0 76.0))
(s17 (/ 1.0 76.0))
(s18 (/ 75.0 76.0))
(s19 (/ 1.0 76.0))
(s20 (/ 75.0 76.0))
(s21 (/ 75.0 76.0))
(s22 (/ 1.0 76.0))
(s23 0.0)
(s24 (/ 1.0 76.0))
(s25 (/ 75.0 76.0))
(s26 (/ 75.0 76.0))
(s27 (/ 1.0 76.0))
(s28 (/ 75.0 76.0))
(s29 (/ 1.0 76.0))
(s30 (/ 75.0 76.0))
(s31 (/ 1.0 76.0))
(s32 (/ 1.0 76.0))
(s33 (/ 75.0 76.0))
(s34 (/ 1.0 76.0))
(s35 (/ 75.0 76.0))
(s36 (/ 151.0 152.0))
(s37 (/ 1.0 152.0))
(s38 (/ 1.0 76.0))
(s39 (/ 75.0 76.0))
(s40 (/ 75.0 76.0))
(s41 (/ 1.0 76.0))
(s42 0.0)
(s43 (/ 75.0 76.0))
(s44 (/ 1.0 76.0))
(s45 (/ 1.0 76.0))
(s46 (/ 75.0 76.0))
(s47 (/ 75.0 76.0))
(s48 (/ 1.0 76.0))
(s49 (/ 75.0 76.0))
(s50 (/ 1.0 76.0))
(s51 (/ 61.0 76.0))
(s52 (/ 15.0 76.0))
(s53 (/ 1.0 76.0))
(s54 (/ 75.0 76.0))
(s55 (/ 1.0 76.0))
(s56 (/ 75.0 76.0))
(s57 (/ 1.0 76.0))
(s58 (/ 75.0 76.0))
(s59 (/ 75.0 76.0))
(s60 (/ 1.0 76.0))
(s61 (/ 67.0 76.0))
(s62 (/ 2.0 19.0))
(s63 (/ 1.0 76.0))
(s64 (/ 1.0 76.0))
(s65 (/ 2.0 19.0))
(s66 (/ 75.0 76.0))
(s67 (/ 1.0 76.0))
(s68 (/ 75.0 76.0))
(s69 (/ 1.0 76.0))
(s70 (/ 3.0 38.0))
(s71 (/ 35.0 38.0))
(s72 (/ 1.0 76.0))
(s73 (/ 75.0 76.0))
(s74 (/ 1.0 76.0))
(s75 (/ 75.0 76.0))
(s76 (/ 1.0 76.0))
(s77 (/ 75.0 76.0))
(s78 (/ 75.0 76.0))
(s79 (/ 1.0 76.0))
(s80 (/ 73.0 76.0))
(s81 (/ 1.0 76.0))
(s82 (/ 1.0 38.0))
(s83 (/ 1.0 76.0))
(s84 (/ 1.0 38.0))
(s85 (/ 75.0 76.0))
(s86 (/ 1.0 76.0))
(s87 (/ 75.0 76.0))
(s88 (/ 1.0 76.0))
(s89 (/ 1.0 76.0))
(s90 (/ 75.0 76.0))
(s91 (/ 1.0 76.0))
(s92 (/ 75.0 76.0))
(s93 (/ 1.0 76.0))
(s94 (/ 75.0 76.0))
(s95 (/ 1.0 76.0))
(s96 (/ 75.0 76.0))
(s97 (/ 75.0 76.0))
(s98 (/ 1.0 76.0))
(s99 (/ 73.0 76.0))
(s100 (/ 1.0 38.0))
(s101 (/ 1.0 76.0))
(s102 (/ 1.0 76.0))
(s103 (/ 1.0 38.0))
(s104 (/ 75.0 76.0))
(s105 (/ 1.0 76.0))
(s106 (/ 75.0 76.0))
(s107 (/ 1.0 76.0))
(s108 (/ 3.0 38.0))
(s109 (/ 35.0 38.0))
(s110 (/ 1.0 76.0))
(s111 (/ 75.0 76.0))
(s112 (/ 1.0 76.0))
(s113 (/ 75.0 76.0))
(s114 (/ 1.0 76.0))
(s115 (/ 75.0 76.0))
(s116 (/ 75.0 76.0))
(s117 (/ 1.0 76.0))
(s118 0.0)
(s119 (/ 1.0 76.0))
(s120 (/ 75.0 76.0))
(s121 (/ 75.0 76.0))
(s122 (/ 1.0 76.0))
(s123 (/ 75.0 76.0))
(s124 (/ 1.0 76.0))
(s125 (/ 75.0 76.0))
(s126 (/ 1.0 76.0))
(s127 (/ 1.0 76.0))
(s128 (/ 75.0 76.0))
(s129 (/ 1.0 76.0))
(s130 (/ 75.0 76.0))
(s131 1.0)
(s132 0.0)
(s133 (/ 1.0 76.0))
(s134 (/ 75.0 76.0))
(s135 (/ 75.0 76.0))
(s136 (/ 1.0 76.0))
(s137 (/ 37.0 38.0))
(s138 (/ 1.0 76.0))
(s139 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 928/1645 variables, and 1321 constraints, problems are : Problem set: 0 solved, 163 unsolved in 75012 ms.
Refiners :[Domain max(s): 534/947 constraints, Positive P Invariants (semi-flows): 253/449 constraints, State Equation: 534/947 constraints, ReadFeed: 0/17 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 118/281 variables, 133/296 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 118/414 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 211/492 variables, 281/695 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 141/836 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 90/582 variables, 40/876 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 40/916 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 20/936 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 22/958 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (OVERLAPS) 118/700 variables, 68/1026 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 68/1094 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/700 variables, 26/1120 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/700 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 17 (OVERLAPS) 8/708 variables, 8/1128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/708 variables, 8/1136 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/708 variables, 8/1144 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/708 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 21 (OVERLAPS) 16/724 variables, 8/1152 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/724 variables, 16/1168 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/724 variables, 12/1180 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/724 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 25 (OVERLAPS) 56/780 variables, 38/1218 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/780 variables, 34/1252 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/780 variables, 17/1269 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/780 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 29 (OVERLAPS) 15/795 variables, 10/1279 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/795 variables, 10/1289 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/795 variables, 3/1292 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/795 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 33 (OVERLAPS) 1/796 variables, 2/1294 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/796 variables, 1/1295 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/796 variables, 1/1296 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/796 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 37 (OVERLAPS) 17/813 variables, 8/1304 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/813 variables, 8/1312 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/813 variables, 4/1316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/813 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 41 (OVERLAPS) 15/828 variables, 10/1326 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/828 variables, 10/1336 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/828 variables, 3/1339 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/828 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 45 (OVERLAPS) 1/829 variables, 2/1341 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/829 variables, 1/1342 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/829 variables, 1/1343 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/829 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 49 (OVERLAPS) 17/846 variables, 8/1351 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/846 variables, 8/1359 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/846 variables, 4/1363 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/846 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 53 (OVERLAPS) 15/861 variables, 10/1373 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/861 variables, 10/1383 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/861 variables, 3/1386 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/861 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 57 (OVERLAPS) 1/862 variables, 2/1388 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/862 variables, 1/1389 constraints. Problems are: Problem set: 0 solved, 163 unsolved
SMT process timed out in 150061ms, After SMT, problems are : Problem set: 0 solved, 163 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 163 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 698/698 transitions.
Applied a total of 0 rules in 44 ms. Remains 947 /947 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 947/947 places, 698/698 transitions.
RANDOM walk for 4000000 steps (8 resets) in 72982 ms. (54 steps per ms) remains 158/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 386 ms. (103 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 449 ms. (88 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 373 ms. (106 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 363 ms. (109 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 354 ms. (112 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 495 ms. (80 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 457 ms. (87 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40002 steps (8 resets) in 468 ms. (85 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40002 steps (8 resets) in 368 ms. (108 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 158/158 properties
Finished probabilistic random walk after 39259 steps, run visited all 158 properties in 1731 ms. (steps per millisecond=22 )
Probabilistic random walk after 39259 steps, saw 38175 distinct states, run finished after 1738 ms. (steps per millisecond=22 ) properties seen :158
Able to resolve query StableMarking after proving 551 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 341952 ms.
ITS solved all properties within timeout
BK_STOP 1717224110206
--------------------
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 StableMarking -timeout 180 -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="ShieldIIPt-PT-050A"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldIIPt-PT-050A, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r530-tall-171683778800203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050A.tgz
mv ShieldIIPt-PT-050A execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;