fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r519-tall-167987244700061
Last Updated
May 14, 2023

About the Execution of LoLa+red for Anderson-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
729.300 53691.00 76697.00 419.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r519-tall-167987244700061.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 lolaxred
Input is Anderson-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244700061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 31 16:48 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 Anderson-PT-11-UpperBounds-00
FORMULA_NAME Anderson-PT-11-UpperBounds-01
FORMULA_NAME Anderson-PT-11-UpperBounds-02
FORMULA_NAME Anderson-PT-11-UpperBounds-03
FORMULA_NAME Anderson-PT-11-UpperBounds-04
FORMULA_NAME Anderson-PT-11-UpperBounds-05
FORMULA_NAME Anderson-PT-11-UpperBounds-06
FORMULA_NAME Anderson-PT-11-UpperBounds-07
FORMULA_NAME Anderson-PT-11-UpperBounds-08
FORMULA_NAME Anderson-PT-11-UpperBounds-09
FORMULA_NAME Anderson-PT-11-UpperBounds-10
FORMULA_NAME Anderson-PT-11-UpperBounds-11
FORMULA_NAME Anderson-PT-11-UpperBounds-12
FORMULA_NAME Anderson-PT-11-UpperBounds-13
FORMULA_NAME Anderson-PT-11-UpperBounds-14
FORMULA_NAME Anderson-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680832777941

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 01:59:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 01:59:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:59:39] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-04-07 01:59:39] [INFO ] Transformed 749 places.
[2023-04-07 01:59:39] [INFO ] Transformed 3245 transitions.
[2023-04-07 01:59:39] [INFO ] Found NUPN structural information;
[2023-04-07 01:59:39] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3245 rows 749 cols
[2023-04-07 01:59:39] [INFO ] Computed 25 invariants in 109 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 16) seen :9
FORMULA Anderson-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :3
FORMULA Anderson-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
[2023-04-07 01:59:40] [INFO ] Invariant cache hit.
[2023-04-07 01:59:40] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-04-07 01:59:40] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 13 ms returned sat
[2023-04-07 01:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:59:41] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2023-04-07 01:59:41] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:59:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2023-04-07 01:59:41] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 10 ms returned sat
[2023-04-07 01:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:59:42] [INFO ] [Nat]Absence check using state equation in 975 ms returned sat
[2023-04-07 01:59:42] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 01:59:43] [INFO ] [Nat]Added 110 Read/Feed constraints in 635 ms returned sat
[2023-04-07 01:59:44] [INFO ] Computed and/alt/rep : 132/143/132 causal constraints (skipped 3102 transitions) in 405 ms.
[2023-04-07 01:59:44] [INFO ] Added : 2 causal constraints over 1 iterations in 744 ms. Result :sat
[2023-04-07 01:59:44] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-04-07 01:59:44] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 11 ms returned sat
[2023-04-07 01:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:59:45] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2023-04-07 01:59:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:59:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2023-04-07 01:59:45] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 9 ms returned sat
[2023-04-07 01:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:59:46] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2023-04-07 01:59:46] [INFO ] [Nat]Added 110 Read/Feed constraints in 573 ms returned sat
[2023-04-07 01:59:47] [INFO ] Computed and/alt/rep : 132/143/132 causal constraints (skipped 3102 transitions) in 652 ms.
[2023-04-07 01:59:48] [INFO ] Added : 2 causal constraints over 1 iterations in 1317 ms. Result :sat
[2023-04-07 01:59:48] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-04-07 01:59:48] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 10 ms returned sat
[2023-04-07 01:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:59:50] [INFO ] [Real]Absence check using state equation in 1891 ms returned sat
[2023-04-07 01:59:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:59:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-04-07 01:59:50] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 15 ms returned sat
[2023-04-07 01:59:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:59:51] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2023-04-07 01:59:51] [INFO ] [Nat]Added 110 Read/Feed constraints in 527 ms returned sat
[2023-04-07 01:59:52] [INFO ] Computed and/alt/rep : 132/143/132 causal constraints (skipped 3102 transitions) in 245 ms.
[2023-04-07 01:59:53] [INFO ] Deduced a trap composed of 325 places in 477 ms of which 3 ms to minimize.
[2023-04-07 01:59:53] [INFO ] Deduced a trap composed of 77 places in 487 ms of which 1 ms to minimize.
[2023-04-07 01:59:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1241 ms
[2023-04-07 01:59:53] [INFO ] Added : 2 causal constraints over 2 iterations in 1922 ms. Result :sat
[2023-04-07 01:59:54] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-04-07 01:59:54] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 11 ms returned sat
[2023-04-07 01:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:59:55] [INFO ] [Real]Absence check using state equation in 1351 ms returned sat
[2023-04-07 01:59:55] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:59:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-04-07 01:59:55] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 12 ms returned sat
[2023-04-07 01:59:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:59:56] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2023-04-07 01:59:57] [INFO ] [Nat]Added 110 Read/Feed constraints in 438 ms returned sat
[2023-04-07 01:59:57] [INFO ] Computed and/alt/rep : 132/143/132 causal constraints (skipped 3102 transitions) in 253 ms.
[2023-04-07 01:59:58] [INFO ] Deduced a trap composed of 196 places in 448 ms of which 2 ms to minimize.
[2023-04-07 01:59:58] [INFO ] Deduced a trap composed of 205 places in 453 ms of which 3 ms to minimize.
[2023-04-07 01:59:59] [INFO ] Deduced a trap composed of 94 places in 489 ms of which 0 ms to minimize.
[2023-04-07 01:59:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1756 ms
[2023-04-07 01:59:59] [INFO ] Added : 2 causal constraints over 2 iterations in 2431 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 106 Pre rules applied. Total rules applied 0 place count 749 transition count 3139
Deduced a syphon composed of 106 places in 5 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 0 with 212 rules applied. Total rules applied 212 place count 643 transition count 3139
Discarding 216 places :
Symmetric choice reduction at 0 with 216 rule applications. Total rules 428 place count 427 transition count 723
Iterating global reduction 0 with 216 rules applied. Total rules applied 644 place count 427 transition count 723
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 652 place count 423 transition count 719
Applied a total of 652 rules in 189 ms. Remains 423 /749 variables (removed 326) and now considering 719/3245 (removed 2526) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 423/749 places, 719/3245 transitions.
// Phase 1: matrix 719 rows 423 cols
[2023-04-07 01:59:59] [INFO ] Computed 25 invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2005 ms. (steps per millisecond=498 ) properties (out of 4) seen :2
FORMULA Anderson-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 2) seen :0
[2023-04-07 02:00:03] [INFO ] Invariant cache hit.
[2023-04-07 02:00:04] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 02:00:04] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 02:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:04] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-04-07 02:00:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:00:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 02:00:04] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 10 ms returned sat
[2023-04-07 02:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:04] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2023-04-07 02:00:04] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:04] [INFO ] [Nat]Added 110 Read/Feed constraints in 38 ms returned sat
[2023-04-07 02:00:04] [INFO ] Computed and/alt/rep : 26/37/26 causal constraints (skipped 682 transitions) in 40 ms.
[2023-04-07 02:00:04] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 0 ms to minimize.
[2023-04-07 02:00:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-04-07 02:00:04] [INFO ] Added : 3 causal constraints over 1 iterations in 414 ms. Result :sat
Minimization took 192 ms.
[2023-04-07 02:00:05] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 02:00:05] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 02:00:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:05] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-04-07 02:00:05] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:00:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 02:00:05] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 14 ms returned sat
[2023-04-07 02:00:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:05] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-04-07 02:00:06] [INFO ] [Nat]Added 110 Read/Feed constraints in 240 ms returned sat
[2023-04-07 02:00:06] [INFO ] Computed and/alt/rep : 26/37/26 causal constraints (skipped 682 transitions) in 40 ms.
[2023-04-07 02:00:06] [INFO ] Deduced a trap composed of 143 places in 151 ms of which 0 ms to minimize.
[2023-04-07 02:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-04-07 02:00:06] [INFO ] Added : 2 causal constraints over 2 iterations in 393 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 719/719 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 421 transition count 717
Applied a total of 4 rules in 55 ms. Remains 421 /423 variables (removed 2) and now considering 717/719 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 421/423 places, 717/719 transitions.
// Phase 1: matrix 717 rows 421 cols
[2023-04-07 02:00:06] [INFO ] Computed 25 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2018 ms. (steps per millisecond=495 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 2) seen :0
[2023-04-07 02:00:10] [INFO ] Invariant cache hit.
[2023-04-07 02:00:10] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 02:00:10] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 18 ms returned sat
[2023-04-07 02:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:11] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-04-07 02:00:11] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:00:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 02:00:11] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 10 ms returned sat
[2023-04-07 02:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:11] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-04-07 02:00:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:11] [INFO ] [Nat]Added 110 Read/Feed constraints in 90 ms returned sat
[2023-04-07 02:00:11] [INFO ] Computed and/alt/rep : 24/35/24 causal constraints (skipped 682 transitions) in 39 ms.
[2023-04-07 02:00:11] [INFO ] Added : 3 causal constraints over 1 iterations in 144 ms. Result :sat
Minimization took 129 ms.
[2023-04-07 02:00:11] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 02:00:11] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 02:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:11] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-04-07 02:00:11] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:00:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 02:00:12] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 9 ms returned sat
[2023-04-07 02:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:12] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-04-07 02:00:12] [INFO ] [Nat]Added 110 Read/Feed constraints in 38 ms returned sat
[2023-04-07 02:00:12] [INFO ] Computed and/alt/rep : 24/35/24 causal constraints (skipped 682 transitions) in 42 ms.
[2023-04-07 02:00:12] [INFO ] Added : 0 causal constraints over 0 iterations in 95 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 717/717 transitions.
Applied a total of 0 rules in 17 ms. Remains 421 /421 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 421/421 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 717/717 transitions.
Applied a total of 0 rules in 19 ms. Remains 421 /421 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2023-04-07 02:00:12] [INFO ] Invariant cache hit.
[2023-04-07 02:00:13] [INFO ] Implicit Places using invariants in 501 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 509 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 420/421 places, 717/717 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 420 transition count 596
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 299 transition count 596
Applied a total of 242 rules in 34 ms. Remains 299 /420 variables (removed 121) and now considering 596/717 (removed 121) transitions.
// Phase 1: matrix 596 rows 299 cols
[2023-04-07 02:00:13] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 02:00:13] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-04-07 02:00:13] [INFO ] Invariant cache hit.
[2023-04-07 02:00:13] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:14] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 299/421 places, 596/717 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1725 ms. Remains : 299/421 places, 596/717 transitions.
[2023-04-07 02:00:14] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1308 ms. (steps per millisecond=764 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 634 ms. (steps per millisecond=1577 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 2) seen :1
FORMULA Anderson-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-04-07 02:00:16] [INFO ] Invariant cache hit.
[2023-04-07 02:00:16] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 02:00:16] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 7 ms returned sat
[2023-04-07 02:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:17] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-04-07 02:00:17] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:00:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 02:00:17] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 12 ms returned sat
[2023-04-07 02:00:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:17] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-04-07 02:00:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:17] [INFO ] [Nat]Added 110 Read/Feed constraints in 46 ms returned sat
[2023-04-07 02:00:17] [INFO ] Computed and/alt/rep : 24/35/24 causal constraints (skipped 561 transitions) in 29 ms.
[2023-04-07 02:00:17] [INFO ] Added : 0 causal constraints over 0 iterations in 65 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 596/596 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 298 transition count 595
Applied a total of 2 rules in 26 ms. Remains 298 /299 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 298/299 places, 595/596 transitions.
// Phase 1: matrix 595 rows 298 cols
[2023-04-07 02:00:17] [INFO ] Computed 24 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1254 ms. (steps per millisecond=797 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 1) seen :0
[2023-04-07 02:00:19] [INFO ] Invariant cache hit.
[2023-04-07 02:00:19] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 02:00:19] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 02:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:19] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-04-07 02:00:19] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:00:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 02:00:19] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 10 ms returned sat
[2023-04-07 02:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:19] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-04-07 02:00:19] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:19] [INFO ] [Nat]Added 110 Read/Feed constraints in 67 ms returned sat
[2023-04-07 02:00:19] [INFO ] Computed and/alt/rep : 23/34/23 causal constraints (skipped 561 transitions) in 30 ms.
[2023-04-07 02:00:20] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 1 ms to minimize.
[2023-04-07 02:00:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-04-07 02:00:20] [INFO ] Added : 2 causal constraints over 2 iterations in 333 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 10 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 298/298 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 10 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2023-04-07 02:00:20] [INFO ] Invariant cache hit.
[2023-04-07 02:00:20] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-04-07 02:00:20] [INFO ] Invariant cache hit.
[2023-04-07 02:00:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:21] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
[2023-04-07 02:00:21] [INFO ] Redundant transitions in 33 ms returned []
[2023-04-07 02:00:21] [INFO ] Invariant cache hit.
[2023-04-07 02:00:21] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1446 ms. Remains : 298/298 places, 595/595 transitions.
Starting property specific reduction for Anderson-PT-11-UpperBounds-05
[2023-04-07 02:00:21] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-04-07 02:00:21] [INFO ] Invariant cache hit.
[2023-04-07 02:00:21] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-04-07 02:00:21] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 02:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:21] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-04-07 02:00:21] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:00:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:22] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 18 ms returned sat
[2023-04-07 02:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:22] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-04-07 02:00:22] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:22] [INFO ] [Nat]Added 110 Read/Feed constraints in 68 ms returned sat
[2023-04-07 02:00:22] [INFO ] Computed and/alt/rep : 23/34/23 causal constraints (skipped 561 transitions) in 28 ms.
[2023-04-07 02:00:22] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 0 ms to minimize.
[2023-04-07 02:00:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-04-07 02:00:22] [INFO ] Added : 2 causal constraints over 2 iterations in 329 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 8 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 298/298 places, 595/595 transitions.
[2023-04-07 02:00:22] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1279 ms. (steps per millisecond=781 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties (out of 1) seen :0
[2023-04-07 02:00:24] [INFO ] Invariant cache hit.
[2023-04-07 02:00:24] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 02:00:24] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 02:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:24] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-04-07 02:00:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 02:00:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 02:00:24] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 02:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 02:00:24] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-04-07 02:00:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:25] [INFO ] [Nat]Added 110 Read/Feed constraints in 69 ms returned sat
[2023-04-07 02:00:25] [INFO ] Computed and/alt/rep : 23/34/23 causal constraints (skipped 561 transitions) in 30 ms.
[2023-04-07 02:00:25] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 0 ms to minimize.
[2023-04-07 02:00:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-04-07 02:00:25] [INFO ] Added : 2 causal constraints over 2 iterations in 307 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 11 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 298/298 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 7 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2023-04-07 02:00:25] [INFO ] Invariant cache hit.
[2023-04-07 02:00:25] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-04-07 02:00:25] [INFO ] Invariant cache hit.
[2023-04-07 02:00:25] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 02:00:26] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-04-07 02:00:26] [INFO ] Redundant transitions in 15 ms returned []
[2023-04-07 02:00:26] [INFO ] Invariant cache hit.
[2023-04-07 02:00:27] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1547 ms. Remains : 298/298 places, 595/595 transitions.
Ending property specific reduction for Anderson-PT-11-UpperBounds-05 in 5316 ms.
[2023-04-07 02:00:27] [INFO ] Flatten gal took : 104 ms
[2023-04-07 02:00:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-04-07 02:00:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 298 places, 595 transitions and 2378 arcs took 6 ms.
Total runtime 47960 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Anderson-PT-11
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
Upper Bounds

FORMULA Anderson-PT-11-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680832831632

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 Anderson-PT-11-UpperBounds-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 Anderson-PT-11-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 Anderson-PT-11-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/368/UpperBounds-4.sara.
sara: place or transition ordering is non-deterministic
lola: REPORT NUM
lola: FINISHED task # 5 (type EXCL) for Anderson-PT-11-UpperBounds-05
lola: markings : 196846
lola: fired transitions : 250865
lola: time used : 3.000000
lola: memory pages used : 2
lola: CANCELED task # 3 (type FNDP) for Anderson-PT-11-UpperBounds-05 (obsolete)
lola: CANCELED task # 4 (type EQUN) for Anderson-PT-11-UpperBounds-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-11-UpperBounds-05: BOUND 1 state space


Time elapsed: 3 secs. Pages in use: 2

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="Anderson-PT-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Anderson-PT-11, 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 r519-tall-167987244700061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-11.tgz
mv Anderson-PT-11 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 ;