About the Execution of ITS-Tools for Dekker-PT-050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
791.327 | 41124.00 | 109874.00 | 525.50 | TFTFFFFTTFTFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410000030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Dekker-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410000030
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 02:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 02:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 Dekker-PT-050-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678257606723
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-08 06:40:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 06:40:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:40:09] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2023-03-08 06:40:09] [INFO ] Transformed 250 places.
[2023-03-08 06:40:09] [INFO ] Transformed 2600 transitions.
[2023-03-08 06:40:09] [INFO ] Found NUPN structural information;
[2023-03-08 06:40:09] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-050-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 06:40:11] [INFO ] Flatten gal took : 703 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1121 ms. (steps per millisecond=8 ) properties (out of 8) seen :5
FORMULA Dekker-PT-050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 06:40:11] [INFO ] Flatten gal took : 302 ms
[2023-03-08 06:40:11] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-08 06:40:11] [INFO ] Computed 150 place invariants in 14 ms
[2023-03-08 06:40:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8175122632835293536.gal : 127 ms
[2023-03-08 06:40:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7121549213114194300.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8175122632835293536.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7121549213114194300.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2023-03-08 06:40:11] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 06:40:12] [INFO ] [Nat]Absence check using 100 positive place invariants in 32 ms returned sat
[2023-03-08 06:40:12] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 18 ms returned sat
[2023-03-08 06:40:12] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-08 06:40:12] [INFO ] State equation strengthened by 50 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality7121549213114194300.prop.
[2023-03-08 06:40:12] [INFO ] After 127ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :1 sat :2
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :16 after 128
[2023-03-08 06:40:13] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 6 ms to minimize.
Reachability property Dekker-PT-050-ReachabilityCardinality-10 is true.
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :128 after 8192
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :8192 after 524288
Reachability property Dekker-PT-050-ReachabilityCardinality-15 is true.
[2023-03-08 06:40:13] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2023-03-08 06:40:13] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2023-03-08 06:40:13] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 2 ms to minimize.
[2023-03-08 06:40:14] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2023-03-08 06:40:14] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2023-03-08 06:40:14] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2023-03-08 06:40:14] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2023-03-08 06:40:15] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2023-03-08 06:40:15] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2023-03-08 06:40:15] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2023-03-08 06:40:15] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2023-03-08 06:40:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3007 ms
[2023-03-08 06:40:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3008 ms
[2023-03-08 06:40:15] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2023-03-08 06:40:16] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2023-03-08 06:40:16] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2023-03-08 06:40:16] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-08 06:40:16] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-08 06:40:16] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-08 06:40:16] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-08 06:40:17] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-08 06:40:17] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2023-03-08 06:40:17] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2023-03-08 06:40:17] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-08 06:40:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1656 ms
[2023-03-08 06:40:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1657 ms
[2023-03-08 06:40:17] [INFO ] After 4879ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-08 06:40:17] [INFO ] After 5538ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA Dekker-PT-050-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 30 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 413 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 250/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 212313 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212313 steps, saw 175928 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:40:21] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:40:21] [INFO ] Invariant cache hit.
[2023-03-08 06:40:21] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:40:21] [INFO ] [Nat]Absence check using 100 positive place invariants in 27 ms returned sat
[2023-03-08 06:40:21] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 12 ms returned sat
[2023-03-08 06:40:22] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:40:22] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:40:22] [INFO ] After 127ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 06:40:22] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2023-03-08 06:40:22] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2023-03-08 06:40:22] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 2 ms to minimize.
[2023-03-08 06:40:23] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2023-03-08 06:40:23] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2023-03-08 06:40:23] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2023-03-08 06:40:23] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2023-03-08 06:40:23] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2023-03-08 06:40:24] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-08 06:40:24] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-08 06:40:24] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 9 ms to minimize.
[2023-03-08 06:40:24] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-08 06:40:24] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-08 06:40:24] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2023-03-08 06:40:24] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2023-03-08 06:40:24] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2023-03-08 06:40:25] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2023-03-08 06:40:25] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2023-03-08 06:40:25] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2023-03-08 06:40:25] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2023-03-08 06:40:25] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3151 ms
[2023-03-08 06:40:25] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3151 ms
[2023-03-08 06:40:25] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-08 06:40:25] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-08 06:40:25] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2023-03-08 06:40:26] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2023-03-08 06:40:26] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-08 06:40:26] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2023-03-08 06:40:26] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 3 ms to minimize.
[2023-03-08 06:40:26] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-08 06:40:26] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2023-03-08 06:40:26] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-08 06:40:26] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2023-03-08 06:40:27] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2023-03-08 06:40:27] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 16 ms to minimize.
[2023-03-08 06:40:27] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2023-03-08 06:40:27] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1700 ms
[2023-03-08 06:40:27] [INFO ] After 5074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-08 06:40:27] [INFO ] After 5580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 30 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 346 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 188 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:40:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:40:27] [INFO ] Invariant cache hit.
[2023-03-08 06:40:29] [INFO ] Implicit Places using invariants in 1972 ms returned [100, 103, 106, 109, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 205, 208, 211, 214, 217, 220, 223, 226, 235, 238]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 1983 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 115 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2289 ms. Remains : 208/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 222921 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222921 steps, saw 184457 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:40:33] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 208 cols
[2023-03-08 06:40:33] [INFO ] Computed 108 place invariants in 3 ms
[2023-03-08 06:40:33] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:40:33] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-08 06:40:33] [INFO ] [Nat]Absence check using 100 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-08 06:40:33] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:40:33] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:40:33] [INFO ] After 76ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 06:40:33] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2023-03-08 06:40:33] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2023-03-08 06:40:34] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2023-03-08 06:40:34] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2023-03-08 06:40:34] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 5 ms to minimize.
[2023-03-08 06:40:34] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2023-03-08 06:40:34] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2023-03-08 06:40:35] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-08 06:40:35] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 13 ms to minimize.
[2023-03-08 06:40:35] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-08 06:40:35] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-08 06:40:35] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1858 ms
[2023-03-08 06:40:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1859 ms
[2023-03-08 06:40:35] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2023-03-08 06:40:35] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2023-03-08 06:40:36] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-08 06:40:36] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-03-08 06:40:36] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-08 06:40:36] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-08 06:40:36] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-08 06:40:36] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2023-03-08 06:40:36] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2023-03-08 06:40:36] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2023-03-08 06:40:37] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 2 ms to minimize.
[2023-03-08 06:40:37] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2023-03-08 06:40:37] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2023-03-08 06:40:37] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2023-03-08 06:40:37] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-08 06:40:37] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1781 ms
[2023-03-08 06:40:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1782 ms
[2023-03-08 06:40:37] [INFO ] After 3784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-08 06:40:37] [INFO ] After 4179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 120 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 208/208 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 2600/2600 transitions.
Applied a total of 0 rules in 118 ms. Remains 208 /208 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:40:37] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:40:37] [INFO ] Invariant cache hit.
[2023-03-08 06:40:38] [INFO ] Implicit Places using invariants in 976 ms returned []
[2023-03-08 06:40:38] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:40:38] [INFO ] Invariant cache hit.
[2023-03-08 06:40:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:40:40] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
[2023-03-08 06:40:40] [INFO ] Redundant transitions in 533 ms returned []
[2023-03-08 06:40:40] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:40:40] [INFO ] Invariant cache hit.
[2023-03-08 06:40:43] [INFO ] Dead Transitions using invariants and state equation in 2464 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5398 ms. Remains : 208/208 places, 2600/2600 transitions.
Graph (complete) has 340 edges and 208 vertex of which 104 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.2 ms
Discarding 104 places :
Also discarding 1352 output transitions
Drop transitions removed 1352 transitions
Ensure Unique test removed 8 places
Ensure Unique test removed 1152 transitions
Reduce isomorphic transitions removed 1152 transitions.
Iterating post reduction 0 with 1160 rules applied. Total rules applied 1161 place count 96 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1173 place count 88 transition count 92
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1177 place count 88 transition count 88
Free-agglomeration rule applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 1190 place count 88 transition count 75
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1229 place count 62 transition count 62
Applied a total of 1229 rules in 195 ms. Remains 62 /208 variables (removed 146) and now considering 62/2600 (removed 2538) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 62 rows 62 cols
[2023-03-08 06:40:43] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-08 06:40:43] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:40:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-08 06:40:43] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:40:43] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 06:40:43] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-08 06:40:43] [INFO ] Flatten gal took : 6 ms
[2023-03-08 06:40:43] [INFO ] Flatten gal took : 5 ms
[2023-03-08 06:40:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14781833144365224169.gal : 1 ms
[2023-03-08 06:40:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2609029519379642756.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14781833144365224169.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2609029519379642756.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2609029519379642756.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 288
Invariant property Dekker-PT-050-ReachabilityCardinality-11 does not hold.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :288 after 110592
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :110592 after 2.38879e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.86654e+08,0.223879,4156,2,101,10,985,7,0,342,333,0
Total reachable state count : 286654464
Verifying 2 reachability properties.
Reachability property Dekker-PT-050-ReachabilityCardinality-02 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-02,1.5145e+06,0.229712,4156,2,306,10,1470,7,0,373,827,0
Invariant property Dekker-PT-050-ReachabilityCardinality-11 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-11,497664,0.231894,4156,2,89,10,1733,8,0,406,933,0
ITS tools runner thread asked to quit. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 06:40:44] [INFO ] Flatten gal took : 314 ms
[2023-03-08 06:40:44] [INFO ] Applying decomposition
[2023-03-08 06:40:44] [INFO ] Flatten gal took : 255 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7515189913058729299.txt' '-o' '/tmp/graph7515189913058729299.bin' '-w' '/tmp/graph7515189913058729299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7515189913058729299.bin' '-l' '-1' '-v' '-w' '/tmp/graph7515189913058729299.weights' '-q' '0' '-e' '0.001'
[2023-03-08 06:40:45] [INFO ] Decomposing Gal with order
[2023-03-08 06:40:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 06:40:45] [INFO ] Removed a total of 8180 redundant transitions.
[2023-03-08 06:40:45] [INFO ] Flatten gal took : 396 ms
[2023-03-08 06:40:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 82 ms.
[2023-03-08 06:40:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9929776659959891730.gal : 27 ms
[2023-03-08 06:40:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17478198972541255594.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9929776659959891730.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17478198972541255594.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17478198972541255594.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 1.1259e+15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1.1259e+15 after 1.1259e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.92734e+16,0.611631,12904,119,15,2024,1361,2916,1536,50,1876,0
Total reachable state count : 29273397577908224
Verifying 2 reachability properties.
Reachability property Dekker-PT-050-ReachabilityCardinality-02 is true.
FORMULA Dekker-PT-050-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-02,2.74878e+11,0.615339,12904,67,16,2024,1361,2946,1536,60,1876,395
Invariant property Dekker-PT-050-ReachabilityCardinality-11 does not hold.
FORMULA Dekker-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-11,1.1215e+14,0.618035,12904,110,16,2024,1361,2960,1536,61,1876,730
All properties solved without resorting to model-checking.
Total runtime 37035 ms.
BK_STOP 1678257647847
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="Dekker-PT-050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is Dekker-PT-050, 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 r133-smll-167819410000030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 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 ;