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-2979
Executing tool marcie
Input is AutoFlight-PT-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r209su-blw3-146445825400259
=====================================================================

--------------------
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 AutoFlight-PT-06a-ReachabilityCardinality-0
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-1
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-15
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-2
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-3
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-4
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-5
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-6
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-7
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-8
FORMULA_NAME AutoFlight-PT-06a-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1464685246799


Marcie rev. 8535M (built: crohr on 2016-04-27)
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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: AutoFlight_PT_06a
(NrP: 157 NrTr: 155 NrArc: 500)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

init dd package: 0m 3.683sec


RS generation: 0m 0.476sec


-> reachability set: #nodes 1976 (2.0e+03) #states 1,371,919,681 (9)



starting MCC model checker
--------------------------

checking: AG [~ [~ [~ [3<=p144]]]]
normalized: ~ [E [true U 3<=p144]]

abstracting: (3<=p144) states: 0
-> the formula is TRUE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=p39]
normalized: E [true U 2<=p39]

abstracting: (2<=p39) states: 0
-> the formula is FALSE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p110<=p96]
normalized: ~ [E [true U ~ [p110<=p96]]]

abstracting: (p110<=p96) states: 1,368,933,697 (9)
-> the formula is FALSE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.216sec

checking: EF [~ [[~ [2<=p153] & p109<=p54]]]
normalized: E [true U ~ [[p109<=p54 & ~ [2<=p153]]]]

abstracting: (2<=p153) states: 0
abstracting: (p109<=p54) states: 1,371,919,681 (9)
-> the formula is FALSE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[1<=p116 & p126<=p88]]
normalized: E [true U [1<=p116 & p126<=p88]]

abstracting: (p126<=p88) states: 1,337,907,457 (9)
abstracting: (1<=p116) states: 22,674,816 (7)
-> the formula is TRUE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: AG [[[~ [p35<=p138] | ~ [1<=p42]] | ~ [~ [3<=p116]]]]
normalized: ~ [E [true U ~ [[3<=p116 | [~ [p35<=p138] | ~ [1<=p42]]]]]]

abstracting: (1<=p42) states: 1,371,919,680 (9)
abstracting: (p35<=p138) states: 34,012,225 (7)
abstracting: (3<=p116) states: 0
-> the formula is FALSE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.204sec

checking: AG [~ [[[2<=p128 & 3<=p150] | [3<=p61 & p55<=p130]]]]
normalized: ~ [E [true U [[2<=p128 & 3<=p150] | [3<=p61 & p55<=p130]]]]

abstracting: (p55<=p130) states: 1,286,889,121 (9)
abstracting: (3<=p61) states: 0
abstracting: (3<=p150) states: 0
abstracting: (2<=p128) states: 0
-> the formula is TRUE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[~ [[p139<=p118 | p114<=p71]] | ~ [3<=p5]]]
normalized: ~ [E [true U ~ [[~ [3<=p5] | ~ [[p139<=p118 | p114<=p71]]]]]]

abstracting: (p114<=p71) states: 1,361,841,985 (9)
abstracting: (p139<=p118) states: 1,371,919,681 (9)
abstracting: (3<=p5) states: 0
-> the formula is TRUE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[[3<=p101 | [1<=p124 & p115<=p50]] | ~ [1<=p90]]]
normalized: ~ [E [true U ~ [[~ [1<=p90] | [3<=p101 | [1<=p124 & p115<=p50]]]]]]

abstracting: (p115<=p50) states: 1,364,361,409 (9)
abstracting: (1<=p124) states: 1,201,858,560 (9)
abstracting: (3<=p101) states: 0
abstracting: (1<=p90) states: 22,674,816 (7)
-> the formula is TRUE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [~ [[[2<=p126 | p140<=p31] | p15<=p68]]]
normalized: E [true U ~ [[p15<=p68 | [2<=p126 | p140<=p31]]]]

abstracting: (p140<=p31) states: 1,349,244,865 (9)
abstracting: (2<=p126) states: 0
abstracting: (p15<=p68) states: 901,798,273 (8)
-> the formula is TRUE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.861sec

checking: AG [~ [[~ [p43<=p45] & [1<=p44 & p154<=p86]]]]
normalized: ~ [E [true U [[1<=p44 & p154<=p86] & ~ [p43<=p45]]]]

abstracting: (p43<=p45) states: 1,371,919,681 (9)
abstracting: (p154<=p86) states: 174,540,097 (8)
abstracting: (1<=p44) states: 685,959,840 (8)
-> the formula is TRUE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [[~ [[p62<=p154 | 3<=p60]] & ~ [[1<=p38 & 1<=p83]]]]
normalized: E [true U [~ [[1<=p38 & 1<=p83]] & ~ [[p62<=p154 | 3<=p60]]]]

abstracting: (3<=p60) states: 0
abstracting: (p62<=p154) states: 1,371,919,681 (9)
abstracting: (1<=p83) states: 2,985,984 (6)
abstracting: (1<=p38) states: 479,592,576 (8)
-> the formula is FALSE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [~ [[~ [p74<=p144] & [p41<=p98 & p88<=p43]]]]
normalized: ~ [E [true U [[p41<=p98 & p88<=p43] & ~ [p74<=p144]]]]

abstracting: (p74<=p144) states: 1,368,933,697 (9)
abstracting: (p88<=p43) states: 1,366,880,833 (9)
abstracting: (p41<=p98) states: 896,806,081 (8)
-> the formula is FALSE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.538sec

checking: EF [[[[3<=p30 | 2<=p94] & ~ [2<=p119]] | ~ [[p12<=p135 | 1<=p25]]]]
normalized: E [true U [~ [[p12<=p135 | 1<=p25]] | [~ [2<=p119] & [3<=p30 | 2<=p94]]]]

abstracting: (2<=p94) states: 0
abstracting: (3<=p30) states: 0
abstracting: (2<=p119) states: 0
abstracting: (1<=p25) states: 470,308,032 (8)
abstracting: (p12<=p135) states: 946,354,753 (8)
-> the formula is TRUE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.759sec

checking: EF [[~ [~ [p26<=p127]] & [[1<=p135 | 1<=p77] & [p45<=p109 | 1<=p19]]]]
normalized: E [true U [p26<=p127 & [[p45<=p109 | 1<=p19] & [1<=p135 | 1<=p77]]]]

abstracting: (1<=p77) states: 2,985,984 (6)
abstracting: (1<=p135) states: 34,012,224 (7)
abstracting: (1<=p19) states: 434,662,848 (8)
abstracting: (p45<=p109) states: 2,985,985 (6)
abstracting: (p26<=p127) states: 951,953,473 (8)
-> the formula is TRUE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.019sec

checking: EF [[[[p96<=p61 & p139<=p50] | [1<=p16 & p71<=p37]] & [p45<=p24 & [2<=p63 | 3<=p20]]]]
normalized: E [true U [[p45<=p24 & [2<=p63 | 3<=p20]] & [[1<=p16 & p71<=p37] | [p96<=p61 & p139<=p50]]]]

abstracting: (p139<=p50) states: 1,354,913,569 (9)
abstracting: (p96<=p61) states: 1,368,933,697 (9)
abstracting: (p71<=p37) states: 1,368,933,697 (9)
abstracting: (1<=p16) states: 428,690,880 (8)
abstracting: (3<=p20) states: 0
abstracting: (2<=p63) states: 0
abstracting: (p45<=p24) states: 473,294,017 (8)
-> the formula is FALSE

FORMULA AutoFlight-PT-06a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec


Total processing time: 0m12.379sec


BK_STOP 1464685259213

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

check for maximal unmarked siphon
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.001sec

874 943 1417 1597 1453 1966
iterations count:6208 (40), effective:565 (3)

initing FirstDep: 0m 0.000sec

1424
iterations count:1802 (11), effective:129 (0)
2628
iterations count:1793 (11), effective:127 (0)
1745 13221 17414
iterations count:3042 (19), effective:241 (1)
1721
iterations count:1807 (11), effective:131 (0)
1720 10092 11145
iterations count:3909 (25), effective:334 (2)
3395 12171 14381
iterations count:3189 (20), effective:249 (1)
1666 3789 9763 24993
iterations count:4626 (29), effective:387 (2)

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="AutoFlight-PT-06a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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/AutoFlight-PT-06a.tgz
mv AutoFlight-PT-06a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is AutoFlight-PT-06a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r209su-blw3-146445825400259"
echo "====================================================================="
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;