About the Execution of LTSMin+red for CANInsertWithFailure-PT-060
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7925.163 | 329781.00 | 407317.00 | 858.10 | ???FT?TT?TF????? | 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.r476-tall-171620505200142.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 CANInsertWithFailure-PT-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200142
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 22M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-02
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-08
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-11
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-13
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717192455285
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-060
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:54:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:54:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:54:17] [INFO ] Load time of PNML (sax parser for PT used): 596 ms
[2024-05-31 21:54:17] [INFO ] Transformed 7924 places.
[2024-05-31 21:54:17] [INFO ] Transformed 21960 transitions.
[2024-05-31 21:54:17] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 777 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (25 resets) in 2721 ms. (14 steps per ms) remains 11/16 properties
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 852 ms. (46 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
// Phase 1: matrix 21960 rows 7924 cols
[2024-05-31 21:54:21] [INFO ] Computed 63 invariants in 2418 ms
[2024-05-31 21:54:21] [INFO ] State equation strengthened by 7140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 7519/7851 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7851 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/7919 variables, 34/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7919 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/7921 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7921 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 7862ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 332 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.38 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 368 transitions
Trivial Post-agglo rules discarded 368 transitions
Performed 368 trivial Post agglomeration. Transition count delta: 368
Iterating post reduction 0 with 368 rules applied. Total rules applied 369 place count 7923 transition count 21592
Reduce places removed 368 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 382 rules applied. Total rules applied 751 place count 7555 transition count 21578
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 765 place count 7541 transition count 21578
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 765 place count 7541 transition count 21572
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 777 place count 7535 transition count 21572
Performed 3109 Post agglomeration using F-continuation condition.Transition count delta: 3109
Deduced a syphon composed of 3109 places in 9 ms
Reduce places removed 3109 places and 0 transitions.
Iterating global reduction 3 with 6218 rules applied. Total rules applied 6995 place count 4426 transition count 18463
Drop transitions (Redundant composition of simpler transitions.) removed 3010 transitions
Redundant transition composition rules discarded 3010 transitions
Iterating global reduction 3 with 3010 rules applied. Total rules applied 10005 place count 4426 transition count 15453
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 10015 place count 4426 transition count 15443
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 10025 place count 4416 transition count 15443
Partial Free-agglomeration rule applied 4062 times.
Drop transitions (Partial Free agglomeration) removed 4062 transitions
Iterating global reduction 4 with 4062 rules applied. Total rules applied 14087 place count 4416 transition count 15443
Partial Free-agglomeration rule applied 622 times.
Drop transitions (Partial Free agglomeration) removed 622 transitions
Iterating global reduction 4 with 622 rules applied. Total rules applied 14709 place count 4416 transition count 15443
Applied a total of 14709 rules in 7094 ms. Remains 4416 /7924 variables (removed 3508) and now considering 15443/21960 (removed 6517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7106 ms. Remains : 4416/7924 places, 15443/21960 transitions.
RANDOM walk for 40000 steps (111 resets) in 1220 ms. (32 steps per ms) remains 10/11 properties
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 57843 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 10
Probabilistic random walk after 57843 steps, saw 42223 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 15443 rows 4416 cols
[2024-05-31 21:54:38] [INFO ] Computed 62 invariants in 678 ms
[2024-05-31 21:54:38] [INFO ] State equation strengthened by 13078 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4034/4336 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4336 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 76/4412 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4412 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/4414 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4414 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 15443/19857 variables, 4414/4476 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19857 variables, 13078/17554 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19857 variables, 0/17554 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/19859 variables, 2/17556 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19859 variables, 0/17556 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 19859/19859 variables, and 17556 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45054 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4416/4416 constraints, ReadFeed: 13078/13078 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4034/4336 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 21:55:25] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/4336 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4336 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 76/4412 variables, 38/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4412 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/4414 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 21:55:33] [INFO ] Deduced a trap composed of 81 places in 5139 ms of which 36 ms to minimize.
[2024-05-31 21:55:38] [INFO ] Deduced a trap composed of 81 places in 4822 ms of which 25 ms to minimize.
[2024-05-31 21:55:43] [INFO ] Deduced a trap composed of 73 places in 4931 ms of which 25 ms to minimize.
[2024-05-31 21:55:48] [INFO ] Deduced a trap composed of 75 places in 4997 ms of which 29 ms to minimize.
[2024-05-31 21:55:53] [INFO ] Deduced a trap composed of 74 places in 4632 ms of which 28 ms to minimize.
[2024-05-31 21:55:58] [INFO ] Deduced a trap composed of 76 places in 4621 ms of which 24 ms to minimize.
[2024-05-31 21:56:02] [INFO ] Deduced a trap composed of 78 places in 4662 ms of which 23 ms to minimize.
[2024-05-31 21:56:07] [INFO ] Deduced a trap composed of 79 places in 4676 ms of which 23 ms to minimize.
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 77 places in 4227 ms of which 23 ms to minimize.
SMT process timed out in 93834ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 302 out of 4416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4416/4416 places, 15443/15443 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 4399 transition count 15426
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 49 place count 4399 transition count 15426
Applied a total of 49 rules in 1884 ms. Remains 4399 /4416 variables (removed 17) and now considering 15426/15443 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1885 ms. Remains : 4399/4416 places, 15426/15443 transitions.
RANDOM walk for 40000 steps (112 resets) in 1120 ms. (35 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 58419 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 10
Probabilistic random walk after 58419 steps, saw 41692 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 15426 rows 4399 cols
[2024-05-31 21:56:18] [INFO ] Computed 62 invariants in 817 ms
[2024-05-31 21:56:18] [INFO ] State equation strengthened by 13302 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4017/4319 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4319 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 76/4395 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4395 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/4397 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4397 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 15426/19823 variables, 4397/4459 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19823 variables, 13302/17761 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19823 variables, 0/17761 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/19825 variables, 2/17763 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19825 variables, 0/17763 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/19825 variables, 0/17763 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19825/19825 variables, and 17763 constraints, problems are : Problem set: 0 solved, 10 unsolved in 54882 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4399/4399 constraints, ReadFeed: 13302/13302 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4017/4319 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 21:57:14] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 2 ms to minimize.
[2024-05-31 21:57:14] [INFO ] Deduced a trap composed of 2 places in 201 ms of which 2 ms to minimize.
[2024-05-31 21:57:14] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2024-05-31 21:57:15] [INFO ] Deduced a trap composed of 2 places in 205 ms of which 2 ms to minimize.
[2024-05-31 21:57:15] [INFO ] Deduced a trap composed of 2 places in 201 ms of which 2 ms to minimize.
[2024-05-31 21:57:15] [INFO ] Deduced a trap composed of 2 places in 193 ms of which 2 ms to minimize.
[2024-05-31 21:57:15] [INFO ] Deduced a trap composed of 2 places in 193 ms of which 2 ms to minimize.
[2024-05-31 21:57:16] [INFO ] Deduced a trap composed of 2 places in 239 ms of which 3 ms to minimize.
[2024-05-31 21:57:16] [INFO ] Deduced a trap composed of 2 places in 210 ms of which 3 ms to minimize.
[2024-05-31 21:57:16] [INFO ] Deduced a trap composed of 2 places in 222 ms of which 2 ms to minimize.
[2024-05-31 21:57:17] [INFO ] Deduced a trap composed of 2 places in 203 ms of which 2 ms to minimize.
[2024-05-31 21:57:17] [INFO ] Deduced a trap composed of 2 places in 199 ms of which 2 ms to minimize.
[2024-05-31 21:57:17] [INFO ] Deduced a trap composed of 2 places in 203 ms of which 3 ms to minimize.
[2024-05-31 21:57:17] [INFO ] Deduced a trap composed of 2 places in 220 ms of which 3 ms to minimize.
[2024-05-31 21:57:18] [INFO ] Deduced a trap composed of 2 places in 210 ms of which 2 ms to minimize.
[2024-05-31 21:57:18] [INFO ] Deduced a trap composed of 2 places in 208 ms of which 2 ms to minimize.
[2024-05-31 21:57:18] [INFO ] Deduced a trap composed of 2 places in 207 ms of which 3 ms to minimize.
[2024-05-31 21:57:18] [INFO ] Deduced a trap composed of 2 places in 209 ms of which 2 ms to minimize.
[2024-05-31 21:57:19] [INFO ] Deduced a trap composed of 2 places in 217 ms of which 2 ms to minimize.
[2024-05-31 21:57:19] [INFO ] Deduced a trap composed of 2 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/4319 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4319 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 76/4395 variables, 38/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4395 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/4397 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 21:57:26] [INFO ] Deduced a trap composed of 86 places in 4951 ms of which 25 ms to minimize.
[2024-05-31 21:57:31] [INFO ] Deduced a trap composed of 80 places in 4724 ms of which 25 ms to minimize.
[2024-05-31 21:57:36] [INFO ] Deduced a trap composed of 80 places in 4803 ms of which 24 ms to minimize.
[2024-05-31 21:57:41] [INFO ] Deduced a trap composed of 86 places in 4871 ms of which 29 ms to minimize.
[2024-05-31 21:57:46] [INFO ] Deduced a trap composed of 77 places in 4854 ms of which 30 ms to minimize.
[2024-05-31 21:57:51] [INFO ] Deduced a trap composed of 83 places in 4761 ms of which 26 ms to minimize.
[2024-05-31 21:57:55] [INFO ] Deduced a trap composed of 88 places in 4728 ms of which 25 ms to minimize.
[2024-05-31 21:58:00] [INFO ] Deduced a trap composed of 87 places in 4876 ms of which 26 ms to minimize.
[2024-05-31 21:58:05] [INFO ] Deduced a trap composed of 95 places in 4848 ms of which 24 ms to minimize.
[2024-05-31 21:58:10] [INFO ] Deduced a trap composed of 75 places in 4651 ms of which 26 ms to minimize.
[2024-05-31 21:58:15] [INFO ] Deduced a trap composed of 83 places in 4676 ms of which 24 ms to minimize.
[2024-05-31 21:58:19] [INFO ] Deduced a trap composed of 87 places in 4573 ms of which 25 ms to minimize.
[2024-05-31 21:58:24] [INFO ] Deduced a trap composed of 94 places in 4600 ms of which 25 ms to minimize.
[2024-05-31 21:58:29] [INFO ] Deduced a trap composed of 95 places in 4615 ms of which 25 ms to minimize.
SMT process timed out in 131824ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 302 out of 4399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4399/4399 places, 15426/15426 transitions.
Applied a total of 0 rules in 710 ms. Remains 4399 /4399 variables (removed 0) and now considering 15426/15426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 4399/4399 places, 15426/15426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4399/4399 places, 15426/15426 transitions.
Applied a total of 0 rules in 717 ms. Remains 4399 /4399 variables (removed 0) and now considering 15426/15426 (removed 0) transitions.
[2024-05-31 21:58:30] [INFO ] Invariant cache hit.
[2024-05-31 21:58:37] [INFO ] Implicit Places using invariants in 7077 ms returned []
Implicit Place search using SMT only with invariants took 7085 ms to find 0 implicit places.
Running 15366 sub problems to find dead transitions.
[2024-05-31 21:58:38] [INFO ] Invariant cache hit.
[2024-05-31 21:58:38] [INFO ] State equation strengthened by 13302 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4398 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 15366 unsolved
SMT process timed out in 61834ms, After SMT, problems are : Problem set: 0 solved, 15366 unsolved
Search for dead transitions found 0 dead transitions in 62061ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69959 ms. Remains : 4399/4399 places, 15426/15426 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 12453 edges and 4399 vertex of which 2783 / 4399 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2781 places
Drop transitions (Empty/Sink Transition effects.) removed 7184 transitions
Ensure Unique test removed 3216 transitions
Reduce isomorphic transitions removed 10400 transitions.
Graph (complete) has 5489 edges and 1618 vertex of which 1460 are kept as prefixes of interest. Removing 158 places using SCC suffix rule.1 ms
Discarding 158 places :
Also discarding 44 output transitions
Drop transitions (Output transitions of discarded places.) removed 44 transitions
Drop transitions (Empty/Sink Transition effects.) removed 807 transitions
Reduce isomorphic transitions removed 807 transitions.
Iterating post reduction 0 with 807 rules applied. Total rules applied 809 place count 1460 transition count 4175
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 809 place count 1460 transition count 4167
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 825 place count 1452 transition count 4167
Discarding 643 places :
Symmetric choice reduction at 1 with 643 rule applications. Total rules 1468 place count 809 transition count 2797
Iterating global reduction 1 with 643 rules applied. Total rules applied 2111 place count 809 transition count 2797
Ensure Unique test removed 472 transitions
Reduce isomorphic transitions removed 472 transitions.
Iterating post reduction 1 with 472 rules applied. Total rules applied 2583 place count 809 transition count 2325
Discarding 118 places :
Symmetric choice reduction at 2 with 118 rule applications. Total rules 2701 place count 691 transition count 2089
Iterating global reduction 2 with 118 rules applied. Total rules applied 2819 place count 691 transition count 2089
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 2 with 118 rules applied. Total rules applied 2937 place count 691 transition count 1971
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2939 place count 690 transition count 1970
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2940 place count 690 transition count 1969
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 4 with 60 rules applied. Total rules applied 3000 place count 690 transition count 1909
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 15 rules applied. Total rules applied 3015 place count 690 transition count 1894
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 16 rules applied. Total rules applied 3031 place count 675 transition count 1893
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3032 place count 674 transition count 1893
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3034 place count 673 transition count 1892
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 3037 place count 673 transition count 1889
Free-agglomeration rule applied 247 times with reduction of 15 identical transitions.
Iterating global reduction 7 with 247 rules applied. Total rules applied 3284 place count 673 transition count 1627
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Iterating post reduction 7 with 483 rules applied. Total rules applied 3767 place count 426 transition count 1391
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 3789 place count 426 transition count 1369
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 3800 place count 426 transition count 1369
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 3832 place count 415 transition count 1348
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3833 place count 415 transition count 1347
Partial Free-agglomeration rule applied 164 times.
Drop transitions (Partial Free agglomeration) removed 164 transitions
Iterating global reduction 9 with 164 rules applied. Total rules applied 3997 place count 415 transition count 1347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3999 place count 415 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 4000 place count 414 transition count 1343
Iterating global reduction 10 with 1 rules applied. Total rules applied 4001 place count 414 transition count 1343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4002 place count 414 transition count 1342
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 4004 place count 414 transition count 1342
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 11 with 5 rules applied. Total rules applied 4009 place count 409 transition count 1337
Applied a total of 4009 rules in 1143 ms. Remains 409 /4399 variables (removed 3990) and now considering 1337/15426 (removed 14089) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 1337 rows 409 cols
[2024-05-31 21:59:41] [INFO ] Computed 13 invariants in 6 ms
[2024-05-31 21:59:41] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-31 21:59:41] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-31 21:59:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-31 21:59:42] [INFO ] After 845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-31 21:59:43] [INFO ] After 1666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-31 21:59:43] [INFO ] After 2445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 3825 ms.
[2024-05-31 21:59:43] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 21:59:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4399 places, 15426 transitions and 59151 arcs took 63 ms.
[2024-05-31 21:59:44] [INFO ] Flatten gal took : 550 ms
Total runtime 328146 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-00
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-02
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-08
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-11
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-12
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-14
Could not compute solution for formula : CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-15
BK_STOP 1717192785066
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/692/inv_0_
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/692/inv_1_
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-02
rfs formula type AG
rfs formula formula --invariant=/tmp/692/inv_2_
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/692/inv_3_
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-08
rfs formula type AG
rfs formula formula --invariant=/tmp/692/inv_4_
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-11
rfs formula type AG
rfs formula formula --invariant=/tmp/692/inv_5_
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/692/inv_6_
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-13
rfs formula type AG
rfs formula formula --invariant=/tmp/692/inv_7_
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/692/inv_8_
rfs formula name CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/692/inv_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-060"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-060, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505200142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-060.tgz
mv CANInsertWithFailure-PT-060 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;