About the Execution of MARCIE for FlexibleBarrier-PT-04a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2198.710 | 1497.00 | 1009.00 | 20.20 | FFTTFFFTTTFFFFFF | 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)
.........
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is FlexibleBarrier-PT-04a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r181-blw3-149581023700003
=====================================================================
--------------------
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 FlexibleBarrier-PT-04a-CTLCardinality-0
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-1
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-15
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-2
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-3
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-4
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-5
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-6
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-7
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-8
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1495812882317
timeout --kill-after=10s --signal=SIGINT 1m for testing only
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: FlexibleBarrier_PT_04a
(NrP: 51 NrTr: 88 NrArc: 309)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 0.951sec
RS generation: 0m 0.006sec
-> reachability set: #nodes 281 (2.8e+02) #states 20,737 (4)
starting MCC model checker
--------------------------
checking: AG [AF [1<=p50]]
normalized: ~ [E [true U EG [~ [1<=p50]]]]
abstracting: (1<=p50)
states: 20,736 (4)
..
EG iterations: 2
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: ~ [~ [[2<=p3 | EF [2<=p14]]]]
normalized: [2<=p3 | E [true U 2<=p14]]
abstracting: (2<=p14)
states: 0
abstracting: (2<=p3)
states: 0
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [A [3<=p39 U 2<=p42]]
normalized: E [true U [~ [EG [~ [2<=p42]]] & ~ [E [~ [2<=p42] U [~ [3<=p39] & ~ [2<=p42]]]]]]
abstracting: (2<=p42)
states: 0
abstracting: (3<=p39)
states: 0
abstracting: (2<=p42)
states: 0
abstracting: (2<=p42)
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [~ [EX [p32<=p19]]]
normalized: E [true U ~ [EX [p32<=p19]]]
abstracting: (p32<=p19)
states: 19,153 (4)
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [AG [p20<=p16]]]
normalized: ~ [E [true U ~ [E [true U ~ [p20<=p16]]]]]
abstracting: (p20<=p16)
states: 19,009 (4)
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [AG [p20<=p27]]
normalized: E [true U ~ [E [true U ~ [p20<=p27]]]]
abstracting: (p20<=p27)
states: 19,153 (4)
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [EG [[p9<=p3 & p50<=p9]]]
normalized: E [true U EG [[p9<=p3 & p50<=p9]]]
abstracting: (p50<=p9)
states: 1,729 (3)
abstracting: (p9<=p3)
states: 19,009 (4)
..
EG iterations: 2
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AG [EF [p34<=p50]] & p4<=p9]
normalized: [~ [E [true U ~ [E [true U p34<=p50]]]] & p4<=p9]
abstracting: (p4<=p9)
states: 19,009 (4)
abstracting: (p34<=p50)
states: 20,737 (4)
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EG [EG [1<=p48]] | [EF [[2<=p43 | 3<=p36]] & ~ [~ [~ [1<=p28]]]]]
normalized: [[~ [1<=p28] & E [true U [2<=p43 | 3<=p36]]] | EG [EG [1<=p48]]]
abstracting: (1<=p48)
states: 1,728 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (3<=p36)
states: 0
abstracting: (2<=p43)
states: 0
abstracting: (1<=p28)
states: 1,728 (3)
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AX [[[[3<=p46 | 2<=p15] & 2<=p10] | EF [3<=p32]]]
normalized: ~ [EX [~ [[E [true U 3<=p32] | [2<=p10 & [3<=p46 | 2<=p15]]]]]]
abstracting: (2<=p15)
states: 0
abstracting: (3<=p46)
states: 0
abstracting: (2<=p10)
states: 0
abstracting: (3<=p32)
states: 0
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [[~ [~ [p34<=p12]] & AF [1<=p19]] | [EF [[3<=p1 & 3<=p29]] | AG [2<=p27]]]
normalized: [[~ [E [true U ~ [2<=p27]]] | E [true U [3<=p1 & 3<=p29]]] | [~ [EG [~ [1<=p19]]] & p34<=p12]]
abstracting: (p34<=p12)
states: 19,153 (4)
abstracting: (1<=p19)
states: 1,728 (3)
.
EG iterations: 1
abstracting: (3<=p29)
states: 0
abstracting: (3<=p1)
states: 0
abstracting: (2<=p27)
states: 0
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[[[2<=p43 | 3<=p36] & [1<=p49 & p48<=p5]] & EF [1<=p5]]]
normalized: E [true U [E [true U 1<=p5] & [[2<=p43 | 3<=p36] & [1<=p49 & p48<=p5]]]]
abstracting: (p48<=p5)
states: 19,153 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (3<=p36)
states: 0
abstracting: (2<=p43)
states: 0
abstracting: (1<=p5)
states: 1,728 (3)
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: [~ [E [p46<=p9 U 1<=p32]] | ~ [[EF [3<=p16] & EG [p26<=p11]]]]
normalized: [~ [[EG [p26<=p11] & E [true U 3<=p16]]] | ~ [E [p46<=p9 U 1<=p32]]]
abstracting: (1<=p32)
states: 1,728 (3)
abstracting: (p46<=p9)
states: 19,153 (4)
abstracting: (3<=p16)
states: 0
abstracting: (p26<=p11)
states: 19,153 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: [AG [[~ [p22<=p4] | [p4<=p29 | p14<=p19]]] & ~ [AG [3<=p39]]]
normalized: [E [true U ~ [3<=p39]] & ~ [E [true U ~ [[[p4<=p29 | p14<=p19] | ~ [p22<=p4]]]]]]
abstracting: (p22<=p4)
states: 19,153 (4)
abstracting: (p14<=p19)
states: 19,009 (4)
abstracting: (p4<=p29)
states: 19,153 (4)
abstracting: (3<=p39)
states: 0
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: [~ [~ [[~ [3<=p33] & [3<=p29 & p0<=p25]]]] | E [~ [1<=p18] U [p26<=p26 & 3<=p35]]]
normalized: [E [~ [1<=p18] U [p26<=p26 & 3<=p35]] | [[3<=p29 & p0<=p25] & ~ [3<=p33]]]
abstracting: (3<=p33)
states: 0
abstracting: (p0<=p25)
states: 20,736 (4)
abstracting: (3<=p29)
states: 0
abstracting: (3<=p35)
states: 0
abstracting: (p26<=p26)
states: 20,737 (4)
abstracting: (1<=p18)
states: 1,728 (3)
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [[~ [[[2<=p34 | 1<=p17] & [2<=p39 | p46<=p0]]] | [p19<=p18 & [[2<=p33 & p41<=p30] | ~ [p34<=p24]]]] & ~ [EF [[2<=p20 & p1<=p24]]]]
normalized: [~ [E [true U [2<=p20 & p1<=p24]]] & [[p19<=p18 & [~ [p34<=p24] | [2<=p33 & p41<=p30]]] | ~ [[[2<=p39 | p46<=p0] & [2<=p34 | 1<=p17]]]]]
abstracting: (1<=p17)
states: 1,728 (3)
abstracting: (2<=p34)
states: 0
abstracting: (p46<=p0)
states: 19,009 (4)
abstracting: (2<=p39)
states: 0
abstracting: (p41<=p30)
states: 19,153 (4)
abstracting: (2<=p33)
states: 0
abstracting: (p34<=p24)
states: 19,153 (4)
abstracting: (p19<=p18)
states: 19,009 (4)
abstracting: (p1<=p24)
states: 19,153 (4)
abstracting: (2<=p20)
states: 0
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
totally nodes used: 130310(1.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 119143 168609 287752
used/not used/entry size/cache size: 151585 66957279 16 1024MB
basic ops cache: hits/miss/sum: 129808 207568 337376
used/not used/entry size/cache size: 442224 16334992 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 2242 2453 4695
used/not used/entry size/cache size: 2453 2094699 32 64MB
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 66978684
1 130050
2 130
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 1.471sec
BK_STOP 1495812883814
--------------------
content from stderr:
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
initing FirstDep: 0m 0.000sec
iterations count:1339 (15), effective:78 (0)
initing FirstDep: 0m 0.000sec
iterations count:88 (1), effective:0 (0)
iterations count:573 (6), effective:23 (0)
iterations count:615 (6), effective:24 (0)
iterations count:88 (1), effective:0 (0)
iterations count:88 (1), effective:0 (0)
iterations count:559 (6), effective:23 (0)
iterations count:619 (7), effective:23 (0)
iterations count:975 (11), effective:46 (0)
iterations count:88 (1), effective:0 (0)
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="FlexibleBarrier-PT-04a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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/FlexibleBarrier-PT-04a.tgz
mv FlexibleBarrier-PT-04a execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is FlexibleBarrier-PT-04a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r181-blw3-149581023700003"
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 ;