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 S_Parking-PT-104, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444131101168
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464953315287


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: Parking_PT_104
(NrP: 65 NrTr: 97 NrArc: 284)

net check time: 0m 0.000sec

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

init dd package: 0m 3.852sec


RS generation: 0m 0.043sec


-> reachability set: #nodes 330 (3.3e+02) #states 31,745 (4)



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

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

abstracting: (3<=p20) states: 0
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p18) states: 768
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

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

abstracting: (1<=p35) states: 512
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.195sec

checking: EF [~ [p26<=p43]]
normalized: E [true U ~ [p26<=p43]]

abstracting: (p26<=p43) states: 30,977 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.102sec

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

abstracting: (p17<=p36) states: 30,977 (4)
abstracting: (2<=p58) states: 0
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[p11<=p0 | p45<=p39]]
normalized: ~ [E [true U ~ [[p11<=p0 | p45<=p39]]]]

abstracting: (p45<=p39) states: 31,233 (4)
abstracting: (p11<=p0) states: 15,873 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.220sec

checking: AG [~ [[~ [p61<=p31] | [p47<=p26 & 3<=p25]]]]
normalized: ~ [E [true U [[p47<=p26 & 3<=p25] | ~ [p61<=p31]]]]

abstracting: (p61<=p31) states: 25,345 (4)
abstracting: (3<=p25) states: 0
abstracting: (p47<=p26) states: 30,721 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.109sec

checking: EF [~ [[[p23<=p48 | p63<=p17] | 2<=p54]]]
normalized: E [true U ~ [[2<=p54 | [p23<=p48 | p63<=p17]]]]

abstracting: (p63<=p17) states: 22,273 (4)
abstracting: (p23<=p48) states: 31,745 (4)
abstracting: (2<=p54) states: 0
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[p17<=p12 | [~ [p32<=p12] & ~ [p61<=p19]]]]
normalized: ~ [E [true U ~ [[p17<=p12 | [~ [p61<=p19] & ~ [p32<=p12]]]]]]

abstracting: (p32<=p12) states: 18,689 (4)
abstracting: (p61<=p19) states: 25,345 (4)
abstracting: (p17<=p12) states: 31,361 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.089sec

checking: EF [[[[2<=p46 & 1<=p38] | [p34<=p25 & p12<=p63]] & 2<=p28]]
normalized: E [true U [2<=p28 & [[p34<=p25 & p12<=p63] | [2<=p46 & 1<=p38]]]]

abstracting: (1<=p38) states: 1,024 (3)
abstracting: (2<=p46) states: 0
abstracting: (p12<=p63) states: 20,737 (4)
abstracting: (p34<=p25) states: 30,977 (4)
abstracting: (2<=p28) states: 0
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[1<=p63 & ~ [p22<=p44]] | [p43<=p57 | p11<=p9]]]
normalized: ~ [E [true U ~ [[[1<=p63 & ~ [p22<=p44]] | [p43<=p57 | p11<=p9]]]]]

abstracting: (p11<=p9) states: 23,809 (4)
abstracting: (p43<=p57) states: 31,233 (4)
abstracting: (p22<=p44) states: 30,721 (4)
abstracting: (1<=p63) states: 9,728 (3)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.185sec

checking: EF [[p41<=p33 & [[2<=p21 & p18<=p54] & [p64<=p2 | p38<=p56]]]]
normalized: E [true U [p41<=p33 & [[p64<=p2 | p38<=p56] & [2<=p21 & p18<=p54]]]]

abstracting: (p18<=p54) states: 30,977 (4)
abstracting: (2<=p21) states: 0
abstracting: (p38<=p56) states: 30,721 (4)
abstracting: (p64<=p2) states: 26,881 (4)
abstracting: (p41<=p33) states: 30,977 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[p19<=p47 | p38<=p40] & [3<=p30 & p19<=p43]] & [~ [p18<=p3] & 1<=p21]]]
normalized: E [true U [[1<=p21 & ~ [p18<=p3]] & [[3<=p30 & p19<=p43] & [p19<=p47 | p38<=p40]]]]

abstracting: (p38<=p40) states: 30,721 (4)
abstracting: (p19<=p47) states: 30,977 (4)
abstracting: (p19<=p43) states: 30,977 (4)
abstracting: (3<=p30) states: 0
abstracting: (p18<=p3) states: 31,361 (4)
abstracting: (1<=p21) states: 512
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[3<=p36 & p54<=p0]] | [[p39<=p27 & 1<=p43] & [p60<=p52 | p15<=p44]]]]
normalized: ~ [E [true U ~ [[[[p60<=p52 | p15<=p44] & [p39<=p27 & 1<=p43]] | ~ [[3<=p36 & p54<=p0]]]]]]

abstracting: (p54<=p0) states: 30,721 (4)
abstracting: (3<=p36) states: 0
abstracting: (1<=p43) states: 512
abstracting: (p39<=p27) states: 30,721 (4)
abstracting: (p15<=p44) states: 16,129 (4)
abstracting: (p60<=p52) states: 2,049 (3)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[p52<=p4 | 2<=p55] | [3<=p37 | p2<=p50]] | [1<=p4 | [1<=p16 & p4<=p35]]]]
normalized: ~ [E [true U ~ [[[1<=p4 | [1<=p16 & p4<=p35]] | [[p52<=p4 | 2<=p55] | [3<=p37 | p2<=p50]]]]]]

abstracting: (p2<=p50) states: 16,385 (4)
abstracting: (3<=p37) states: 0
abstracting: (2<=p55) states: 0
abstracting: (p52<=p4) states: 31,233 (4)
abstracting: (p4<=p35) states: 16,129 (4)
abstracting: (1<=p16) states: 15,872 (4)
abstracting: (1<=p4) states: 15,872 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec

checking: EF [[[[p31<=p52 & 2<=p12] & [p47<=p9 & p63<=p41]] & [p38<=p40 | [p14<=p20 & p38<=p35]]]]
normalized: E [true U [[[p47<=p9 & p63<=p41] & [p31<=p52 & 2<=p12]] & [p38<=p40 | [p14<=p20 & p38<=p35]]]]

abstracting: (p38<=p35) states: 30,721 (4)
abstracting: (p14<=p20) states: 16,257 (4)
abstracting: (p38<=p40) states: 30,721 (4)
abstracting: (2<=p12) states: 0
abstracting: (p31<=p52) states: 30,721 (4)
abstracting: (p63<=p41) states: 22,273 (4)
abstracting: (p47<=p9) states: 31,233 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec


Total processing time: 0m 6.601sec


BK_STOP 1464953321925

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

294
iterations count:1825 (18), effective:95 (0)

initing FirstDep: 0m 0.000sec

709
iterations count:1360 (14), effective:56 (0)
611 2388
iterations count:2479 (25), effective:94 (0)
1697
iterations count:1349 (13), effective:56 (0)
703 2450
iterations count:2504 (25), effective:95 (0)
1319
iterations count:1364 (14), effective:53 (0)
731 1750 1867
iterations count:3301 (34), effective:159 (1)
495 1577 1727 1798
iterations count:4730 (48), effective:199 (2)
730 2595
iterations count:2412 (24), effective:97 (1)

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_Parking-PT-104"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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_Parking-PT-104.tgz
mv S_Parking-PT-104 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 S_Parking-PT-104, 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 r185kn-smll-146444131101168"
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 ;