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_Parking-PT-104, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r111-blw7-149441637200331
=====================================================================

--------------------
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 1494786483024

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

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

net check time: 0m 0.000sec

init dd package: 0m 1.079sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 83 (8.3e+01) #states 31,745 (4)



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

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (3<=p18)
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.000sec

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

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

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

MC time: 0m 0.000sec

checking: EF [[3<=p16 | 3<=p32]]
normalized: E [true U [3<=p16 | 3<=p32]]

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

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

MC time: 0m 0.000sec

checking: AG [p49<=p17]
normalized: ~ [E [true U ~ [p49<=p17]]]

abstracting: (p49<=p17)
states: 30,721 (4)
-> the formula is FALSE

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

MC time: 0m 0.065sec

checking: AG [p42<=p28]
normalized: ~ [E [true U ~ [p42<=p28]]]

abstracting: (p42<=p28)
states: 30,977 (4)
-> the formula is FALSE

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

MC time: 0m 0.055sec

checking: AG [p18<=p8]
normalized: ~ [E [true U ~ [p18<=p8]]]

abstracting: (p18<=p8)
states: 31,361 (4)
-> the formula is FALSE

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

MC time: 0m 0.034sec

checking: AG [~ [[2<=p55 | [1<=p63 & 2<=p15]]]]
normalized: ~ [E [true U [2<=p55 | [1<=p63 & 2<=p15]]]]

abstracting: (2<=p15)
states: 0
abstracting: (1<=p63)
states: 9,728 (3)
abstracting: (2<=p55)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[2<=p36 & [[3<=p59 & 1<=p3] | ~ [p13<=p62]]]]
normalized: E [true U [2<=p36 & [~ [p13<=p62] | [3<=p59 & 1<=p3]]]]

abstracting: (1<=p3)
states: 15,872 (4)
abstracting: (3<=p59)
states: 0
abstracting: (p13<=p62)
states: 18,689 (4)
abstracting: (2<=p36)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[p28<=p26 | [3<=p6 | [2<=p5 | 3<=p24]]]]
normalized: ~ [E [true U ~ [[p28<=p26 | [3<=p6 | [2<=p5 | 3<=p24]]]]]]

abstracting: (3<=p24)
states: 0
abstracting: (2<=p5)
states: 0
abstracting: (3<=p6)
states: 0
abstracting: (p28<=p26)
states: 30,977 (4)
-> the formula is FALSE

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

MC time: 0m 0.047sec

checking: EF [[[2<=p22 & p23<=p29] | [~ [p26<=p5] & ~ [2<=p40]]]]
normalized: E [true U [[~ [2<=p40] & ~ [p26<=p5]] | [2<=p22 & p23<=p29]]]

abstracting: (p23<=p29)
states: 30,721 (4)
abstracting: (2<=p22)
states: 0
abstracting: (p26<=p5)
states: 31,361 (4)
abstracting: (2<=p40)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.037sec

checking: AG [[[[3<=p7 | p57<=p56] & [2<=p49 | 1<=p50]] | [~ [1<=p33] | 1<=p61]]]
normalized: ~ [E [true U ~ [[[1<=p61 | ~ [1<=p33]] | [[2<=p49 | 1<=p50] & [3<=p7 | p57<=p56]]]]]]

abstracting: (p57<=p56)
states: 30,721 (4)
abstracting: (3<=p7)
states: 0
abstracting: (1<=p50)
states: 1,024 (3)
abstracting: (2<=p49)
states: 0
abstracting: (1<=p33)
states: 768
abstracting: (1<=p61)
states: 6,656 (3)
-> the formula is FALSE

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

MC time: 0m 0.051sec

checking: EF [[2<=p43 & [[2<=p51 | 1<=p59] & [p16<=p28 & p64<=p9]]]]
normalized: E [true U [2<=p43 & [[p16<=p28 & p64<=p9] & [2<=p51 | 1<=p59]]]]

abstracting: (1<=p59)
states: 1,024 (3)
abstracting: (2<=p51)
states: 0
abstracting: (p64<=p9)
states: 26,881 (4)
abstracting: (p16<=p28)
states: 16,257 (4)
abstracting: (2<=p43)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[1<=p4 & 1<=p9] & ~ [p49<=p28]] | [[1<=p42 & p43<=p47] & 3<=p49]]]
normalized: E [true U [[3<=p49 & [1<=p42 & p43<=p47]] | [~ [p49<=p28] & [1<=p4 & 1<=p9]]]]

abstracting: (1<=p9)
states: 15,872 (4)
abstracting: (1<=p4)
states: 15,872 (4)
abstracting: (p49<=p28)
states: 30,721 (4)
abstracting: (p43<=p47)
states: 31,233 (4)
abstracting: (1<=p42)
states: 768
abstracting: (3<=p49)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.008sec

checking: EF [[[3<=p31 & ~ [p51<=p48]] | [[p5<=p28 & p40<=p28] & ~ [p17<=p11]]]]
normalized: E [true U [[~ [p17<=p11] & [p5<=p28 & p40<=p28]] | [3<=p31 & ~ [p51<=p48]]]]

abstracting: (p51<=p48)
states: 31,745 (4)
abstracting: (3<=p31)
states: 0
abstracting: (p40<=p28)
states: 5,889 (3)
abstracting: (p5<=p28)
states: 16,257 (4)
abstracting: (p17<=p11)
states: 31,361 (4)
-> the formula is FALSE

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

MC time: 0m 0.000sec

totally nodes used: 302661(3.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 212157 440839 652996
used/not used/entry size/cache size: 386666 66722198 16 1024MB
basic ops cache: hits/miss/sum: 242676 615774 858450
used/not used/entry size/cache size: 1326081 15451135 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: 494 783 1277
used/not used/entry size/cache size: 783 2096369 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 66807616
1 299842
2 1399
3 7
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.956sec


BK_STOP 1494786485007

--------------------
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:1825 (18), effective:95 (0)

initing FirstDep: 0m 0.000sec


iterations count:3657 (37), effective:161 (1)

iterations count:2327 (23), effective:91 (0)

iterations count:1363 (14), effective:57 (0)

iterations count:1378 (14), effective:56 (0)

iterations count:3708 (38), effective:166 (1)

iterations count:4411 (45), effective:189 (1)

iterations count:3662 (37), effective:163 (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="/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_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-3254"
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 r111-blw7-149441637200331"
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 ;