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.r520-tall-171662337600009.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 QuasiCertifProtocol-COL-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337600009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 13 03:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 61K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717217915159

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:58:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:58:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:58:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 04:58:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:58:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 625 ms
[2024-06-01 04:58:37] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2024-06-01 04:58:37] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 04:58:37] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 4 formulas.
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40002 steps (3025 resets) in 1716 ms. (23 steps per ms) remains 50/71 properties
BEST_FIRST walk for 4003 steps (136 resets) in 77 ms. (51 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (135 resets) in 51 ms. (76 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (136 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (137 resets) in 46 ms. (85 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (145 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (139 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (87 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (136 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (138 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (138 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (164 resets) in 32 ms. (121 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (150 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (135 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (137 resets) in 62 ms. (63 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (134 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (136 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (138 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (76 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (131 resets) in 34 ms. (114 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4005 steps (136 resets) in 21 ms. (182 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (143 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (134 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (108 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (149 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (130 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (139 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (136 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (134 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (193 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (135 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (107 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (135 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (191 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (96 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (135 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (134 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (192 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4005 steps (190 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (139 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (137 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (134 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (133 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (190 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (140 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4005 steps (135 resets) in 35 ms. (111 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (193 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (115 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (140 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (133 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (131 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 04:58:38] [INFO ] Computed 5 invariants in 7 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 20 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 30 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/5 constraints. Problems are: Problem set: 40 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 40 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 45 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 45 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 45 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 45 solved, 5 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 5/5 constraints. Problems are: Problem set: 45 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 45 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 26/49 variables, 23/28 constraints. Problems are: Problem set: 45 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/29 constraints. Problems are: Problem set: 45 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/29 constraints. Problems are: Problem set: 45 solved, 5 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 6 (OVERLAPS) 7/56 variables, 7/36 constraints. Problems are: Problem set: 46 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 3/39 constraints. Problems are: Problem set: 46 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 46 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 46 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 39 constraints, problems are : Problem set: 46 solved, 4 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 574ms problems are : Problem set: 46 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 3970 steps, including 107 resets, run visited all 1 properties in 7 ms. (steps per millisecond=567 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 20 ms.
Successfully simplified 46 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:58:38] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 04:58:38] [INFO ] Flatten gal took : 18 ms
[2024-06-01 04:58:38] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:58:38] [INFO ] Flatten gal took : 5 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2024-06-01 04:58:38] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 12 ms.
[2024-06-01 04:58:38] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Support contains 263 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 270 /270 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 270 cols
[2024-06-01 04:58:38] [INFO ] Computed 155 invariants in 19 ms
[2024-06-01 04:58:39] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 04:58:39] [INFO ] Invariant cache hit.
[2024-06-01 04:58:39] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 04:58:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 19/270 variables, 11/113 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 42/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 116/386 variables, 270/425 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 425 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4372 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 19/270 variables, 11/113 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 42/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 116/386 variables, 270/425 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 108/533 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 533 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5379 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 9882ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 9889ms
Finished structural reductions in LTL mode , in 1 iterations and 10185 ms. Remains : 270/270 places, 116/116 transitions.
Support contains 263 out of 270 places after structural reductions.
[2024-06-01 04:58:49] [INFO ] Flatten gal took : 55 ms
[2024-06-01 04:58:49] [INFO ] Flatten gal took : 35 ms
[2024-06-01 04:58:49] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (3933 resets) in 1691 ms. (23 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4004 steps (72 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (69 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (69 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (69 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (56 resets) in 23 ms. (166 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4004 steps (65 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (88 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (88 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (39 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (68 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (67 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (88 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (70 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (62 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (88 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (68 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
[2024-06-01 04:58:50] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 9/9 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 54/63 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/63 constraints. Problems are: Problem set: 7 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/263 variables, 2/65 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 84/149 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/149 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/270 variables, 6/155 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/155 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 116/386 variables, 270/425 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/425 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/425 constraints. Problems are: Problem set: 10 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 425 constraints, problems are : Problem set: 10 solved, 6 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/235 variables, 11/11 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 126/137 constraints. Problems are: Problem set: 10 solved, 6 unsolved
[2024-06-01 04:58:50] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 26 ms to minimize.
[2024-06-01 04:58:50] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-06-01 04:58:50] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-06-01 04:58:51] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 5 ms to minimize.
[2024-06-01 04:58:51] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-06-01 04:58:51] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
[2024-06-01 04:58:51] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2024-06-01 04:58:51] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 8/145 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/145 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 7/242 variables, 6/151 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/151 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 116/358 variables, 242/393 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 4/397 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/397 constraints. Problems are: Problem set: 10 solved, 6 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 10 (OVERLAPS) 28/386 variables, 28/425 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 12/437 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 1/438 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/438 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/386 variables, 0/438 constraints. Problems are: Problem set: 11 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 438 constraints, problems are : Problem set: 11 solved, 5 unsolved in 2555 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 5/16 constraints, Known Traps: 8/8 constraints]
After SMT, in 2992ms problems are : Problem set: 11 solved, 5 unsolved
Finished Parikh walk after 44 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=7 )
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 9 ms.
Successfully simplified 11 atomic propositions for a total of 5 simplifications.
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 15 ms
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 25 ms
[2024-06-01 04:58:53] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 128 out of 270 places (down from 152) after GAL structural reductions.
Computed a total of 270 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 270 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 245 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 27 ms. Remains 244 /270 variables (removed 26) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 244/270 places, 113/116 transitions.
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 10 ms
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 11 ms
[2024-06-01 04:58:53] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 17 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 252/270 places, 116/116 transitions.
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 11 ms
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 11 ms
[2024-06-01 04:58:53] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 244 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 243 transition count 113
Applied a total of 2 rules in 19 ms. Remains 243 /270 variables (removed 27) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 243/270 places, 113/116 transitions.
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:53] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 4 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 252/270 places, 116/116 transitions.
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 10 ms
[2024-06-01 04:58:53] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 244 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 8 ms. Remains 243 /270 variables (removed 27) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 243/270 places, 113/116 transitions.
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 22 ms
[2024-06-01 04:58:53] [INFO ] Input system was already deterministic with 113 transitions.
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 10 ms
[2024-06-01 04:58:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:53] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 04:58:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 270 places, 116 transitions and 659 arcs took 3 ms.
Total runtime 17345 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLCardinality-2024-03
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLCardinality-2024-04
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLCardinality-2024-07
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLCardinality-2024-11
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLCardinality-2024-13

BK_STOP 1717217933898

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-COL-06-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/551/ctl_0_
ctl formula name QuasiCertifProtocol-COL-06-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/551/ctl_1_
ctl formula name QuasiCertifProtocol-COL-06-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/551/ctl_2_
ctl formula name QuasiCertifProtocol-COL-06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/551/ctl_3_
ctl formula name QuasiCertifProtocol-COL-06-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/551/ctl_4_
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="QuasiCertifProtocol-COL-06"
export BK_EXAMINATION="CTLCardinality"
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 QuasiCertifProtocol-COL-06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337600009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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