fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r307-tajo-171654460600191
Last Updated
July 7, 2024

About the Execution of 2023-gold for PolyORBLF-PT-S04J06T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16216.892 3600000.00 3574972.00 168807.10 4 1 1 1 1 1 4 4 1 1 1 1 1 10 ? 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460600191.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBLF-PT-S04J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460600191
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 21K Apr 11 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 11 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 11 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 11 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 540K Apr 11 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.3M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717121634535

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 02:13:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 02:13:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 02:13:58] [INFO ] Load time of PNML (sax parser for PT used): 444 ms
[2024-05-31 02:13:58] [INFO ] Transformed 966 places.
[2024-05-31 02:13:58] [INFO ] Transformed 5354 transitions.
[2024-05-31 02:13:58] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 707 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Normalized transition count is 2604 out of 2644 initially.
// Phase 1: matrix 2604 rows 966 cols
[2024-05-31 02:13:59] [INFO ] Computed 62 invariants in 241 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 16) seen :34
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 15) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 15) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 15) seen :32
[2024-05-31 02:14:00] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2024-05-31 02:14:00] [INFO ] Computed 62 invariants in 162 ms
[2024-05-31 02:14:00] [INFO ] [Real]Absence check using 16 positive place invariants in 39 ms returned sat
[2024-05-31 02:14:01] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 86 ms returned unsat
[2024-05-31 02:14:01] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2024-05-31 02:14:01] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 70 ms returned unsat
[2024-05-31 02:14:01] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 02:14:01] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 41 ms returned unsat
[2024-05-31 02:14:01] [INFO ] [Real]Absence check using 16 positive place invariants in 119 ms returned sat
[2024-05-31 02:14:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 241 ms returned unsat
[2024-05-31 02:14:02] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 02:14:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 68 ms returned unsat
[2024-05-31 02:14:02] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 02:14:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 28 ms returned unsat
[2024-05-31 02:14:02] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 02:14:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 20 ms returned unsat
[2024-05-31 02:14:03] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned sat
[2024-05-31 02:14:03] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 71 ms returned unsat
[2024-05-31 02:14:03] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 02:14:03] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 6 ms returned unsat
[2024-05-31 02:14:03] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-05-31 02:14:03] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 57 ms returned unsat
[2024-05-31 02:14:03] [INFO ] [Real]Absence check using 16 positive place invariants in 75 ms returned sat
[2024-05-31 02:14:03] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 74 ms returned unsat
[2024-05-31 02:14:04] [INFO ] [Real]Absence check using 16 positive place invariants in 21 ms returned sat
[2024-05-31 02:14:04] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 69 ms returned unsat
[2024-05-31 02:14:04] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 02:14:04] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 73 ms returned unsat
[2024-05-31 02:14:04] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2024-05-31 02:14:04] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 50 ms returned sat
[2024-05-31 02:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:14:08] [INFO ] [Real]Absence check using state equation in 3998 ms returned sat
[2024-05-31 02:14:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:14:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 109 ms returned sat
[2024-05-31 02:14:09] [INFO ] [Nat]Absence check using 16 positive and 46 generalized place invariants in 327 ms returned sat
[2024-05-31 02:14:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:14:13] [INFO ] [Nat]Absence check using state equation in 4363 ms returned unknown
[2024-05-31 02:14:14] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 02:14:14] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 107 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 10, 10, 1] Max seen :[4, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 10, 1, 1]
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 962 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 872 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 184 place count 872 transition count 2434
Deduced a syphon composed of 120 places in 15 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 424 place count 752 transition count 2434
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 17 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 622 place count 653 transition count 2335
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 642 place count 653 transition count 2315
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 662 place count 633 transition count 2315
Applied a total of 662 rules in 743 ms. Remains 633 /966 variables (removed 333) and now considering 2315/2644 (removed 329) transitions.
[2024-05-31 02:14:14] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
// Phase 1: matrix 2275 rows 633 cols
[2024-05-31 02:14:15] [INFO ] Computed 58 invariants in 83 ms
[2024-05-31 02:14:17] [INFO ] Dead Transitions using invariants and state equation in 2999 ms found 540 transitions.
Found 540 dead transitions using SMT.
Drop transitions removed 540 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 633/966 places, 1775/2644 transitions.
Applied a total of 0 rules in 44 ms. Remains 633 /633 variables (removed 0) and now considering 1775/1775 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3801 ms. Remains : 633/966 places, 1775/2644 transitions.
Normalized transition count is 1735 out of 1775 initially.
// Phase 1: matrix 1735 rows 633 cols
[2024-05-31 02:14:18] [INFO ] Computed 58 invariants in 28 ms
Incomplete random walk after 1000000 steps, including 68 resets, run finished after 7869 ms. (steps per millisecond=127 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 2652 ms. (steps per millisecond=377 ) properties (out of 1) seen :1
[2024-05-31 02:14:28] [INFO ] Flow matrix only has 1735 transitions (discarded 40 similar events)
// Phase 1: matrix 1735 rows 633 cols
[2024-05-31 02:14:28] [INFO ] Computed 58 invariants in 63 ms
[2024-05-31 02:14:28] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-31 02:14:28] [INFO ] [Real]Absence check using 15 positive and 43 generalized place invariants in 25 ms returned sat
[2024-05-31 02:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:14:32] [INFO ] [Real]Absence check using state equation in 4021 ms returned sat
[2024-05-31 02:14:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:14:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-31 02:14:33] [INFO ] [Nat]Absence check using 15 positive and 43 generalized place invariants in 31 ms returned sat
[2024-05-31 02:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:14:37] [INFO ] [Nat]Absence check using state equation in 4484 ms returned sat
[2024-05-31 02:14:37] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-31 02:14:39] [INFO ] [Nat]Added 200 Read/Feed constraints in 1973 ms returned sat
[2024-05-31 02:14:39] [INFO ] Deduced a trap composed of 50 places in 347 ms of which 7 ms to minimize.
[2024-05-31 02:14:40] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 1 ms to minimize.
[2024-05-31 02:14:40] [INFO ] Deduced a trap composed of 51 places in 297 ms of which 1 ms to minimize.
[2024-05-31 02:14:41] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 14 ms to minimize.
[2024-05-31 02:14:41] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 2 ms to minimize.
[2024-05-31 02:14:41] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 3 ms to minimize.
[2024-05-31 02:14:41] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-31 02:14:42] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-05-31 02:14:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5154 ms
[2024-05-31 02:14:44] [INFO ] Computed and/alt/rep : 731/3577/701 causal constraints (skipped 1030 transitions) in 188 ms.
[2024-05-31 02:14:48] [INFO ] Added : 5 causal constraints over 1 iterations in 3910 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[1]
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1775/1775 transitions.
Applied a total of 0 rules in 59 ms. Remains 633 /633 variables (removed 0) and now considering 1775/1775 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 633/633 places, 1775/1775 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1775/1775 transitions.
Applied a total of 0 rules in 34 ms. Remains 633 /633 variables (removed 0) and now considering 1775/1775 (removed 0) transitions.
[2024-05-31 02:14:51] [INFO ] Flow matrix only has 1735 transitions (discarded 40 similar events)
[2024-05-31 02:14:51] [INFO ] Invariant cache hit.
[2024-05-31 02:14:52] [INFO ] Implicit Places using invariants in 918 ms returned [66, 145, 180, 223, 305, 342, 364, 436, 474, 553]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 925 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 623/633 places, 1775/1775 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 617 transition count 1769
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 617 transition count 1769
Applied a total of 12 rules in 82 ms. Remains 617 /623 variables (removed 6) and now considering 1769/1775 (removed 6) transitions.
[2024-05-31 02:14:52] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
// Phase 1: matrix 1729 rows 617 cols
[2024-05-31 02:14:52] [INFO ] Computed 48 invariants in 30 ms
[2024-05-31 02:14:53] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-31 02:14:53] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
[2024-05-31 02:14:53] [INFO ] Invariant cache hit.
[2024-05-31 02:14:53] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-31 02:15:23] [INFO ] Implicit Places using invariants and state equation in 30481 ms returned []
Implicit Place search using SMT with State Equation took 31234 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 617/633 places, 1769/1775 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32276 ms. Remains : 617/633 places, 1769/1775 transitions.
Normalized transition count is 1729 out of 1769 initially.
// Phase 1: matrix 1729 rows 617 cols
[2024-05-31 02:15:23] [INFO ] Computed 48 invariants in 34 ms
Incomplete random walk after 1000000 steps, including 83 resets, run finished after 6705 ms. (steps per millisecond=149 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 2098 ms. (steps per millisecond=476 ) properties (out of 1) seen :1
[2024-05-31 02:15:32] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
// Phase 1: matrix 1729 rows 617 cols
[2024-05-31 02:15:32] [INFO ] Computed 48 invariants in 64 ms
[2024-05-31 02:15:32] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2024-05-31 02:15:33] [INFO ] [Real]Absence check using 15 positive and 33 generalized place invariants in 38 ms returned sat
[2024-05-31 02:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:15:38] [INFO ] [Real]Absence check using state equation in 5092 ms returned sat
[2024-05-31 02:15:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:15:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-31 02:15:38] [INFO ] [Nat]Absence check using 15 positive and 33 generalized place invariants in 26 ms returned sat
[2024-05-31 02:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:16:23] [INFO ] [Nat]Absence check using state equation in 44887 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[1]
Support contains 1 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1769/1769 transitions.
Applied a total of 0 rules in 76 ms. Remains 617 /617 variables (removed 0) and now considering 1769/1769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 617/617 places, 1769/1769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1769/1769 transitions.
Applied a total of 0 rules in 54 ms. Remains 617 /617 variables (removed 0) and now considering 1769/1769 (removed 0) transitions.
[2024-05-31 02:16:23] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
[2024-05-31 02:16:23] [INFO ] Invariant cache hit.
[2024-05-31 02:16:24] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-05-31 02:16:24] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
[2024-05-31 02:16:24] [INFO ] Invariant cache hit.
[2024-05-31 02:16:24] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-31 02:16:50] [INFO ] Implicit Places using invariants and state equation in 26038 ms returned []
Implicit Place search using SMT with State Equation took 26747 ms to find 0 implicit places.
[2024-05-31 02:16:50] [INFO ] Redundant transitions in 118 ms returned []
[2024-05-31 02:16:50] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
[2024-05-31 02:16:50] [INFO ] Invariant cache hit.
[2024-05-31 02:16:51] [INFO ] Dead Transitions using invariants and state equation in 1498 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28437 ms. Remains : 617/617 places, 1769/1769 transitions.
Starting property specific reduction for PolyORBLF-PT-S04J06T10-UpperBounds-14
Normalized transition count is 1729 out of 1769 initially.
// Phase 1: matrix 1729 rows 617 cols
[2024-05-31 02:16:51] [INFO ] Computed 48 invariants in 30 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :1
[2024-05-31 02:16:51] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
// Phase 1: matrix 1729 rows 617 cols
[2024-05-31 02:16:51] [INFO ] Computed 48 invariants in 66 ms
[2024-05-31 02:16:52] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-31 02:16:52] [INFO ] [Real]Absence check using 15 positive and 33 generalized place invariants in 27 ms returned sat
[2024-05-31 02:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:16:56] [INFO ] [Real]Absence check using state equation in 4502 ms returned sat
[2024-05-31 02:16:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:16:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-31 02:16:56] [INFO ] [Nat]Absence check using 15 positive and 33 generalized place invariants in 24 ms returned sat
[2024-05-31 02:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:17:01] [INFO ] [Nat]Absence check using state equation in 4883 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[1]
Support contains 1 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1769/1769 transitions.
Applied a total of 0 rules in 38 ms. Remains 617 /617 variables (removed 0) and now considering 1769/1769 (removed 0) transitions.
[2024-05-31 02:17:01] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
[2024-05-31 02:17:01] [INFO ] Invariant cache hit.
[2024-05-31 02:17:02] [INFO ] Dead Transitions using invariants and state equation in 1242 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1282 ms. Remains : 617/617 places, 1769/1769 transitions.
Normalized transition count is 1729 out of 1769 initially.
// Phase 1: matrix 1729 rows 617 cols
[2024-05-31 02:17:03] [INFO ] Computed 48 invariants in 36 ms
Incomplete random walk after 1000000 steps, including 62 resets, run finished after 6139 ms. (steps per millisecond=162 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 21 resets, run finished after 2000 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
[2024-05-31 02:17:11] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
// Phase 1: matrix 1729 rows 617 cols
[2024-05-31 02:17:11] [INFO ] Computed 48 invariants in 68 ms
[2024-05-31 02:17:11] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-31 02:17:11] [INFO ] [Real]Absence check using 15 positive and 33 generalized place invariants in 28 ms returned sat
[2024-05-31 02:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:17:16] [INFO ] [Real]Absence check using state equation in 4986 ms returned sat
[2024-05-31 02:17:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:17:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-31 02:17:16] [INFO ] [Nat]Absence check using 15 positive and 33 generalized place invariants in 26 ms returned sat
[2024-05-31 02:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:18:01] [INFO ] [Nat]Absence check using state equation in 44883 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[1]
Support contains 1 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1769/1769 transitions.
Applied a total of 0 rules in 44 ms. Remains 617 /617 variables (removed 0) and now considering 1769/1769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 617/617 places, 1769/1769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1769/1769 transitions.
Applied a total of 0 rules in 40 ms. Remains 617 /617 variables (removed 0) and now considering 1769/1769 (removed 0) transitions.
[2024-05-31 02:18:01] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
[2024-05-31 02:18:01] [INFO ] Invariant cache hit.
[2024-05-31 02:18:02] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-31 02:18:02] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
[2024-05-31 02:18:02] [INFO ] Invariant cache hit.
[2024-05-31 02:18:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-31 02:18:32] [INFO ] Implicit Places using invariants and state equation in 30055 ms returned []
Implicit Place search using SMT with State Equation took 30858 ms to find 0 implicit places.
[2024-05-31 02:18:32] [INFO ] Redundant transitions in 98 ms returned []
[2024-05-31 02:18:32] [INFO ] Flow matrix only has 1729 transitions (discarded 40 similar events)
[2024-05-31 02:18:32] [INFO ] Invariant cache hit.
[2024-05-31 02:18:33] [INFO ] Dead Transitions using invariants and state equation in 1421 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32439 ms. Remains : 617/617 places, 1769/1769 transitions.
Ending property specific reduction for PolyORBLF-PT-S04J06T10-UpperBounds-14 in 102253 ms.
[2024-05-31 02:18:34] [INFO ] Flatten gal took : 180 ms
[2024-05-31 02:18:34] [INFO ] Applying decomposition
[2024-05-31 02:18:34] [INFO ] Flatten gal took : 111 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6963197047515257649.txt' '-o' '/tmp/graph6963197047515257649.bin' '-w' '/tmp/graph6963197047515257649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6963197047515257649.bin' '-l' '-1' '-v' '-w' '/tmp/graph6963197047515257649.weights' '-q' '0' '-e' '0.001'
[2024-05-31 02:18:34] [INFO ] Decomposing Gal with order
[2024-05-31 02:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 02:18:35] [INFO ] Removed a total of 1718 redundant transitions.
[2024-05-31 02:18:35] [INFO ] Flatten gal took : 416 ms
[2024-05-31 02:18:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 399 labels/synchronizations in 50 ms.
[2024-05-31 02:18:35] [INFO ] Time to serialize gal into /tmp/UpperBounds12979565115871424905.gal : 34 ms
[2024-05-31 02:18:35] [INFO ] Time to serialize properties into /tmp/UpperBounds1291384580697036414.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12979565115871424905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1291384580697036414.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds1291384580697036414.prop.
Detected timeout of ITS tools.
[2024-05-31 02:40:13] [INFO ] Flatten gal took : 739 ms
[2024-05-31 02:40:14] [INFO ] Time to serialize gal into /tmp/UpperBounds14740778730917082263.gal : 250 ms
[2024-05-31 02:40:14] [INFO ] Time to serialize properties into /tmp/UpperBounds2868580778835779325.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14740778730917082263.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2868580778835779325.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds2868580778835779325.prop.
Detected timeout of ITS tools.
[2024-05-31 03:01:52] [INFO ] Flatten gal took : 3096 ms
[2024-05-31 03:01:54] [INFO ] Input system was already deterministic with 1769 transitions.
[2024-05-31 03:01:54] [INFO ] Transformed 617 places.
[2024-05-31 03:01:54] [INFO ] Transformed 1769 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 03:02:24] [INFO ] Time to serialize gal into /tmp/UpperBounds17098795390983718843.gal : 31 ms
[2024-05-31 03:02:24] [INFO ] Time to serialize properties into /tmp/UpperBounds17424480538293146466.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17098795390983718843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17424480538293146466.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17424480538293146466.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 7030436 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16188160 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBLF-PT-S04J06T10, 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 r307-tajo-171654460600191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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