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.r268-smll-171654406900103.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 itstools
Input is Parking-PT-864, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406900103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 427K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716673445268

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-25 21:44:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 21:44:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:44:07] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2024-05-25 21:44:07] [INFO ] Transformed 1185 places.
[2024-05-25 21:44:07] [INFO ] Transformed 1697 transitions.
[2024-05-25 21:44:07] [INFO ] Found NUPN structural information;
[2024-05-25 21:44:07] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 175 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
RANDOM walk for 40000 steps (155 resets) in 4621 ms. (8 steps per ms) remains 9/16 properties
FORMULA Parking-PT-864-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-25 21:44:09] [INFO ] Flatten gal took : 529 ms
[2024-05-25 21:44:09] [INFO ] Flatten gal took : 139 ms
[2024-05-25 21:44:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1430876400800078766.gal : 103 ms
[2024-05-25 21:44:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5574216565680984535.prop : 4 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1430876400800078766.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5574216565680984535.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 1493 ms. (26 steps per ms) remains 9/9 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5574216565680984535.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 751 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 632 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1325 ms. (30 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 900 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
// Phase 1: matrix 1009 rows 1185 cols
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 17
[2024-05-25 21:44:11] [INFO ] Computed 280 invariants in 48 ms
[2024-05-25 21:44:11] [INFO ] State equation strengthened by 248 read => feed constraints.
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :17 after 257
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 634/863 variables, 152/381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/863 variables, 634/1015 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/863 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 280/1143 variables, 120/1135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1143 variables, 280/1415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1143 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 42/1185 variables, 8/1423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1185 variables, 42/1465 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1185 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1009/2194 variables, 1185/2650 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2194 variables, 248/2898 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2194 variables, 0/2898 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/2194 variables, 0/2898 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2194/2194 variables, and 2898 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5047 ms.
Refiners :[Domain max(s): 1185/1185 constraints, Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1185/1185 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 634/863 variables, 152/381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/863 variables, 634/1015 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/863 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 280/1143 variables, 120/1135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1143 variables, 280/1415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1143 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 42/1185 variables, 8/1423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1185 variables, 42/1465 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-25 21:44:18] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 39 ms to minimize.
[2024-05-25 21:44:18] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 4 ms to minimize.
[2024-05-25 21:44:18] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1185 variables, 3/1468 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-25 21:44:19] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-25 21:44:19] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1185 variables, 2/1470 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-25 21:44:19] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1185 variables, 1/1471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-25 21:44:20] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1185 variables, 1/1472 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1185 variables, 0/1472 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 1009/2194 variables, 1185/2657 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 10381ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 229 out of 1185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1185 transition count 1004
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 1180 transition count 1003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 1179 transition count 1003
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 1179 transition count 998
Deduced a syphon composed of 5 places in 14 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 1174 transition count 998
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 1170 transition count 994
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 1170 transition count 994
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 1155 transition count 979
Free-agglomeration rule applied 113 times.
Iterating global reduction 3 with 113 rules applied. Total rules applied 173 place count 1155 transition count 866
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 3 with 113 rules applied. Total rules applied 286 place count 1042 transition count 866
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 287 place count 1042 transition count 866
Applied a total of 287 rules in 822 ms. Remains 1042 /1185 variables (removed 143) and now considering 866/1009 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 853 ms. Remains : 1042/1185 places, 866/1009 transitions.
RANDOM walk for 40000 steps (238 resets) in 1056 ms. (37 steps per ms) remains 8/9 properties
FORMULA Parking-PT-864-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 576 ms. (69 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 574 ms. (69 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 8/8 properties
// Phase 1: matrix 866 rows 1042 cols
[2024-05-25 21:44:24] [INFO ] Computed 280 invariants in 21 ms
[2024-05-25 21:44:24] [INFO ] State equation strengthened by 369 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 595/786 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 214/1000 variables, 140/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 42/1042 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 866/1908 variables, 1042/1322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1908 variables, 369/1691 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1908 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1908 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1908/1908 variables, and 1691 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2723 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1042/1042 constraints, ReadFeed: 369/369 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 595/786 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 214/1000 variables, 140/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 42/1042 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 21:44:27] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-25 21:44:28] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 866/1908 variables, 1042/1324 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1908 variables, 369/1693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1908 variables, 8/1701 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 21:44:30] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-05-25 21:44:30] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 35 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1908 variables, 2/1703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1908 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1908 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1908/1908 variables, and 1703 constraints, problems are : Problem set: 0 solved, 8 unsolved in 7002 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1042/1042 constraints, ReadFeed: 369/369 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 9884ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA Parking-PT-864-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 6637 ms.
Support contains 87 out of 1042 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 866/866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1042 transition count 851
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 1027 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 1026 transition count 850
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 32 place count 1026 transition count 834
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 64 place count 1010 transition count 834
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1008 transition count 832
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1008 transition count 832
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 94 place count 995 transition count 819
Free-agglomeration rule applied 46 times.
Iterating global reduction 3 with 46 rules applied. Total rules applied 140 place count 995 transition count 773
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 186 place count 949 transition count 773
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 949 transition count 772
Applied a total of 187 rules in 625 ms. Remains 949 /1042 variables (removed 93) and now considering 772/866 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 625 ms. Remains : 949/1042 places, 772/866 transitions.
RANDOM walk for 40000 steps (223 resets) in 772 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 539 ms. (74 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 688 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 348 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 111059 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 4
Probabilistic random walk after 111059 steps, saw 49463 distinct states, run finished after 3007 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 772 rows 949 cols
[2024-05-25 21:44:45] [INFO ] Computed 280 invariants in 21 ms
[2024-05-25 21:44:45] [INFO ] State equation strengthened by 444 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 444/531 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 371/902 variables, 195/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 47/949 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/949 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 772/1721 variables, 949/1229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1721 variables, 444/1673 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1721 variables, 0/1673 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1721 variables, 0/1673 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1721/1721 variables, and 1673 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1539 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 949/949 constraints, ReadFeed: 444/444 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 444/531 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 371/902 variables, 195/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 47/949 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 21:44:47] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/949 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/949 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 772/1721 variables, 949/1230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1721 variables, 444/1674 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1721 variables, 4/1678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1721 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1721 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1721/1721 variables, and 1678 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3641 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 949/949 constraints, ReadFeed: 444/444 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 5247ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA Parking-PT-864-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 1607 ms.
Support contains 41 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 772/772 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 949 transition count 767
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 944 transition count 767
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 944 transition count 761
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 938 transition count 761
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 934 transition count 757
Free-agglomeration rule applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 47 place count 934 transition count 740
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 64 place count 917 transition count 740
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 917 transition count 739
Applied a total of 65 rules in 253 ms. Remains 917 /949 variables (removed 32) and now considering 739/772 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 917/949 places, 739/772 transitions.
RANDOM walk for 40000 steps (133 resets) in 671 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 649 ms. (61 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 206761 steps, run timeout after 3028 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 206761 steps, saw 177237 distinct states, run finished after 3029 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 739 rows 917 cols
[2024-05-25 21:44:55] [INFO ] Computed 280 invariants in 25 ms
[2024-05-25 21:44:55] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/269 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 600/869 variables, 232/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/917 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/917 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 739/1656 variables, 917/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1656 variables, 479/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1656 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1656/1656 variables, and 1676 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 917/917 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/269 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 600/869 variables, 232/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/917 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/917 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 739/1656 variables, 917/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1656 variables, 479/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 1/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1656 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1656 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1656/1656 variables, and 1677 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 917/917 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2554ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4202 steps, including 63 resets, run visited all 1 properties in 71 ms. (steps per millisecond=59 )
FORMULA Parking-PT-864-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 80 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 51249 ms.

BK_STOP 1716673498291

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="Parking-PT-864"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Parking-PT-864, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654406900103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-864.tgz
mv Parking-PT-864 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;