About the Execution of Irma.full for RobotManipulation-PT-00010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7967.240 | 22540.00 | 21620.00 | 646.90 | FFTFFFTFFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is RobotManipulation-PT-00010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-152685548800024
=====================================================================
--------------------
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 RobotManipulation-PT-00010-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526895818342
BK_STOP 1526895840882
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using RobotManipulation-PT-00010 as instance name.
Using RobotManipulation as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 14256, 'Memory': 7616.36, 'Tool': 'marcie'}, {'Time': 21670, 'Memory': 611.45, 'Tool': 'lola'}, {'Time': 23281, 'Memory': 407.57, 'Tool': 'gspn'}, {'Time': 30768, 'Memory': 695.85, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.5200617283950617x far from the best tool marcie.
CTLCardinality marcie RobotManipulation-PT-00010...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
check for maximal unmarked siphon
ok
Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6
parse successfull
net created successfully
Net: RobotManipulation_PT_00010
(NrP: 15 NrTr: 11 NrArc: 34)
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
net check time: 0m 0.000sec
init dd package: 0m 1.713sec
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
parse successfull
net created successfully
Net: RobotManipulation_PT_00010
(NrP: 15 NrTr: 11 NrArc: 34)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
net check time: 0m 0.000sec
init dd package: 0m 5.451sec
initing FirstDep: 0m 0.000sec
iterations count:853 (77), effective:201 (18)
RS generation: 0m 0.099sec
-> reachability set: #nodes 9437 (9.4e+03) #states 20,030,010 (7)
starting MCC model checker
--------------------------
initing FirstDep: 0m 0.000sec
checking: AG [2<=p_i1]
normalized: ~ [E [true U ~ [2<=p_i1]]]
abstracting: (2<=p_i1)
states: 13,813,800 (7)
iterations count:51 (4), effective:20 (1)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.146sec
checking: AG [3<=r_stopped]
normalized: ~ [E [true U ~ [3<=r_stopped]]]
abstracting: (3<=r_stopped)
states: 9,493,825 (6)
iterations count:119 (10), effective:36 (3)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.436sec
checking: AG [p_m<=access]
normalized: ~ [E [true U ~ [p_m<=access]]]
abstracting: (p_m<=access)
states: 15,145,130 (7)
iterations count:345 (31), effective:102 (9)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.118sec
checking: ~ [EF [[~ [3<=r_stopped] & ~ [p_rdy<=p_i1]]]]
normalized: ~ [E [true U [~ [p_rdy<=p_i1] & ~ [3<=r_stopped]]]]
abstracting: (3<=r_stopped)
states: 9,493,825 (6)
abstracting: (p_rdy<=p_i1)
states: 14,254,526 (7)
iterations count:159 (14), effective:46 (4)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.161sec
checking: EF [AG [[moved<=r_moving & 1<=access]]]
normalized: E [true U ~ [E [true U ~ [[moved<=r_moving & 1<=access]]]]]
iterations count:352 (32), effective:111 (10)
abstracting: (1<=access)
states: 20,008,758 (7)
abstracting: (moved<=r_moving)
states: 11,823,526 (7)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.147sec
checking: [~ [~ [~ [[2<=initialize | 1<=p_rel]]]] & AX [EG [initialized<=p_rdy]]]
normalized: [~ [EX [~ [EG [initialized<=p_rdy]]]] & ~ [[2<=initialize | 1<=p_rel]]]
abstracting: (1<=p_rel)
states: 13,813,800 (7)
abstracting: (2<=initialize)
states: 13,813,800 (7)
abstracting: (initialized<=p_rdy)
states: 11,823,526 (7)
...........................................
EG iterations: 43
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.563sec
checking: AG [[EF [3<=p_rdy] | [~ [moved<=r_stopped] & ~ [1<=off]]]]
normalized: ~ [E [true U ~ [[[~ [1<=off] & ~ [moved<=r_stopped]] | E [true U 3<=p_rdy]]]]]
abstracting: (3<=p_rdy)
states: 6,249,100 (6)
iterations count:131 (11), effective:27 (2)
abstracting: (moved<=r_stopped)
states: 13,495,768 (7)
abstracting: (1<=off)
states: 16,033,875 (7)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.123sec
checking: EF [~ [[[2<=p_i2 | p_i2<=p_i1] | ~ [p_m<=off]]]]
normalized: E [true U ~ [[~ [p_m<=off] | [2<=p_i2 | p_i2<=p_i1]]]]
abstracting: (p_i2<=p_i1)
states: 7,790,068 (6)
abstracting: (2<=p_i2)
states: 17,596,150 (7)
abstracting: (p_m<=off)
states: 5,858,281 (6)
iterations count:533 (48), effective:141 (12)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.102sec
checking: ~ [[EF [[initialized<=p_rel | 2<=off]] & EF [[1<=move & 2<=p_rel]]]]
normalized: ~ [[E [true U [1<=move & 2<=p_rel]] & E [true U [initialized<=p_rel | 2<=off]]]]
abstracting: (2<=off)
states: 12,498,200 (7)
abstracting: (initialized<=p_rel)
states: 11,823,526 (7)
iterations count:27 (2), effective:4 (0)
abstracting: (2<=p_rel)
states: 9,373,650 (6)
abstracting: (1<=move)
states: 13,813,800 (7)
iterations count:131 (11), effective:27 (2)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.470sec
checking: [r_moving<=r_moving & EG [[[2<=off | r_active<=p_rdy] | 1<=move]]]
normalized: [r_moving<=r_moving & EG [[1<=move | [2<=off | r_active<=p_rdy]]]]
abstracting: (r_active<=p_rdy)
states: 2,002 (3)
abstracting: (2<=off)
states: 12,498,200 (7)
abstracting: (1<=move)
states: 13,813,800 (7)
.......................
EG iterations: 23
abstracting: (r_moving<=r_moving)
states: 20,030,010 (7)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.547sec
checking: AG [[~ [[off<=move | r_stopped<=p_rel]] | EG [r_moving<=r_stopped]]]
normalized: ~ [E [true U ~ [[EG [r_moving<=r_stopped] | ~ [[off<=move | r_stopped<=p_rel]]]]]]
abstracting: (r_stopped<=p_rel)
states: 9,392,526 (6)
abstracting: (off<=move)
states: 9,392,526 (6)
abstracting: (r_moving<=r_stopped)
states: 13,495,768 (7)
.......................
EG iterations: 23
iterations count:599 (54), effective:184 (16)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.600sec
checking: E [[[1<=r_stopped & 3<=p_rel] | [3<=p_sc | 3<=p_sc]] U off<=moved]
normalized: E [[[3<=p_sc | 3<=p_sc] | [1<=r_stopped & 3<=p_rel]] U off<=moved]
abstracting: (off<=moved)
states: 9,392,526 (6)
abstracting: (3<=p_rel)
states: 6,249,100 (6)
abstracting: (1<=r_stopped)
states: 16,033,875 (7)
abstracting: (3<=p_sc)
states: 6,249,100 (6)
abstracting: (3<=p_sc)
states: 6,249,100 (6)
iterations count:86 (7), effective:33 (3)
-> the formula is TRUE
iterations count:191 (17), effective:67 (6)
FORMULA RobotManipulation-PT-00010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.516sec
checking: AG [[[[r_stopped<=p_i1 | p_m<=p_i1] | ~ [3<=r_active]] & AF [moved<=r_stopped]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [moved<=r_stopped]]] & [~ [3<=r_active] | [r_stopped<=p_i1 | p_m<=p_i1]]]]]]
abstracting: (p_m<=p_i1)
states: 6,628,336 (6)
abstracting: (r_stopped<=p_i1)
states: 13,123,110 (7)
abstracting: (3<=r_active)
states: 20,022,124 (7)
abstracting: (moved<=r_stopped)
states: 13,495,768 (7)
......................
EG iterations: 22
iterations count:45 (4), effective:17 (1)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.450sec
checking: A [[[p_m<=p_sc | 2<=r_moving] & [access<=r_moving & 1<=r_stopped]] U AF [initialized<=p_sc]]
normalized: [~ [EG [EG [~ [initialized<=p_sc]]]] & ~ [E [EG [~ [initialized<=p_sc]] U [~ [[[access<=r_moving & 1<=r_stopped] & [p_m<=p_sc | 2<=r_moving]]] & EG [~ [initialized<=p_sc]]]]]]
abstracting: (initialized<=p_sc)
states: 11,823,526 (7)
.
EG iterations: 1
abstracting: (2<=r_moving)
states: 9,373,650 (6)
abstracting: (p_m<=p_sc)
states: 4,088,656 (6)
abstracting: (1<=r_stopped)
states: 16,033,875 (7)
abstracting: (access<=r_moving)
states: 1,400,256 (6)
abstracting: (initialized<=p_sc)
states: 11,823,526 (7)
.
EG iterations: 1
abstracting: (initialized<=p_sc)
states: 11,823,526 (7)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.396sec
checking: [[EG [r_active<=p_m] | [[[2<=p_rdy & p_rdy<=p_rel] & access<=initialized] | AX [2<=initialized]]] & [~ [EF [1<=initialized]] | EF [~ [1<=initialize]]]]
normalized: [[E [true U ~ [1<=initialize]] | ~ [E [true U 1<=initialized]]] & [[~ [EX [~ [2<=initialized]]] | [access<=initialized & [2<=p_rdy & p_rdy<=p_rel]]] | EG [r_active<=p_m]]]
abstracting: (r_active<=p_m)
states: 1,108,536 (6)
.......................
EG iterations: 23
abstracting: (p_rdy<=p_rel)
states: 11,823,526 (7)
abstracting: (2<=p_rdy)
states: 9,373,650 (6)
abstracting: (access<=initialized)
states: 106,260 (5)
abstracting: (2<=initialized)
states: 9,373,650 (6)
.abstracting: (1<=initialized)
states: 13,813,800 (7)
iterations count:51 (4), effective:9 (0)
abstracting: (1<=initialize)
states: 16,921,905 (7)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.591sec
iterations count:193 (17), effective:49 (4)
iterations count:51 (4), effective:20 (1)
checking: [[AG [2<=p_i1] & E [move<=p_rdy U initialized<=moved]] & [[[~ [p_rdy<=p_sc] | ~ [1<=p_i2]] | [[3<=r_active & 1<=access] | [r_active<=p_sc & 1<=initialize]]] & moved<=p_i2]]
normalized: [[moved<=p_i2 & [[[r_active<=p_sc & 1<=initialize] | [3<=r_active & 1<=access]] | [~ [1<=p_i2] | ~ [p_rdy<=p_sc]]]] & [E [move<=p_rdy U initialized<=moved] & ~ [E [true U ~ [2<=p_i1]]]]]
abstracting: (2<=p_i1)
states: 13,813,800 (7)
iterations count:117 (10), effective:36 (3)
abstracting: (initialized<=moved)
states: 11,823,526 (7)
abstracting: (move<=p_rdy)
states: 11,823,526 (7)
abstracting: (p_rdy<=p_sc)
states: 11,823,526 (7)
abstracting: (1<=p_i2)
states: 19,141,980 (7)
abstracting: (1<=access)
states: 20,008,758 (7)
abstracting: (3<=r_active)
states: 20,022,124 (7)
abstracting: (1<=initialize)
states: 16,921,905 (7)
abstracting: (r_active<=p_sc)
states: 2,002 (3)
abstracting: (moved<=p_i2)
states: 16,604,445 (7)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.999sec
totally nodes used: 1594548 (1.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9124223 3779117 12903340
used/not used/entry size/cache size: 4765334 62343530 16 1024MB
basic ops cache: hits/miss/sum: 3929902 2225844 6155746
used/not used/entry size/cache size: 3323233 13453983 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 486903 241394 728297
used/not used/entry size/cache size: 238076 8150532 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 65759694
1 1264958
2 55648
3 8283
4 5711
5 3477
6 2256
7 1330
8 1278
9 833
>= 10 5396
Total processing time: 0m16.843sec
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="RobotManipulation-PT-00010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00010.tgz
mv RobotManipulation-PT-00010 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is RobotManipulation-PT-00010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-152685548800024"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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
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 ;