About the Execution of GreatSPN+red for FireWire-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 577.056 | 35474.00 | 53110.00 | 150.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r549-tall-171734898000189.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898000189
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 86K Jun 2 16:33 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 FireWire-PT-03-UpperBounds-00
FORMULA_NAME FireWire-PT-03-UpperBounds-01
FORMULA_NAME FireWire-PT-03-UpperBounds-02
FORMULA_NAME FireWire-PT-03-UpperBounds-03
FORMULA_NAME FireWire-PT-03-UpperBounds-04
FORMULA_NAME FireWire-PT-03-UpperBounds-05
FORMULA_NAME FireWire-PT-03-UpperBounds-06
FORMULA_NAME FireWire-PT-03-UpperBounds-07
FORMULA_NAME FireWire-PT-03-UpperBounds-08
FORMULA_NAME FireWire-PT-03-UpperBounds-09
FORMULA_NAME FireWire-PT-03-UpperBounds-10
FORMULA_NAME FireWire-PT-03-UpperBounds-11
FORMULA_NAME FireWire-PT-03-UpperBounds-12
FORMULA_NAME FireWire-PT-03-UpperBounds-13
FORMULA_NAME FireWire-PT-03-UpperBounds-14
FORMULA_NAME FireWire-PT-03-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717365558202
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:59:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 21:59:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:59:19] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 21:59:19] [INFO ] Transformed 112 places.
[2024-06-02 21:59:19] [INFO ] Transformed 356 transitions.
[2024-06-02 21:59:19] [INFO ] Found NUPN structural information;
[2024-06-02 21:59:19] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 21:59:19] [INFO ] Flow matrix only has 271 transitions (discarded 32 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 21:59:19] [INFO ] Computed 9 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (517 resets) in 47 ms. (208 steps per ms)
FORMULA FireWire-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100007 steps (1184 resets) in 129 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 21:59:19] [INFO ] Flow matrix only has 271 transitions (discarded 32 similar events)
[2024-06-02 21:59:19] [INFO ] Invariant cache hit.
[2024-06-02 21:59:19] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 21:59:19] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 21:59:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 21:59:20] [INFO ] [Real]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 21:59:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Nat]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-06-02 21:59:20] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 30 ms.
[2024-06-02 21:59:20] [INFO ] Added : 6 causal constraints over 2 iterations in 83 ms. Result :sat
Minimization took 102 ms.
[2024-06-02 21:59:20] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Real]Added 41 Read/Feed constraints in 10 ms returned sat
[2024-06-02 21:59:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Nat]Added 41 Read/Feed constraints in 22 ms returned sat
[2024-06-02 21:59:20] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 27 ms.
[2024-06-02 21:59:20] [INFO ] Added : 6 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 91 ms.
[2024-06-02 21:59:20] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-06-02 21:59:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 21:59:20] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 21:59:21] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 33 ms.
[2024-06-02 21:59:21] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 10 ms to minimize.
[2024-06-02 21:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-06-02 21:59:21] [INFO ] Added : 47 causal constraints over 10 iterations in 325 ms. Result :sat
Minimization took 106 ms.
[2024-06-02 21:59:21] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:21] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-02 21:59:21] [INFO ] [Real]Added 41 Read/Feed constraints in 37 ms returned sat
[2024-06-02 21:59:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 21:59:21] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 21:59:21] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 21:59:21] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 26 ms.
[2024-06-02 21:59:21] [INFO ] Added : 49 causal constraints over 12 iterations in 246 ms. Result :sat
Minimization took 105 ms.
[2024-06-02 21:59:22] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:22] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 21:59:22] [INFO ] [Real]Added 41 Read/Feed constraints in 16 ms returned sat
[2024-06-02 21:59:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 21:59:22] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 21:59:22] [INFO ] [Nat]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-06-02 21:59:22] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 23 ms.
[2024-06-02 21:59:22] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-06-02 21:59:22] [INFO ] Added : 16 causal constraints over 4 iterations in 228 ms. Result :sat
Minimization took 102 ms.
[2024-06-02 21:59:22] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:22] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 21:59:22] [INFO ] [Real]Added 41 Read/Feed constraints in 27 ms returned sat
[2024-06-02 21:59:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:22] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 21:59:22] [INFO ] [Nat]Added 41 Read/Feed constraints in 17 ms returned sat
[2024-06-02 21:59:22] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 27 ms.
[2024-06-02 21:59:23] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-06-02 21:59:23] [INFO ] Added : 36 causal constraints over 8 iterations in 278 ms. Result :sat
Minimization took 102 ms.
[2024-06-02 21:59:23] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:23] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-02 21:59:23] [INFO ] [Real]Added 41 Read/Feed constraints in 7 ms returned sat
[2024-06-02 21:59:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:23] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 21:59:23] [INFO ] [Nat]Added 41 Read/Feed constraints in 26 ms returned sat
[2024-06-02 21:59:23] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 32 ms.
[2024-06-02 21:59:23] [INFO ] Added : 7 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 94 ms.
[2024-06-02 21:59:23] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:23] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 21:59:23] [INFO ] [Real]Added 41 Read/Feed constraints in 16 ms returned sat
[2024-06-02 21:59:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 21:59:23] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 21:59:23] [INFO ] [Nat]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-06-02 21:59:23] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 17 ms.
[2024-06-02 21:59:24] [INFO ] Added : 64 causal constraints over 15 iterations in 252 ms. Result :sat
Minimization took 106 ms.
[2024-06-02 21:59:24] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-02 21:59:24] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 21:59:24] [INFO ] [Real]Added 41 Read/Feed constraints in 16 ms returned sat
[2024-06-02 21:59:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 21:59:24] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 21:59:24] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-06-02 21:59:24] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 17 ms.
[2024-06-02 21:59:24] [INFO ] Added : 12 causal constraints over 3 iterations in 104 ms. Result :sat
Minimization took 102 ms.
[2024-06-02 21:59:24] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:24] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 21:59:24] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-06-02 21:59:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:24] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 21:59:24] [INFO ] [Nat]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-06-02 21:59:24] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 14 ms.
[2024-06-02 21:59:25] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-02 21:59:25] [INFO ] Added : 10 causal constraints over 4 iterations in 203 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 299
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 299
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 108 transition count 291
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 108 transition count 291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 106 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 106 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 101 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 31 place count 101 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 42 place count 101 transition count 275
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 101 transition count 277
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 100 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 100 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 99 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 98 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 50 place count 98 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 97 transition count 271
Applied a total of 52 rules in 123 ms. Remains 97 /112 variables (removed 15) and now considering 271/303 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 97/112 places, 271/303 transitions.
[2024-06-02 21:59:25] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
// Phase 1: matrix 243 rows 97 cols
[2024-06-02 21:59:25] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (60776 resets) in 1053 ms. (948 steps per ms)
BEST_FIRST walk for 3000002 steps (45033 resets) in 1118 ms. (2680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 21:59:27] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 21:59:27] [INFO ] Invariant cache hit.
[2024-06-02 21:59:27] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:59:27] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-02 21:59:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:59:27] [INFO ] [Real]Added 37 Read/Feed constraints in 9 ms returned sat
[2024-06-02 21:59:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:59:27] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-02 21:59:27] [INFO ] [Nat]Added 37 Read/Feed constraints in 12 ms returned sat
[2024-06-02 21:59:27] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 17 ms.
[2024-06-02 21:59:28] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-06-02 21:59:28] [INFO ] Added : 42 causal constraints over 11 iterations in 256 ms. Result :sat
Minimization took 78 ms.
[2024-06-02 21:59:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:59:28] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 21:59:28] [INFO ] [Real]Added 37 Read/Feed constraints in 16 ms returned sat
[2024-06-02 21:59:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:59:28] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-02 21:59:28] [INFO ] [Nat]Added 37 Read/Feed constraints in 14 ms returned sat
[2024-06-02 21:59:28] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 31 ms.
[2024-06-02 21:59:28] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-06-02 21:59:28] [INFO ] Added : 52 causal constraints over 12 iterations in 265 ms. Result :sat
Minimization took 75 ms.
[2024-06-02 21:59:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:59:28] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-02 21:59:28] [INFO ] [Real]Added 37 Read/Feed constraints in 3 ms returned sat
[2024-06-02 21:59:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:28] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-02 21:59:28] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2024-06-02 21:59:28] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 13 ms.
[2024-06-02 21:59:29] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-02 21:59:29] [INFO ] Added : 11 causal constraints over 3 iterations in 121 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 271/271 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 97/97 places, 271/271 transitions.
[2024-06-02 21:59:29] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 21:59:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (61102 resets) in 1000 ms. (999 steps per ms)
BEST_FIRST walk for 2000001 steps (30029 resets) in 718 ms. (2781 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 21:59:30] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 21:59:30] [INFO ] Invariant cache hit.
[2024-06-02 21:59:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:59:31] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-02 21:59:31] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:59:31] [INFO ] [Real]Added 37 Read/Feed constraints in 9 ms returned sat
[2024-06-02 21:59:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:59:31] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 21:59:31] [INFO ] [Nat]Added 37 Read/Feed constraints in 12 ms returned sat
[2024-06-02 21:59:31] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 20 ms.
[2024-06-02 21:59:31] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:59:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-06-02 21:59:31] [INFO ] Added : 42 causal constraints over 11 iterations in 255 ms. Result :sat
Minimization took 79 ms.
[2024-06-02 21:59:31] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:59:31] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-02 21:59:31] [INFO ] [Real]Added 37 Read/Feed constraints in 14 ms returned sat
[2024-06-02 21:59:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:59:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:59:31] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-02 21:59:31] [INFO ] [Nat]Added 37 Read/Feed constraints in 14 ms returned sat
[2024-06-02 21:59:31] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 15 ms.
[2024-06-02 21:59:31] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:59:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 21:59:31] [INFO ] Added : 52 causal constraints over 12 iterations in 254 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 271/271 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 97/97 places, 271/271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 271/271 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 21:59:32] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 21:59:32] [INFO ] Invariant cache hit.
[2024-06-02 21:59:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 21:59:32] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 21:59:32] [INFO ] Invariant cache hit.
[2024-06-02 21:59:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:59:32] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-02 21:59:32] [INFO ] Redundant transitions in 17 ms returned []
Running 269 sub problems to find dead transitions.
[2024-06-02 21:59:32] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 21:59:32] [INFO ] Invariant cache hit.
[2024-06-02 21:59:32] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-06-02 21:59:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-02 21:59:34] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-06-02 21:59:34] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-06-02 21:59:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 21:59:34] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 21:59:35] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 243/340 variables, 97/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 21:59:38] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 155 constraints, problems are : Problem set: 0 solved, 269 unsolved in 11114 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 21:59:43] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/340 variables, 97/119 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 37/156 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 269/425 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 425 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9207 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 14/14 constraints]
After SMT, in 20567ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 20578ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20829 ms. Remains : 97/97 places, 271/271 transitions.
RANDOM walk for 40000 steps (2462 resets) in 1190 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (638 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (587 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (654 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (580 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 4293 steps, run visited all 4 properties in 37 ms. (steps per millisecond=116 )
Probabilistic random walk after 4293 steps, saw 2047 distinct states, run finished after 40 ms. (steps per millisecond=107 ) properties seen :4
FORMULA FireWire-PT-03-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-03-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 34205 ms.
ITS solved all properties within timeout
BK_STOP 1717365593676
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-03, 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 r549-tall-171734898000189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-03.tgz
mv FireWire-PT-03 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;