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

About the Execution of 2022-gold for PolyORBLF-COL-S02J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
492.903 24547.00 37275.00 116.10 1 2 1 2 5 1 2 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.r319-tall-167873969900045.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 gold2022
Input is PolyORBLF-COL-S02J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969900045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 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-COL-S02J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678870691416

Running Version 202205111006
[2023-03-15 08:58:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 08:58:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 08:58:12] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 08:58:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 08:58:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 673 ms
[2023-03-15 08:58:13] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-15 08:58:13] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2023-03-15 08:58:13] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2023-03-15 08:58:13] [INFO ] Computed 26 place invariants in 11 ms
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-15 08:58:13] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-15 08:58:13] [INFO ] Computed 26 place invariants in 4 ms
[2023-03-15 08:58:13] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 08:58:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-15 08:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:13] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-15 08:58:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 08:58:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:13] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-15 08:58:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 08:58:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-15 08:58:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 08:58:14] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
[2023-03-15 08:58:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-15 08:58:14] [INFO ] Added : 61 causal constraints over 13 iterations in 223 ms. Result :sat
Minimization took 32 ms.
[2023-03-15 08:58:14] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:14] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 08:58:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:14] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-15 08:58:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 08:58:14] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2023-03-15 08:58:14] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2023-03-15 08:58:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-15 08:58:14] [INFO ] Added : 62 causal constraints over 14 iterations in 245 ms. Result :sat
Minimization took 32 ms.
[2023-03-15 08:58:14] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-15 08:58:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:14] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 26 ms returned sat
[2023-03-15 08:58:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 08:58:14] [INFO ] Added : 12 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 25 ms.
[2023-03-15 08:58:14] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:14] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-15 08:58:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 33 ms returned sat
[2023-03-15 08:58:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 08:58:15] [INFO ] Added : 54 causal constraints over 11 iterations in 103 ms. Result :sat
Minimization took 21 ms.
[2023-03-15 08:58:15] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:15] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 08:58:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-15 08:58:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 08:58:15] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 08:58:15] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:15] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 08:58:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2023-03-15 08:58:15] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2023-03-15 08:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-15 08:58:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 08:58:15] [INFO ] Added : 54 causal constraints over 11 iterations in 104 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 08:58:15] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:15] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-15 08:58:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:15] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-15 08:58:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 16 ms returned sat
[2023-03-15 08:58:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 08:58:16] [INFO ] Added : 54 causal constraints over 11 iterations in 125 ms. Result :sat
Minimization took 32 ms.
[2023-03-15 08:58:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 08:58:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:16] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-15 08:58:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-15 08:58:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-15 08:58:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 08:58:16] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-03-15 08:58:16] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2023-03-15 08:58:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-15 08:58:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 167 ms
[2023-03-15 08:58:16] [INFO ] Added : 55 causal constraints over 12 iterations in 295 ms. Result :sat
Minimization took 22 ms.
[2023-03-15 08:58:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:16] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-15 08:58:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:16] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-15 08:58:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2023-03-15 08:58:16] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2023-03-15 08:58:16] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2023-03-15 08:58:16] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2023-03-15 08:58:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2023-03-15 08:58:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 08:58:17] [INFO ] Added : 58 causal constraints over 12 iterations in 84 ms. Result :sat
Minimization took 32 ms.
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 08:58:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:17] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-15 08:58:17] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2023-03-15 08:58:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-15 08:58:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 08:58:17] [INFO ] Added : 23 causal constraints over 5 iterations in 77 ms. Result :sat
Minimization took 30 ms.
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned unsat
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 08:58:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:17] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2023-03-15 08:58:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 08:58:17] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2023-03-15 08:58:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-15 08:58:17] [INFO ] Added : 61 causal constraints over 14 iterations in 185 ms. Result :sat
Minimization took 24 ms.
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 08:58:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:18] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-15 08:58:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-15 08:58:18] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2023-03-15 08:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-15 08:58:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 08:58:18] [INFO ] Added : 41 causal constraints over 9 iterations in 92 ms. Result :sat
Minimization took 16 ms.
[2023-03-15 08:58:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 08:58:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 08:58:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 08:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:18] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 08:58:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2023-03-15 08:58:18] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2023-03-15 08:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-15 08:58:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 08:58:18] [INFO ] Added : 60 causal constraints over 14 iterations in 104 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [2, 8, 2, 1, 20, 8, 1, 1, 2, 1, 1, 3, 2, 8]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-15 08:58:18] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 31 ms.
[2023-03-15 08:58:18] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 13) seen :16
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :8
[2023-03-15 08:58:18] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2023-03-15 08:58:18] [INFO ] Computed 50 place invariants in 63 ms
[2023-03-15 08:58:19] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 08:58:19] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 14 ms returned unsat
[2023-03-15 08:58:19] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 08:58:19] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 23 ms returned sat
[2023-03-15 08:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:19] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-15 08:58:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-15 08:58:19] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 33 ms returned sat
[2023-03-15 08:58:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:22] [INFO ] [Nat]Absence check using state equation in 2901 ms returned sat
[2023-03-15 08:58:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 08:58:24] [INFO ] [Nat]Added 96 Read/Feed constraints in 1611 ms returned sat
[2023-03-15 08:58:24] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 1 ms to minimize.
[2023-03-15 08:58:24] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 281 ms
[2023-03-15 08:58:24] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-15 08:58:24] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 9 ms returned unsat
[2023-03-15 08:58:24] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 08:58:24] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 21 ms returned sat
[2023-03-15 08:58:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:25] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2023-03-15 08:58:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 08:58:25] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 22 ms returned sat
[2023-03-15 08:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:25] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2023-03-15 08:58:26] [INFO ] [Nat]Added 96 Read/Feed constraints in 597 ms returned sat
[2023-03-15 08:58:26] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 1 ms to minimize.
[2023-03-15 08:58:26] [INFO ] Deduced a trap composed of 131 places in 221 ms of which 1 ms to minimize.
[2023-03-15 08:58:27] [INFO ] Deduced a trap composed of 332 places in 300 ms of which 0 ms to minimize.
[2023-03-15 08:58:28] [INFO ] Deduced a trap composed of 106 places in 382 ms of which 1 ms to minimize.
[2023-03-15 08:58:28] [INFO ] Deduced a trap composed of 66 places in 218 ms of which 1 ms to minimize.
[2023-03-15 08:58:29] [INFO ] Deduced a trap composed of 130 places in 177 ms of which 1 ms to minimize.
[2023-03-15 08:58:29] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 0 ms to minimize.
[2023-03-15 08:58:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 3363 ms
[2023-03-15 08:58:29] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 08:58:29] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 18 ms returned unsat
[2023-03-15 08:58:29] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 08:58:29] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 17 ms returned sat
[2023-03-15 08:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:58:30] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-15 08:58:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:58:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 08:58:30] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 13 ms returned unsat
[2023-03-15 08:58:30] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 08:58:30] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 20, 1, 1, 1, 1, 1] Max seen :[1, 2, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 614 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 146 place count 540 transition count 978
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 274 place count 476 transition count 978
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 386 place count 420 transition count 922
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 402 place count 420 transition count 906
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 418 place count 404 transition count 906
Applied a total of 418 rules in 170 ms. Remains 404 /614 variables (removed 210) and now considering 906/1114 (removed 208) transitions.
[2023-03-15 08:58:30] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
// Phase 1: matrix 890 rows 404 cols
[2023-03-15 08:58:31] [INFO ] Computed 48 place invariants in 22 ms
[2023-03-15 08:58:31] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 404/614 places, 818/1114 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 802
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 18 place count 386 transition count 786
Applied a total of 18 rules in 28 ms. Remains 386 /404 variables (removed 18) and now considering 786/818 (removed 32) transitions.
Finished structural reductions, in 2 iterations. Remains : 386/614 places, 786/1114 transitions.
Normalized transition count is 770 out of 786 initially.
// Phase 1: matrix 770 rows 386 cols
[2023-03-15 08:58:31] [INFO ] Computed 48 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 413 resets, run finished after 2893 ms. (steps per millisecond=345 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 182 resets, run finished after 1463 ms. (steps per millisecond=683 ) properties (out of 1) seen :2
[2023-03-15 08:58:35] [INFO ] Flow matrix only has 770 transitions (discarded 16 similar events)
// Phase 1: matrix 770 rows 386 cols
[2023-03-15 08:58:35] [INFO ] Computed 48 place invariants in 18 ms
[2023-03-15 08:58:35] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 08:58:35] [INFO ] [Real]Absence check using 11 positive and 37 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [2] Max seen :[2]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23257 ms.

BK_STOP 1678870715963

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is PolyORBLF-COL-S02J04T08, 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 r319-tall-167873969900045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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