Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

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

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716919454929

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 18:04:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 18:04:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:04:17] [INFO ] Load time of PNML (sax parser for PT used): 458 ms
[2024-05-28 18:04:17] [INFO ] Transformed 966 places.
[2024-05-28 18:04:17] [INFO ] Transformed 5354 transitions.
[2024-05-28 18:04:17] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 640 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 10, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 10, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 18:04:17] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2024-05-28 18:04:17] [INFO ] Computed 62 invariants in 191 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 10, 1, 0] Max Struct:[+inf, +inf, 535, +inf, +inf, 130, +inf, +inf, 4, +inf, 1, 535, +inf, +inf, 10, +inf]
RANDOM walk for 10000 steps (2 resets) in 123 ms. (80 steps per ms)
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150007 steps (30 resets) in 568 ms. (263 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 10, 1, 1] Max Struct:[+inf, +inf, 535, +inf, +inf, 130, +inf, +inf, 4, +inf, 535, +inf, +inf, 10, +inf]
[2024-05-28 18:04:18] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-05-28 18:04:18] [INFO ] Invariant cache hit.
[2024-05-28 18:04:18] [INFO ] [Real]Absence check using 16 positive place invariants in 21 ms returned sat
[2024-05-28 18:04:18] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 15 ms returned unsat
[2024-05-28 18:04:18] [INFO ] [Real]Absence check using 16 positive place invariants in 34 ms returned sat
[2024-05-28 18:04:18] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 40 ms returned unsat
[2024-05-28 18:04:18] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-28 18:04:18] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 40 ms returned unsat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 33 ms returned unsat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 17 ms returned unsat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 42 ms returned unsat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 8 ms returned unsat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 29 ms returned unsat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-05-28 18:04:19] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 22 ms returned unsat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 44 ms returned unsat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 50 ms returned unsat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 21 ms returned unsat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 36 ms returned unsat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-28 18:04:20] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 52 ms returned sat
[2024-05-28 18:04:22] [INFO ] [Real]Absence check using state equation in 1849 ms returned sat
[2024-05-28 18:04:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:04:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 18:04:23] [INFO ] [Nat]Absence check using 16 positive and 46 generalized place invariants in 47 ms returned sat
[2024-05-28 18:04:27] [INFO ] [Nat]Absence check using state equation in 4390 ms returned sat
[2024-05-28 18:04:27] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 18:04:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 18:04:27] [INFO ] [Nat]Added 200 Read/Feed constraints in 380 ms returned unknown
[2024-05-28 18:04:28] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 18:04:28] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 51 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 10, 1, 1] Max Struct:[4, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 10, 10, 1]
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 962 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 872 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 184 place count 872 transition count 2434
Deduced a syphon composed of 120 places in 5 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 424 place count 752 transition count 2434
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 2 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 622 place count 653 transition count 2335
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 642 place count 653 transition count 2315
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 662 place count 633 transition count 2315
Applied a total of 662 rules in 582 ms. Remains 633 /966 variables (removed 333) and now considering 2315/2644 (removed 329) transitions.
Running 2311 sub problems to find dead transitions.
[2024-05-28 18:04:28] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
// Phase 1: matrix 2275 rows 633 cols
[2024-05-28 18:04:28] [INFO ] Computed 58 invariants in 105 ms
[2024-05-28 18:04:29] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
[2024-05-28 18:05:07] [INFO ] Deduced a trap composed of 23 places in 810 ms of which 62 ms to minimize.
SMT process timed out in 38441ms, After SMT, problems are : Problem set: 0 solved, 2311 unsolved
Search for dead transitions found 0 dead transitions in 38500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39139 ms. Remains : 633/966 places, 2315/2644 transitions.
[2024-05-28 18:05:07] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
[2024-05-28 18:05:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (75 resets) in 11967 ms. (83 steps per ms)
BEST_FIRST walk for 1000001 steps (21 resets) in 3725 ms. (268 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-28 18:05:23] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
[2024-05-28 18:05:23] [INFO ] Invariant cache hit.
[2024-05-28 18:05:23] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 18:05:23] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 31 ms returned sat
[2024-05-28 18:05:26] [INFO ] [Real]Absence check using state equation in 2944 ms returned sat
[2024-05-28 18:05:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:05:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 18:05:26] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 33 ms returned sat
[2024-05-28 18:05:37] [INFO ] [Nat]Absence check using state equation in 11002 ms returned sat
[2024-05-28 18:05:37] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 18:05:39] [INFO ] [Nat]Added 200 Read/Feed constraints in 1754 ms returned sat
[2024-05-28 18:05:39] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 2 ms to minimize.
[2024-05-28 18:05:39] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:05:40] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:05:41] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-05-28 18:05:41] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-05-28 18:05:41] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:05:42] [INFO ] Deduced a trap composed of 261 places in 631 ms of which 6 ms to minimize.
[2024-05-28 18:05:44] [INFO ] Deduced a trap composed of 286 places in 732 ms of which 8 ms to minimize.
[2024-05-28 18:05:45] [INFO ] Deduced a trap composed of 263 places in 594 ms of which 5 ms to minimize.
[2024-05-28 18:05:49] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 10533 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 2315/2315 transitions.
Applied a total of 0 rules in 99 ms. Remains 633 /633 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 633/633 places, 2315/2315 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 2315/2315 transitions.
Applied a total of 0 rules in 122 ms. Remains 633 /633 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
[2024-05-28 18:05:50] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
[2024-05-28 18:05:50] [INFO ] Invariant cache hit.
[2024-05-28 18:05:51] [INFO ] Implicit Places using invariants in 1591 ms returned [66, 145, 180, 223, 305, 342, 364, 436, 474, 553]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1601 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 623/633 places, 2315/2315 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 617 transition count 2309
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 617 transition count 2309
Applied a total of 12 rules in 102 ms. Remains 617 /623 variables (removed 6) and now considering 2309/2315 (removed 6) transitions.
[2024-05-28 18:05:51] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
// Phase 1: matrix 2269 rows 617 cols
[2024-05-28 18:05:52] [INFO ] Computed 48 invariants in 83 ms
[2024-05-28 18:05:53] [INFO ] Implicit Places using invariants in 1146 ms returned []
[2024-05-28 18:05:53] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 18:05:53] [INFO ] Invariant cache hit.
[2024-05-28 18:05:54] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 18:06:25] [INFO ] Performed 391/617 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 18:06:36] [INFO ] Implicit Places using invariants and state equation in 43566 ms returned []
Implicit Place search using SMT with State Equation took 44714 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 617/633 places, 2309/2315 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46542 ms. Remains : 617/633 places, 2309/2315 transitions.
[2024-05-28 18:06:36] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 18:06:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (71 resets) in 9696 ms. (103 steps per ms)
BEST_FIRST walk for 1000001 steps (20 resets) in 3380 ms. (295 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-28 18:06:49] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 18:06:49] [INFO ] Invariant cache hit.
[2024-05-28 18:06:49] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-28 18:06:49] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 36 ms returned sat
[2024-05-28 18:06:52] [INFO ] [Real]Absence check using state equation in 2555 ms returned sat
[2024-05-28 18:06:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:06:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 18:06:52] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 35 ms returned sat
[2024-05-28 18:06:57] [INFO ] [Nat]Absence check using state equation in 4759 ms returned sat
[2024-05-28 18:06:57] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 18:07:00] [INFO ] [Nat]Added 200 Read/Feed constraints in 2570 ms returned sat
[2024-05-28 18:07:00] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:07:01] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:07:02] [INFO ] Deduced a trap composed of 23 places in 613 ms of which 5 ms to minimize.
[2024-05-28 18:07:03] [INFO ] Deduced a trap composed of 289 places in 498 ms of which 4 ms to minimize.
[2024-05-28 18:07:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3559 ms
[2024-05-28 18:07:03] [INFO ] Computed and/alt/rep : 985/2945/955 causal constraints (skipped 1310 transitions) in 272 ms.
[2024-05-28 18:07:11] [INFO ] Added : 57 causal constraints over 12 iterations in 7889 ms. Result :sat
Minimization took 4886 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 2309/2309 transitions.
Applied a total of 0 rules in 143 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 617/617 places, 2309/2309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 2309/2309 transitions.
Applied a total of 0 rules in 98 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2024-05-28 18:07:16] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 18:07:16] [INFO ] Invariant cache hit.
[2024-05-28 18:07:17] [INFO ] Implicit Places using invariants in 1145 ms returned []
[2024-05-28 18:07:17] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 18:07:17] [INFO ] Invariant cache hit.
[2024-05-28 18:07:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 18:07:49] [INFO ] Performed 380/617 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 18:08:01] [INFO ] Implicit Places using invariants and state equation in 43791 ms returned []
Implicit Place search using SMT with State Equation took 44942 ms to find 0 implicit places.
[2024-05-28 18:08:01] [INFO ] Redundant transitions in 138 ms returned []
Running 2305 sub problems to find dead transitions.
[2024-05-28 18:08:01] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 18:08:01] [INFO ] Invariant cache hit.
[2024-05-28 18:08:01] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-05-28 18:08:39] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-28 18:08:39] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-28 18:08:45] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/2886 variables, and 42 constraints, problems are : Problem set: 0 solved, 2305 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2305/2305 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-05-28 18:08:59] [INFO ] Deduced a trap composed of 51 places in 329 ms of which 3 ms to minimize.
[2024-05-28 18:08:59] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 2 ms to minimize.
[2024-05-28 18:09:00] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2024-05-28 18:09:00] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-05-28 18:09:00] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-05-28 18:09:00] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:09:00] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-05-28 18:09:01] [INFO ] Deduced a trap composed of 39 places in 442 ms of which 4 ms to minimize.
[2024-05-28 18:09:01] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-05-28 18:09:01] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-05-28 18:09:19] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/2886 variables, and 53 constraints, problems are : Problem set: 0 solved, 2305 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2305 constraints, Known Traps: 14/14 constraints]
After SMT, in 79093ms problems are : Problem set: 0 solved, 2305 unsolved
Search for dead transitions found 0 dead transitions in 79137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124347 ms. Remains : 617/617 places, 2309/2309 transitions.
RANDOM walk for 40000 steps (8 resets) in 1787 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 453 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 500 ms. (79 steps per ms) remains 2/2 properties
[2024-05-28 18:09:22] [INFO ] Flatten gal took : 584 ms
[2024-05-28 18:09:22] [INFO ] Flatten gal took : 277 ms
[2024-05-28 18:09:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13182649277743450602.gal : 88 ms
[2024-05-28 18:09:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10429792964881243291.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13182649277743450602.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10429792964881243291.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10429792964881243291.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 23
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :23 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 39
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :39 after 47
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :47 after 114
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :114 after 228
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :228 after 399
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :399 after 3798
Interrupted probabilistic random walk after 102366 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 2
Probabilistic random walk after 102366 steps, saw 79142 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-28 18:09:24] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 18:09:24] [INFO ] Invariant cache hit.
[2024-05-28 18:09:24] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 492/504 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/533 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 18:09:26] [INFO ] Deduced a trap composed of 57 places in 590 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 8 (OVERLAPS) 81/614 variables, 29/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/615 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2884/2886 variables, and 663 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 615/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 492/504 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/533 variables, 13/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/614 variables, 29/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 18:09:30] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 2 ms to minimize.
[2024-05-28 18:09:30] [INFO ] Deduced a trap composed of 50 places in 279 ms of which 2 ms to minimize.
[2024-05-28 18:09:31] [INFO ] Deduced a trap composed of 50 places in 288 ms of which 2 ms to minimize.
[2024-05-28 18:09:31] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 2 ms to minimize.
[2024-05-28 18:09:31] [INFO ] Deduced a trap composed of 50 places in 300 ms of which 2 ms to minimize.
[2024-05-28 18:09:31] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 5 ms to minimize.
[2024-05-28 18:09:31] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 1 ms to minimize.
[2024-05-28 18:09:31] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 8/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/615 variables, 1/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2884/2886 variables, and 671 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 615/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 10076ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 2309/2309 transitions.
Applied a total of 0 rules in 125 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
Running 2305 sub problems to find dead transitions.
[2024-05-28 18:09:35] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 18:09:35] [INFO ] Invariant cache hit.
[2024-05-28 18:09:35] [INFO ] State equation strengthened by 200 read => feed constraints.

BK_STOP 1716919786095

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="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 PolyORBLF-PT-S04J06T10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446800309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T10.tgz
mv PolyORBLF-PT-S04J06T10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;