About the Execution of LTSMin+red for Parking-PT-832
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
725.023 | 183711.00 | 467359.00 | 329.10 | T | 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.r514-smll-171654416600057.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 Parking-PT-832, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r514-smll-171654416600057
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.7K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 251K 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 QuasiLiveness
=== Now, execution of the tool begins
BK_START 1717242899112
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Parking-PT-832
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:55:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 11:55:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:55:01] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2024-06-01 11:55:01] [INFO ] Transformed 737 places.
[2024-06-01 11:55:01] [INFO ] Transformed 993 transitions.
[2024-06-01 11:55:01] [INFO ] Found NUPN structural information;
[2024-06-01 11:55:01] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 524 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 737/737 places, 993/993 transitions.
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 737 transition count 593
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 416 place count 721 transition count 593
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 416 place count 721 transition count 577
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 448 place count 705 transition count 577
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 512 place count 673 transition count 545
Applied a total of 512 rules in 176 ms. Remains 673 /737 variables (removed 64) and now considering 545/993 (removed 448) transitions.
// Phase 1: matrix 545 rows 673 cols
[2024-06-01 11:55:01] [INFO ] Computed 184 invariants in 41 ms
[2024-06-01 11:55:03] [INFO ] Implicit Places using invariants in 1393 ms returned [135, 142, 148, 154, 178, 180, 205, 212, 218, 224, 248, 250, 275, 282, 288, 294, 318, 320, 345, 352, 358, 364, 388, 390, 415, 422, 428, 434, 458, 460, 485, 492, 498, 504, 528, 530, 555, 562, 568, 574, 598, 600, 625, 632, 638, 644, 668, 670]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 1468 ms to find 48 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 625/737 places, 545/993 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 585 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 584 transition count 524
Applied a total of 82 rules in 42 ms. Remains 584 /625 variables (removed 41) and now considering 524/545 (removed 21) transitions.
// Phase 1: matrix 524 rows 584 cols
[2024-06-01 11:55:03] [INFO ] Computed 136 invariants in 6 ms
[2024-06-01 11:55:03] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-06-01 11:55:03] [INFO ] Invariant cache hit.
[2024-06-01 11:55:04] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 11:55:06] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 2915 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 584/737 places, 524/993 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 4642 ms. Remains : 584/737 places, 524/993 transitions.
Discarding 196 transitions out of 524. Remains 328
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (205 resets) in 3537 ms. (11 steps per ms) remains 110/327 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
[2024-06-01 11:55:07] [INFO ] Invariant cache hit.
[2024-06-01 11:55:07] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 325/542 variables, 115/332 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 325/657 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 42/584 variables, 21/678 constraints. Problems are: Problem set: 0 solved, 110 unsolved
SMT process timed out in 5229ms, After SMT, problems are : Problem set: 0 solved, 110 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 217 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 524/524 transitions.
Free-agglomeration rule applied 56 times.
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 584 transition count 468
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 112 place count 528 transition count 468
Applied a total of 112 rules in 191 ms. Remains 528 /584 variables (removed 56) and now considering 468/524 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 528/584 places, 468/524 transitions.
RANDOM walk for 4000000 steps (17534 resets) in 76525 ms. (52 steps per ms) remains 81/110 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1695 ms. (235 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1857 ms. (215 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (41 resets) in 1424 ms. (280 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (41 resets) in 1255 ms. (318 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1680 ms. (237 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (42 resets) in 1401 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1247 ms. (320 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1225 ms. (326 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1245 ms. (321 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1234 ms. (323 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1229 ms. (325 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1239 ms. (322 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1219 ms. (327 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1222 ms. (327 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1224 ms. (326 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1238 ms. (322 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1570 ms. (254 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1426 ms. (280 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1216 ms. (328 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1203 ms. (332 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (41 resets) in 1205 ms. (331 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1217 ms. (328 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1212 ms. (329 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1206 ms. (331 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1208 ms. (330 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1214 ms. (329 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1212 ms. (329 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1227 ms. (325 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1224 ms. (326 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1217 ms. (328 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1513 ms. (264 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1460 ms. (273 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1224 ms. (326 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1236 ms. (323 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1383 ms. (289 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1593 ms. (250 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1224 ms. (326 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1223 ms. (326 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1219 ms. (327 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1216 ms. (328 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (42 resets) in 1300 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (43 resets) in 1356 ms. (294 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1812 ms. (220 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (42 resets) in 1792 ms. (223 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (41 resets) in 1373 ms. (291 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1334 ms. (299 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (43 resets) in 1260 ms. (317 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1234 ms. (323 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1210 ms. (330 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1433 ms. (278 steps per ms) remains 81/81 properties
// Phase 1: matrix 468 rows 528 cols
[2024-06-01 11:55:50] [INFO ] Computed 136 invariants in 6 ms
[2024-06-01 11:55:50] [INFO ] State equation strengthened by 249 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 293/455 variables, 89/251 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 293/544 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 73/528 variables, 47/591 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 73/664 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 468/996 variables, 528/1192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/996 variables, 249/1441 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/996 variables, 0/1441 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/996 variables, 0/1441 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 996/996 variables, and 1441 constraints, problems are : Problem set: 0 solved, 81 unsolved in 22408 ms.
Refiners :[Domain max(s): 528/528 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 528/528 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 293/455 variables, 89/251 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 293/544 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 73/528 variables, 47/591 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 73/664 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 468/996 variables, 528/1192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/996 variables, 249/1441 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/996 variables, 81/1522 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/996 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/996 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 996/996 variables, and 1522 constraints, problems are : Problem set: 0 solved, 81 unsolved in 29138 ms.
Refiners :[Domain max(s): 528/528 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 528/528 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 51669ms problems are : Problem set: 0 solved, 81 unsolved
Parikh walk visited 38 properties in 16579 ms.
Support contains 86 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 468/468 transitions.
Free-agglomeration rule applied 64 times.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 528 transition count 404
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 128 place count 464 transition count 404
Applied a total of 128 rules in 66 ms. Remains 464 /528 variables (removed 64) and now considering 404/468 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 464/528 places, 404/468 transitions.
RANDOM walk for 4000000 steps (8 resets) in 39390 ms. (101 steps per ms) remains 35/43 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1439 ms. (277 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1872 ms. (213 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1435 ms. (278 steps per ms) remains 30/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1615 ms. (247 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1609 ms. (248 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1338 ms. (298 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1342 ms. (297 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1329 ms. (300 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1330 ms. (300 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1326 ms. (301 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1333 ms. (299 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1327 ms. (301 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1325 ms. (301 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1328 ms. (300 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1325 ms. (301 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1312 ms. (304 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1326 ms. (301 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1314 ms. (304 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1328 ms. (300 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1322 ms. (302 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1688 ms. (236 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1635 ms. (244 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1713 ms. (233 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1966 ms. (203 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1688 ms. (236 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1709 ms. (233 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1728 ms. (231 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1724 ms. (231 steps per ms) remains 26/26 properties
// Phase 1: matrix 404 rows 464 cols
[2024-06-01 11:57:20] [INFO ] Computed 136 invariants in 3 ms
[2024-06-01 11:57:20] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 217/269 variables, 32/84 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 217/301 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 195/464 variables, 104/405 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 195/600 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 404/868 variables, 464/1064 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/868 variables, 313/1377 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/868 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/868 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 868/868 variables, and 1377 constraints, problems are : Problem set: 0 solved, 26 unsolved in 4163 ms.
Refiners :[Domain max(s): 464/464 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 464/464 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 217/269 variables, 32/84 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 217/301 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 195/464 variables, 104/405 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 195/600 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 404/868 variables, 464/1064 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/868 variables, 313/1377 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/868 variables, 26/1403 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/868 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/868 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 868/868 variables, and 1403 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5082 ms.
Refiners :[Domain max(s): 464/464 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 464/464 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 9299ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 3 properties in 2337 ms.
Support contains 46 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 404/404 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 464 transition count 384
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 444 transition count 384
Applied a total of 40 rules in 56 ms. Remains 444 /464 variables (removed 20) and now considering 384/404 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 444/464 places, 384/404 transitions.
RANDOM walk for 4000000 steps (8 resets) in 36170 ms. (110 steps per ms) remains 6/23 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10404 ms. (384 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10262 ms. (389 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10685 ms. (374 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10615 ms. (376 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10374 ms. (385 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 9858 ms. (405 steps per ms) remains 5/5 properties
// Phase 1: matrix 384 rows 444 cols
[2024-06-01 11:58:00] [INFO ] Computed 136 invariants in 3 ms
[2024-06-01 11:58:00] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 37/47 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 397/444 variables, 130/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 397/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 384/828 variables, 444/1024 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 333/1357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/828 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/828 variables, and 1357 constraints, problems are : Problem set: 0 solved, 5 unsolved in 871 ms.
Refiners :[Domain max(s): 444/444 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 444/444 constraints, ReadFeed: 333/333 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/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 37/47 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 397/444 variables, 130/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 397/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 384/828 variables, 444/1024 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 333/1357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 5/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/828 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/828 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/828 variables, and 1362 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1294 ms.
Refiners :[Domain max(s): 444/444 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 444/444 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2191ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 95 steps, including 1 resets, run visited all 5 properties in 4 ms. (steps per millisecond=23 )
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 )
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 17 ms.
Able to resolve query QuasiLiveness after proving 328 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 181806 ms.
ITS solved all properties within timeout
BK_STOP 1717243082823
--------------------
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 QuasiLiveness -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="Parking-PT-832"
export BK_EXAMINATION="QuasiLiveness"
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 Parking-PT-832, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r514-smll-171654416600057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-832.tgz
mv Parking-PT-832 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;