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_Kanban-PT-0010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418200115
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464331846170


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: Kanban_PT_0010
(NrP: 16 NrTr: 16 NrArc: 40)

net check time: 0m 0.000sec

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

init dd package: 0m 4.332sec


RS generation: 0m 0.007sec


-> reachability set: #nodes 256 (2.6e+02) #states 1,005,927,208 (9)



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

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

abstracting: (3<=Pout1) states: 422,067,360 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

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

abstracting: (3<=P2) states: 236,554,032 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

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

abstracting: (1<=P1) states: 773,790,160 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (Pm1<=Pm1) states: 1,005,927,208 (9)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [Pm3<=P1]
normalized: ~ [E [true U ~ [Pm3<=P1]]]

abstracting: (Pm3<=P1) states: 535,886,494 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EF [P3<=Pm2]
normalized: E [true U P3<=Pm2]

abstracting: (P3<=Pm2) states: 721,440,720 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [~ [[~ [3<=Pback4] & [2<=Pm3 & 2<=Pm1]]]]
normalized: ~ [E [true U [[2<=Pm3 & 2<=Pm1] & ~ [3<=Pback4]]]]

abstracting: (3<=Pback4) states: 422,067,360 (8)
abstracting: (2<=Pm1) states: 580,342,620 (8)
abstracting: (2<=Pm3) states: 631,628,712 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [[~ [~ [2<=P2]] | ~ [[1<=Pm3 | 1<=Pm1]]]]
normalized: ~ [E [true U ~ [[2<=P2 | ~ [[1<=Pm3 | 1<=Pm1]]]]]]

abstracting: (1<=Pm1) states: 773,790,160 (8)
abstracting: (1<=Pm3) states: 807,081,132 (8)
abstracting: (2<=P2) states: 402,190,932 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AG [~ [~ [[1<=P1 | P3<=Pback4]]]]
normalized: ~ [E [true U ~ [[1<=P1 | P3<=Pback4]]]]

abstracting: (P3<=Pback4) states: 715,510,510 (8)
abstracting: (1<=P1) states: 773,790,160 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [[[1<=Pback4 & ~ [P1<=Pback3]] | ~ [3<=Pm1]]]
normalized: ~ [E [true U ~ [[~ [3<=Pm1] | [1<=Pback4 & ~ [P1<=Pback3]]]]]]

abstracting: (P1<=Pback3) states: 612,243,060 (8)
abstracting: (1<=Pback4) states: 773,790,160 (8)
abstracting: (3<=Pm1) states: 422,067,360 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EF [~ [[[1<=Pback3 | Pback3<=Pback2] | ~ [1<=P1]]]]
normalized: E [true U ~ [[~ [1<=P1] | [1<=Pback3 | Pback3<=Pback2]]]]

abstracting: (Pback3<=Pback2) states: 573,144,572 (8)
abstracting: (1<=Pback3) states: 807,081,132 (8)
abstracting: (1<=P1) states: 773,790,160 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[P4<=Pback1 & ~ [[Pm1<=P1 | P1<=Pout1]]]]
normalized: E [true U [P4<=Pback1 & ~ [[Pm1<=P1 | P1<=Pout1]]]]

abstracting: (P1<=Pout1) states: 566,273,708 (8)
abstracting: (Pm1<=P1) states: 566,273,708 (8)
abstracting: (P4<=Pback1) states: 578,584,006 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[[[Pm4<=P1 & 3<=P3] & Pout4<=Pout2] & 2<=Pout1]]
normalized: E [true U [2<=Pout1 & [Pout4<=Pout2 & [Pm4<=P1 & 3<=P3]]]]

abstracting: (3<=P3) states: 236,554,032 (8)
abstracting: (Pm4<=P1) states: 578,584,006 (8)
abstracting: (Pout4<=Pout2) states: 612,243,060 (8)
abstracting: (2<=Pout1) states: 580,342,620 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: AG [[~ [P2<=Pback4] | [[2<=Pback2 | Pback3<=Pm3] & ~ [Pout2<=Pout4]]]]
normalized: ~ [E [true U ~ [[[~ [Pout2<=Pout4] & [2<=Pback2 | Pback3<=Pm3]] | ~ [P2<=Pback4]]]]]

abstracting: (P2<=Pback4) states: 715,510,510 (8)
abstracting: (Pback3<=Pm3) states: 555,967,412 (8)
abstracting: (2<=Pback2) states: 631,628,712 (8)
abstracting: (Pout2<=Pout4) states: 535,886,494 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.087sec

checking: EF [~ [[[Pout2<=P1 | Pback1<=Pm2] & [Pout4<=P2 | 1<=P4]]]]
normalized: E [true U ~ [[[Pout4<=P2 | 1<=P4] & [Pout2<=P1 | Pback1<=Pm2]]]]

abstracting: (Pback1<=Pm2) states: 612,243,060 (8)
abstracting: (Pout2<=P1) states: 535,886,494 (8)
abstracting: (1<=P4) states: 773,790,160 (8)
abstracting: (Pout4<=P2) states: 469,877,122 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: EF [[[~ [P1<=P2] & ~ [1<=P4]] & [[P3<=Pm2 & P4<=Pout3] | ~ [P1<=Pm3]]]]
normalized: E [true U [[~ [P1<=Pm3] | [P3<=Pm2 & P4<=Pout3]] & [~ [1<=P4] & ~ [P1<=P2]]]]

abstracting: (P1<=P2) states: 469,877,122 (8)
abstracting: (1<=P4) states: 773,790,160 (8)
abstracting: (P4<=Pout3) states: 612,243,060 (8)
abstracting: (P3<=Pm2) states: 721,440,720 (8)
abstracting: (P1<=Pm3) states: 612,243,060 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec


Total processing time: 0m 6.005sec


BK_STOP 1464331852206

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


iterations count:726 (45), effective:220 (13)

initing FirstDep: 0m 0.000sec


iterations count:136 (8), effective:33 (2)

iterations count:136 (8), effective:32 (2)

iterations count:346 (21), effective:90 (5)

iterations count:347 (21), effective:93 (5)

iterations count:91 (5), effective:20 (1)

iterations count:146 (9), effective:42 (2)

iterations count:171 (10), effective:42 (2)

iterations count:374 (23), effective:103 (6)

iterations count:150 (9), effective:43 (2)

iterations count:267 (16), effective:76 (4)

iterations count:497 (31), effective:136 (8)

iterations count:176 (11), effective:55 (3)

iterations count:148 (9), effective:43 (2)

iterations count:220 (13), effective:61 (3)

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_Kanban-PT-0010"
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/S_Kanban-PT-0010.tgz
mv S_Kanban-PT-0010 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_Kanban-PT-0010, 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 r161kn-blw3-146416418200115"
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 ;