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.r233-tall-167856418400101.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 ltsminxred
Input is IBMB2S565S3960-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418400101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.3K Feb 26 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 05:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 127K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679449766461

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 01:49:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 01:49:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:49:28] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-22 01:49:28] [INFO ] Transformed 273 places.
[2023-03-22 01:49:28] [INFO ] Transformed 179 transitions.
[2023-03-22 01:49:28] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 179 rows 273 cols
[2023-03-22 01:49:28] [INFO ] Computed 101 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 40 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :38
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :16
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :17
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :16
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :14
[2023-03-22 01:49:28] [INFO ] Invariant cache hit.
[2023-03-22 01:49:28] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-22 01:49:28] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 26 ms returned sat
[2023-03-22 01:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:28] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-22 01:49:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:29] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 17 ms returned sat
[2023-03-22 01:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:29] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-22 01:49:29] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-22 01:49:29] [INFO ] Added : 39 causal constraints over 8 iterations in 184 ms. Result :sat
Minimization took 27 ms.
[2023-03-22 01:49:29] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-22 01:49:29] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 18 ms returned sat
[2023-03-22 01:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:29] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-22 01:49:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:29] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 17 ms returned sat
[2023-03-22 01:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:29] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 01:49:29] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-22 01:49:29] [INFO ] Added : 33 causal constraints over 7 iterations in 114 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 01:49:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:29] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-22 01:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:29] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-22 01:49:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:30] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-22 01:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:30] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 01:49:30] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-22 01:49:30] [INFO ] Added : 148 causal constraints over 30 iterations in 483 ms. Result :sat
Minimization took 91 ms.
[2023-03-22 01:49:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:30] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 32 ms returned sat
[2023-03-22 01:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:30] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-22 01:49:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:30] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2023-03-22 01:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:31] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-22 01:49:31] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-22 01:49:31] [INFO ] Added : 158 causal constraints over 32 iterations in 509 ms. Result :sat
Minimization took 85 ms.
[2023-03-22 01:49:31] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:31] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 19 ms returned sat
[2023-03-22 01:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:31] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-22 01:49:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:31] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-22 01:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:31] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-22 01:49:31] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 01:49:32] [INFO ] Added : 142 causal constraints over 29 iterations in 443 ms. Result :sat
Minimization took 84 ms.
[2023-03-22 01:49:32] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:32] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 19 ms returned sat
[2023-03-22 01:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:32] [INFO ] [Real]Absence check using state equation in 50 ms returned unsat
[2023-03-22 01:49:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:32] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-22 01:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:32] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-22 01:49:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:32] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2023-03-22 01:49:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:32] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 01:49:32] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-22 01:49:33] [INFO ] Added : 159 causal constraints over 32 iterations in 534 ms. Result :sat
Minimization took 77 ms.
[2023-03-22 01:49:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-22 01:49:33] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-22 01:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:33] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 01:49:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:33] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-22 01:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:33] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 01:49:33] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 01:49:34] [INFO ] Added : 142 causal constraints over 29 iterations in 428 ms. Result :sat
Minimization took 69 ms.
[2023-03-22 01:49:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:34] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-22 01:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:34] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-22 01:49:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:34] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-22 01:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:34] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 01:49:34] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-22 01:49:35] [INFO ] Added : 148 causal constraints over 30 iterations in 448 ms. Result :sat
Minimization took 82 ms.
[2023-03-22 01:49:35] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-22 01:49:35] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 17 ms returned sat
[2023-03-22 01:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:35] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 01:49:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:35] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-22 01:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:35] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 01:49:35] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 01:49:35] [INFO ] Added : 148 causal constraints over 30 iterations in 460 ms. Result :sat
Minimization took 68 ms.
[2023-03-22 01:49:36] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:36] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 22 ms returned sat
[2023-03-22 01:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:36] [INFO ] [Real]Absence check using state equation in 58 ms returned unsat
[2023-03-22 01:49:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:36] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-22 01:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:36] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-22 01:49:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:36] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-22 01:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:36] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 01:49:36] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-22 01:49:36] [INFO ] Added : 143 causal constraints over 29 iterations in 448 ms. Result :sat
Minimization took 69 ms.
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 01:49:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:37] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 01:49:37] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 01:49:37] [INFO ] Added : 33 causal constraints over 7 iterations in 104 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 18 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 21 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 01:49:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:37] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 01:49:37] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 01:49:37] [INFO ] Added : 37 causal constraints over 8 iterations in 117 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2023-03-22 01:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:38] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-22 01:49:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:38] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-22 01:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:38] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 01:49:38] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 01:49:38] [INFO ] Added : 145 causal constraints over 29 iterations in 416 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100, 250, 100, 7, 250, 300, 300, 100, 1, 2100, 100, 2, 100, 900] Max seen :[5, 6, 4, 1, 4, 7, 1, 1, 1, 1, 1, 1, 6, 2, 5, 1]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 13 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 179/179 transitions.
Graph (complete) has 415 edges and 273 vertex of which 215 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.2 ms
Discarding 58 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Ensure Unique test removed 76 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 102 edges and 139 vertex of which 20 / 139 are part of one of the 1 SCC in 2 ms
Free SCC test removed 19 places
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 120 transition count 89
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 75 rules applied. Total rules applied 211 place count 71 transition count 63
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 9 rules applied. Total rules applied 220 place count 69 transition count 56
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 227 place count 62 transition count 56
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 227 place count 62 transition count 40
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 260 place count 45 transition count 40
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 266 place count 39 transition count 34
Iterating global reduction 4 with 6 rules applied. Total rules applied 272 place count 39 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 39 transition count 33
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 283 place count 33 transition count 29
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 284 place count 32 transition count 28
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 32 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 287 place count 31 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 288 place count 31 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 289 place count 30 transition count 26
Applied a total of 289 rules in 37 ms. Remains 30 /273 variables (removed 243) and now considering 26/179 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 30/273 places, 26/179 transitions.
// Phase 1: matrix 26 rows 30 cols
[2023-03-22 01:49:39] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000004 steps, including 12310 resets, run finished after 232 ms. (steps per millisecond=4310 ) properties (out of 13) seen :56
Incomplete Best-First random walk after 1000001 steps, including 3397 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 13) seen :40
Incomplete Best-First random walk after 1000000 steps, including 4032 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 13) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3030 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 13) seen :45
Incomplete Best-First random walk after 1000001 steps, including 2377 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 13) seen :59
Incomplete Best-First random walk after 1000001 steps, including 2081 resets, run finished after 309 ms. (steps per millisecond=3236 ) properties (out of 13) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2492 resets, run finished after 342 ms. (steps per millisecond=2923 ) properties (out of 13) seen :56
Incomplete Best-First random walk after 1000001 steps, including 2494 resets, run finished after 341 ms. (steps per millisecond=2932 ) properties (out of 13) seen :56
Incomplete Best-First random walk after 1000001 steps, including 2438 resets, run finished after 333 ms. (steps per millisecond=3003 ) properties (out of 13) seen :59
Incomplete Best-First random walk after 1000000 steps, including 2440 resets, run finished after 332 ms. (steps per millisecond=3012 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 1000001 steps, including 2492 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 13) seen :57
Incomplete Best-First random walk after 1000000 steps, including 4026 resets, run finished after 324 ms. (steps per millisecond=3086 ) properties (out of 13) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3770 resets, run finished after 323 ms. (steps per millisecond=3095 ) properties (out of 13) seen :34
Incomplete Best-First random walk after 1000001 steps, including 2444 resets, run finished after 340 ms. (steps per millisecond=2941 ) properties (out of 13) seen :59
[2023-03-22 01:49:44] [INFO ] Invariant cache hit.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 01:49:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 01:49:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 01:49:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 01:49:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 01:49:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 01:49:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 01:49:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 7, 7, 3, 7, 3, 3, 3, 3, 3, 7, 7, 3] Max seen :[7, 7, 7, 3, 7, 3, 3, 3, 3, 3, 7, 7, 3]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16751 ms.
ITS solved all properties within timeout

BK_STOP 1679449785864

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is IBMB2S565S3960-PT-none, 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 r233-tall-167856418400101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;