About the Execution of ITS-Tools for QuasiCertifProtocol-COL-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
222.647 | 15774.00 | 23556.00 | 198.80 | 7 49 1 49 7 1 7 1 7 49 1 7 7 7 3 7 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017400909.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400909
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 7.2K Apr 30 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 61K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652981124022
Running Version 202205111006
[2022-05-19 17:25:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 17:25:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:25:25] [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.
[2022-05-19 17:25:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 17:25:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 667 ms
[2022-05-19 17:25:25] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2022-05-19 17:25:25] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2022-05-19 17:25:25] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 17:25:26] [INFO ] Computed 5 place invariants in 6 ms
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 17:25:26] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-19 17:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-19 17:25:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-19 17:25:26] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 17:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-19 17:25:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:26] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-19 17:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 17:25:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 17:25:26] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 17:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 17:25:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:26] [INFO ] Added : 10 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 17:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 17:25:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:26] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 17:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-19 17:25:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:26] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 17:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-19 17:25:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 17:25:26] [INFO ] Added : 13 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 17:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 17:25:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:26] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 17:25:26] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:26] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 17:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 17:25:27] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:27] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 17:25:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 17:25:27] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:27] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 17:25:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-19 17:25:27] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:27] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 17:25:27] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:27] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2022-05-19 17:25:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 17:25:27] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 17:25:27] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 17:25:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 17:25:27] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:27] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 17:25:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 17:25:27] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 17:25:27] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [7, -1, 1, -1, -1, 1, 7, 1, -1, 49, 7, 7, 3, -1]
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2022-05-19 17:25:27] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 13 ms.
[2022-05-19 17:25:27] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 984 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :24
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 187 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :19
Incomplete Best-First random walk after 10000 steps, including 177 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10000 steps, including 151 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :21
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :13
// Phase 1: matrix 116 rows 270 cols
[2022-05-19 17:25:27] [INFO ] Computed 155 place invariants in 16 ms
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 16 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:27] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-19 17:25:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 16 ms returned sat
[2022-05-19 17:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:28] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-19 17:25:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-19 17:25:28] [INFO ] Added : 17 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 25 ms.
[2022-05-19 17:25:28] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 17:25:28] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 17 ms returned sat
[2022-05-19 17:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:28] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-19 17:25:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 17:25:28] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 26 ms returned sat
[2022-05-19 17:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:28] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-19 17:25:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-19 17:25:28] [INFO ] Added : 46 causal constraints over 10 iterations in 123 ms. Result :sat
Minimization took 60 ms.
[2022-05-19 17:25:28] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-19 17:25:28] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 17 ms returned sat
[2022-05-19 17:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:28] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-19 17:25:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-19 17:25:28] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 16 ms returned sat
[2022-05-19 17:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:28] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-19 17:25:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 17:25:28] [INFO ] Added : 42 causal constraints over 9 iterations in 106 ms. Result :sat
Minimization took 61 ms.
[2022-05-19 17:25:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 16 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:29] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
[2022-05-19 17:25:29] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 19 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:29] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-19 17:25:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 15 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:29] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-19 17:25:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 17:25:29] [INFO ] Added : 8 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 17 ms.
[2022-05-19 17:25:29] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 19 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:29] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-19 17:25:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-19 17:25:29] [INFO ] Added : 61 causal constraints over 13 iterations in 201 ms. Result :sat
Minimization took 39 ms.
[2022-05-19 17:25:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 25 ms returned sat
[2022-05-19 17:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:29] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-19 17:25:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-19 17:25:30] [INFO ] Added : 61 causal constraints over 13 iterations in 161 ms. Result :sat
Minimization took 40 ms.
[2022-05-19 17:25:30] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 17:25:30] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 16 ms returned sat
[2022-05-19 17:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:30] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
[2022-05-19 17:25:30] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-19 17:25:30] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 19 ms returned sat
[2022-05-19 17:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:30] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2022-05-19 17:25:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 17:25:30] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 18 ms returned sat
[2022-05-19 17:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:30] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-19 17:25:30] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-19 17:25:30] [INFO ] Added : 51 causal constraints over 11 iterations in 139 ms. Result :sat
Minimization took 60 ms.
[2022-05-19 17:25:30] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-05-19 17:25:30] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 16 ms returned sat
[2022-05-19 17:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:30] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-19 17:25:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 17:25:31] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 18 ms returned sat
[2022-05-19 17:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:31] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-19 17:25:31] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-19 17:25:31] [INFO ] Added : 25 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 29 ms.
[2022-05-19 17:25:31] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 17:25:31] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 23 ms returned sat
[2022-05-19 17:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:31] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-19 17:25:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:25:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 17:25:31] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 17 ms returned sat
[2022-05-19 17:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:31] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-19 17:25:31] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-19 17:25:31] [INFO ] Added : 10 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [7, 2147483647, 2147483647, 7, 1, 7, 7, 49, 7, 2147483647] Max seen :[0, 0, 0, 7, 0, 0, 7, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-09 49 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 105 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 180 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 166 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 165 transition count 46
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 56 place count 165 transition count 31
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 43 rules applied. Total rules applied 99 place count 137 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 99 place count 137 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 135 transition count 30
Applied a total of 102 rules in 21 ms. Remains 135 /270 variables (removed 135) and now considering 30/116 (removed 86) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/270 places, 30/116 transitions.
// Phase 1: matrix 30 rows 135 cols
[2022-05-19 17:25:31] [INFO ] Computed 105 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 32258 resets, run finished after 2970 ms. (steps per millisecond=336 ) properties (out of 3) seen :105
Incomplete Best-First random walk after 1000000 steps, including 7194 resets, run finished after 1805 ms. (steps per millisecond=554 ) properties (out of 3) seen :105
Incomplete Best-First random walk after 1000000 steps, including 7194 resets, run finished after 1845 ms. (steps per millisecond=542 ) properties (out of 3) seen :105
Incomplete Best-First random walk after 1000000 steps, including 7194 resets, run finished after 1207 ms. (steps per millisecond=828 ) properties (out of 3) seen :105
// Phase 1: matrix 30 rows 135 cols
[2022-05-19 17:25:39] [INFO ] Computed 105 place invariants in 6 ms
[2022-05-19 17:25:39] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 14 ms returned sat
[2022-05-19 17:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:39] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2022-05-19 17:25:39] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 14 ms returned sat
[2022-05-19 17:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:39] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2022-05-19 17:25:39] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 14 ms returned sat
[2022-05-19 17:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:25:39] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
Current structural bounds on expressions (after SMT) : [49, 49, 7] Max seen :[49, 49, 7]
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-03 49 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-01 49 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14593 ms.
BK_STOP 1652981139796
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="UpperBounds"
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-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017400909"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;