About the Execution of LTSMin+red for PolyORBNT-PT-S10J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5121.079 | 162861.00 | 222954.00 | 128.00 | TFTTFTTTTFTTTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447200486.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 ltsminxred
Input is PolyORBNT-PT-S10J20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200486
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 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 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M 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 PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717261050946
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:57:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:57:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:57:33] [INFO ] Load time of PNML (sax parser for PT used): 646 ms
[2024-06-01 16:57:33] [INFO ] Transformed 474 places.
[2024-06-01 16:57:33] [INFO ] Transformed 11760 transitions.
[2024-06-01 16:57:33] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 886 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2239 resets) in 4436 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (44 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 89 ms. (44 steps per ms) remains 15/16 properties
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (10 resets) in 78 ms. (50 steps per ms) remains 13/15 properties
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (38 resets) in 43 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (48 resets) in 82 ms. (48 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (48 resets) in 88 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (41 resets) in 33 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (40 resets) in 57 ms. (69 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (40 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (40 resets) in 30 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (39 resets) in 153 ms. (26 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (40 resets) in 35 ms. (111 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (40 resets) in 39 ms. (100 steps per ms) remains 13/13 properties
[2024-06-01 16:57:35] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-06-01 16:57:35] [INFO ] Computed 72 invariants in 80 ms
[2024-06-01 16:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-10 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 30/30 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 22/52 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 0/52 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 15/469 variables, 15/67 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/67 constraints. Problems are: Problem set: 7 solved, 6 unsolved
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 5/474 variables, 5/72 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/72 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1641/2115 variables, 474/546 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2115 variables, 1/547 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2115 variables, 0/547 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2115 variables, 0/547 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
Problem PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 2115/2115 variables, and 547 constraints, problems are : Problem set: 11 solved, 2 unsolved in 2527 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 270/437 variables, 44/44 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 1/45 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/45 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/473 variables, 26/71 constraints. Problems are: Problem set: 12 solved, 1 unsolved
[2024-06-01 16:57:39] [INFO ] Deduced a trap composed of 24 places in 723 ms of which 36 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 1/72 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/72 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/73 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/73 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2115/2115 variables, and 547 constraints, problems are : Problem set: 12 solved, 1 unsolved in 2420 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 474/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 5720ms problems are : Problem set: 12 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 464 transition count 1629
Reduce places removed 21 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 24 rules applied. Total rules applied 55 place count 443 transition count 1626
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 440 transition count 1626
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 58 place count 440 transition count 1607
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 96 place count 421 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 420 transition count 1606
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 420 transition count 1606
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 418 transition count 1604
Applied a total of 102 rules in 438 ms. Remains 418 /474 variables (removed 56) and now considering 1604/1650 (removed 46) transitions.
Running 1593 sub problems to find dead transitions.
[2024-06-01 16:57:41] [INFO ] Flow matrix only has 1595 transitions (discarded 9 similar events)
// Phase 1: matrix 1595 rows 418 cols
[2024-06-01 16:57:41] [INFO ] Computed 62 invariants in 39 ms
[2024-06-01 16:57:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
[2024-06-01 16:58:07] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 (/ 2.0 3.0))
(s4 (/ 3.0 4.0))
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 (/ 9.0 4.0))
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 4.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 4.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s62 0.0)
(s63 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 408/2013 variables, and 53 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/418 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1593/593 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
[2024-06-01 16:58:18] [INFO ] Deduced a trap composed of 18 places in 349 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/2013 variables, and 54 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/418 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/593 constraints, Known Traps: 2/2 constraints]
After SMT, in 54537ms problems are : Problem set: 0 solved, 1593 unsolved
Search for dead transitions found 0 dead transitions in 54589ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55070 ms. Remains : 418/474 places, 1604/1650 transitions.
RANDOM walk for 40000 steps (2853 resets) in 1051 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (385 resets) in 330 ms. (120 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 257374 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 257374 steps, saw 42563 distinct states, run finished after 3005 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 16:58:39] [INFO ] Flow matrix only has 1595 transitions (discarded 9 similar events)
[2024-06-01 16:58:39] [INFO ] Invariant cache hit.
[2024-06-01 16:58:39] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 245/282 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/366 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/415 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/417 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1595/2012 variables, 417/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2012 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2012 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2013 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2013 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2013 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2013/2013 variables, and 481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 418/418 constraints, ReadFeed: 1/1 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 245/282 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/366 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/415 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:58:41] [INFO ] Deduced a trap composed of 14 places in 396 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/417 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1595/2012 variables, 417/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2012 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2012 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2012 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2013/2013 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10986 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 418/418 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 11864ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1604/1604 transitions.
Applied a total of 0 rules in 92 ms. Remains 418 /418 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 418/418 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1604/1604 transitions.
Applied a total of 0 rules in 62 ms. Remains 418 /418 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-06-01 16:58:51] [INFO ] Flow matrix only has 1595 transitions (discarded 9 similar events)
[2024-06-01 16:58:51] [INFO ] Invariant cache hit.
[2024-06-01 16:58:52] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2024-06-01 16:58:53] [INFO ] Flow matrix only has 1595 transitions (discarded 9 similar events)
[2024-06-01 16:58:53] [INFO ] Invariant cache hit.
[2024-06-01 16:58:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:58:58] [INFO ] Implicit Places using invariants and state equation in 5339 ms returned []
Implicit Place search using SMT with State Equation took 6403 ms to find 0 implicit places.
[2024-06-01 16:58:58] [INFO ] Redundant transitions in 129 ms returned []
Running 1593 sub problems to find dead transitions.
[2024-06-01 16:58:58] [INFO ] Flow matrix only has 1595 transitions (discarded 9 similar events)
[2024-06-01 16:58:58] [INFO ] Invariant cache hit.
[2024-06-01 16:58:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
Problem TDEAD403 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1375 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 (/ 2.0 3.0))
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 2.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 4.0)
(s41 0.0)
(s42 (/ 1.0 3.0))
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 4.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 (/ 2.0 3.0))
(s155 0.0)
(s156 4.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 4.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 (/ 2.0 3.0))
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 4.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 timeout
0.0)
(s275 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/409 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1527 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/2013 variables, and 53 constraints, problems are : Problem set: 66 solved, 1527 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/418 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1593/593 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 1527 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 43/43 constraints. Problems are: Problem set: 66 solved, 1527 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 9/52 constraints. Problems are: Problem set: 66 solved, 1527 unsolved
[2024-06-01 16:59:44] [INFO ] Deduced a trap composed of 18 places in 376 ms of which 5 ms to minimize.
[2024-06-01 16:59:45] [INFO ] Deduced a trap composed of 14 places in 335 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 1527 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/54 constraints. Problems are: Problem set: 66 solved, 1527 unsolved
At refinement iteration 4 (OVERLAPS) 1/409 variables, 1/55 constraints. Problems are: Problem set: 66 solved, 1527 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/2013 variables, and 55 constraints, problems are : Problem set: 66 solved, 1527 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/418 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 934/593 constraints, Known Traps: 2/2 constraints]
After SMT, in 74524ms problems are : Problem set: 66 solved, 1527 unsolved
Search for dead transitions found 66 dead transitions in 74543ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 418/418 places, 1538/1604 transitions.
Applied a total of 0 rules in 37 ms. Remains 418 /418 variables (removed 0) and now considering 1538/1538 (removed 0) transitions.
[2024-06-01 17:00:13] [INFO ] Redundant transitions in 76 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81291 ms. Remains : 418/418 places, 1538/1604 transitions.
RANDOM walk for 40000 steps (2762 resets) in 1567 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32914 steps (314 resets) in 185 ms. (176 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 161095 ms.
ITS solved all properties within timeout
BK_STOP 1717261213807
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-PT-S10J20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447200486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;