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 S_AutoFlight-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r081-csrt-149441064100169
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494887354834

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: AutoFlight_PT_01a
(NrP: 32 NrTr: 30 NrArc: 100)

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

net check time: 0m 0.000sec

init dd package: 0m 1.227sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 70 (7.0e+01) #states 253



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

checking: EF [1<=p20]
normalized: E [true U 1<=p20]

abstracting: (1<=p20)
states: 12
-> the formula is TRUE

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

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

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

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[~ [1<=p31] & ~ [2<=p22]]]]
normalized: ~ [E [true U [~ [2<=p22] & ~ [1<=p31]]]]

abstracting: (1<=p31)
states: 234
abstracting: (2<=p22)
states: 0
-> the formula is FALSE

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[p19<=p22 | 3<=p22]]
normalized: ~ [E [true U ~ [[p19<=p22 | 3<=p22]]]]

abstracting: (3<=p22)
states: 0
abstracting: (p19<=p22)
states: 241
-> the formula is FALSE

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [~ [2<=p20]] | ~ [~ [p7<=p2]]]]
normalized: ~ [E [true U ~ [[2<=p20 | p7<=p2]]]]

abstracting: (p7<=p2)
states: 65
abstracting: (2<=p20)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[2<=p9 | [~ [1<=p17] & ~ [p28<=p24]]]]
normalized: E [true U [[~ [p28<=p24] & ~ [1<=p17]] | 2<=p9]]

abstracting: (2<=p9)
states: 0
abstracting: (1<=p17)
states: 174
abstracting: (p28<=p24)
states: 235
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[1<=p0 & [~ [2<=p16] & [p18<=p25 & 1<=p29]]]]
normalized: ~ [E [true U ~ [[[[p18<=p25 & 1<=p29] & ~ [2<=p16]] & 1<=p0]]]]

abstracting: (1<=p0)
states: 1
abstracting: (2<=p16)
states: 0
abstracting: (1<=p29)
states: 162
abstracting: (p18<=p25)
states: 241
-> the formula is FALSE

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[p11<=p0 & 1<=p29] & ~ [p3<=p14]]]]
normalized: ~ [E [true U [~ [p3<=p14] & [p11<=p0 & 1<=p29]]]]

abstracting: (1<=p29)
states: 162
abstracting: (p11<=p0)
states: 241
abstracting: (p3<=p14)
states: 165
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[~ [[1<=p19 & p14<=p27]] | ~ [[p13<=p0 & 2<=p26]]]]
normalized: ~ [E [true U ~ [[~ [[p13<=p0 & 2<=p26]] | ~ [[1<=p19 & p14<=p27]]]]]]

abstracting: (p14<=p27)
states: 241
abstracting: (1<=p19)
states: 12
abstracting: (2<=p26)
states: 0
abstracting: (p13<=p0)
states: 241
-> the formula is TRUE

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [~ [3<=p21]] | [~ [3<=p20] | [p24<=p10 & p5<=p28]]]]
normalized: ~ [E [true U ~ [[[[p24<=p10 & p5<=p28] | ~ [3<=p20]] | 3<=p21]]]]

abstracting: (3<=p21)
states: 0
abstracting: (3<=p20)
states: 0
abstracting: (p5<=p28)
states: 191
abstracting: (p24<=p10)
states: 253
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[p22<=p8 & ~ [[p26<=p28 | p28<=p17]]]]
normalized: E [true U [~ [[p26<=p28 | p28<=p17]] & p22<=p8]]

abstracting: (p22<=p8)
states: 244
abstracting: (p28<=p17)
states: 253
abstracting: (p26<=p28)
states: 235
-> the formula is FALSE

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[2<=p10 | p22<=p4] | 2<=p7] | [~ [2<=p4] & ~ [1<=p4]]]]
normalized: ~ [E [true U ~ [[[~ [1<=p4] & ~ [2<=p4]] | [[2<=p10 | p22<=p4] | 2<=p7]]]]]

abstracting: (2<=p7)
states: 0
abstracting: (p22<=p4)
states: 241
abstracting: (2<=p10)
states: 0
abstracting: (2<=p4)
states: 0
abstracting: (1<=p4)
states: 92
-> the formula is TRUE

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[3<=p19 | p2<=p17] | [3<=p27 & 1<=p2]] | 2<=p1]]
normalized: E [true U [[[3<=p27 & 1<=p2] | [3<=p19 | p2<=p17]] | 2<=p1]]

abstracting: (2<=p1)
states: 0
abstracting: (p2<=p17)
states: 247
abstracting: (3<=p19)
states: 0
abstracting: (1<=p2)
states: 64
abstracting: (3<=p27)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[p15<=p7 & [[p22<=p23 & p24<=p31] & 2<=p1]]]
normalized: E [true U [[[p22<=p23 & p24<=p31] & 2<=p1] & p15<=p7]]

abstracting: (p15<=p7)
states: 253
abstracting: (2<=p1)
states: 0
abstracting: (p24<=p31)
states: 253
abstracting: (p22<=p23)
states: 235
-> the formula is FALSE

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[1<=p28 & [p7<=p30 & p10<=p31]] & ~ [[p1<=p3 & p27<=p11]]]]
normalized: ~ [E [true U ~ [[~ [[p1<=p3 & p27<=p11]] & [1<=p28 & [p7<=p30 & p10<=p31]]]]]]

abstracting: (p10<=p31)
states: 235
abstracting: (p7<=p30)
states: 19
abstracting: (1<=p28)
states: 18
abstracting: (p27<=p11)
states: 235
abstracting: (p1<=p3)
states: 159
-> the formula is FALSE

FORMULA AutoFlight-PT-01a-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[p8<=p5 & p18<=p9] & [p23<=p7 & 3<=p30]] & ~ [p26<=p8]]]
normalized: ~ [E [true U ~ [[~ [p26<=p8] & [[p23<=p7 & 3<=p30] & [p8<=p5 & p18<=p9]]]]]]

abstracting: (p18<=p9)
states: 247
abstracting: (p8<=p5)
states: 161
abstracting: (3<=p30)
states: 0
abstracting: (p23<=p7)
states: 253
abstracting: (p26<=p8)
states: 244
-> the formula is FALSE

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

MC time: 0m 0.000sec

totally nodes used: 7864(7.9e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5684 9454 15138
used/not used/entry size/cache size: 8108 67100756 16 1024MB
basic ops cache: hits/miss/sum: 7510 17022 24532
used/not used/entry size/cache size: 34807 16742409 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: 546 669 1215
used/not used/entry size/cache size: 669 2096483 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 67101000
1 7864
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.890sec


BK_STOP 1494887356751

--------------------
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.001sec


iterations count:283 (9), effective:41 (1)

initing FirstDep: 0m 0.000sec


iterations count:193 (6), effective:24 (0)

iterations count:165 (5), effective:23 (0)

iterations count:186 (6), effective:24 (0)

iterations count:55 (1), effective:2 (0)

iterations count:30 (1), effective:0 (0)

iterations count:198 (6), effective:27 (0)

iterations count:31 (1), effective:1 (0)

iterations count:30 (1), effective:0 (0)

iterations count:30 (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="S_AutoFlight-PT-01a"
export BK_EXAMINATION="ReachabilityCardinality"
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/S_AutoFlight-PT-01a.tgz
mv S_AutoFlight-PT-01a 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 S_AutoFlight-PT-01a, 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 r081-csrt-149441064100169"
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 ;