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 Kanban-PT-0005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913300106
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463724817058


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_0005
(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.015sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 111 (1.1e+02) #states 2,546,432 (6)



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

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

abstracting: (3<=Pout2) states: 567,616 (5)
-> the formula is TRUE

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

MC time: 0m 0.003sec

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

abstracting: (Pout2<=P1) states: 1,491,000 (6)
-> the formula is TRUE

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

MC time: 0m 0.002sec

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

abstracting: (Pout2<=P1) states: 1,491,000 (6)
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (Pm2<=P1) states: 1,491,000 (6)
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: AG [Pback1<=P2]
normalized: ~ [E [true U ~ [Pback1<=P2]]]

abstracting: (Pback1<=P2) states: 1,365,504 (6)
-> the formula is FALSE

FORMULA Kanban-PT-0005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (Pm2<=Pm2) states: 2,546,432 (6)
abstracting: (3<=Pm2) states: 567,616 (5)
-> the formula is TRUE

FORMULA Kanban-PT-0005-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[2<=Pback2 & 2<=Pout1]] & [1<=P3 & ~ [Pback3<=P2]]]]
normalized: E [true U [[1<=P3 & ~ [Pback3<=P2]] & ~ [[2<=Pback2 & 2<=Pout1]]]]

abstracting: (2<=Pout1) states: 909,440 (5)
abstracting: (2<=Pback2) states: 1,053,696 (6)
abstracting: (Pback3<=P2) states: 1,244,992 (6)
abstracting: (1<=P3) states: 1,163,456 (6)
-> the formula is TRUE

FORMULA Kanban-PT-0005-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[~ [1<=P1] & [[Pback2<=P3 & 2<=Pm2] | ~ [3<=P1]]]]
normalized: E [true U [[~ [3<=P1] | [Pback2<=P3 & 2<=Pm2]] & ~ [1<=P1]]]

abstracting: (1<=P1) states: 1,591,520 (6)
abstracting: (2<=Pm2) states: 1,053,696 (6)
abstracting: (Pback2<=P3) states: 1,244,992 (6)
abstracting: (3<=P1) states: 454,720 (5)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[~ [[Pout4<=Pback1 | Pm4<=Pout1]] & [~ [1<=P1] & ~ [1<=Pback2]]]]
normalized: E [true U [[~ [1<=Pback2] & ~ [1<=P1]] & ~ [[Pout4<=Pback1 | Pm4<=Pout1]]]]

abstracting: (Pm4<=Pout1) states: 1,602,888 (6)
abstracting: (Pout4<=Pback1) states: 1,602,888 (6)
abstracting: (1<=P1) states: 1,591,520 (6)
abstracting: (1<=Pback2) states: 1,712,256 (6)
-> the formula is TRUE

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

MC time: 0m 0.027sec

checking: AG [~ [[[3<=Pback3 & Pback1<=Pback3] & [Pback2<=Pout1 | 3<=P2]]]]
normalized: ~ [E [true U [[3<=Pback3 & Pback1<=Pback3] & [Pback2<=Pout1 | 3<=P2]]]]

abstracting: (3<=P2) states: 144,256 (5)
abstracting: (Pback2<=Pout1) states: 1,491,000 (6)
abstracting: (Pback1<=Pback3) states: 1,676,808 (6)
abstracting: (3<=Pback3) states: 567,616 (5)
-> the formula is FALSE

FORMULA Kanban-PT-0005-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[[1<=Pback3 | Pm1<=P1] & [1<=Pm3 & Pm3<=P3]] & ~ [~ [3<=Pm3]]]]
normalized: E [true U [3<=Pm3 & [[1<=Pm3 & Pm3<=P3] & [1<=Pback3 | Pm1<=P1]]]]

abstracting: (Pm1<=P1) states: 1,546,048 (6)
abstracting: (1<=Pback3) states: 1,712,256 (6)
abstracting: (Pm3<=P3) states: 1,244,992 (6)
abstracting: (1<=Pm3) states: 1,712,256 (6)
abstracting: (3<=Pm3) states: 567,616 (5)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[~ [[Pback2<=Pback3 & 3<=Pback3]] & ~ [[P3<=Pout2 & Pm2<=Pback4]]]]
normalized: ~ [E [true U ~ [[~ [[Pback2<=Pback3 & 3<=Pback3]] & ~ [[P3<=Pout2 & Pm2<=Pback4]]]]]]

abstracting: (Pm2<=Pback4) states: 1,491,000 (6)
abstracting: (P3<=Pout2) states: 1,947,456 (6)
abstracting: (3<=Pback3) states: 567,616 (5)
abstracting: (Pback2<=Pback3) states: 1,580,544 (6)
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: EF [[[Pout1<=Pm3 & ~ [Pm4<=Pm4]] & ~ [[1<=Pm3 | P3<=Pout3]]]]
normalized: E [true U [[Pout1<=Pm3 & ~ [Pm4<=Pm4]] & ~ [[1<=Pm3 | P3<=Pout3]]]]

abstracting: (P3<=Pout3) states: 1,947,456 (6)
abstracting: (1<=Pm3) states: 1,712,256 (6)
abstracting: (Pm4<=Pm4) states: 2,546,432 (6)
abstracting: (Pout1<=Pm3) states: 1,676,808 (6)
-> the formula is FALSE

FORMULA Kanban-PT-0005-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[Pout1<=Pm1 & [Pback4<=Pout2 | 2<=P4]] & [Pback1<=P1 & [2<=Pm3 & 3<=Pback1]]]]
normalized: E [true U [[Pout1<=Pm1 & [Pback4<=Pout2 | 2<=P4]] & [Pback1<=P1 & [2<=Pm3 & 3<=Pback1]]]]

abstracting: (3<=Pback1) states: 454,720 (5)
abstracting: (2<=Pm3) states: 1,053,696 (6)
abstracting: (Pback1<=P1) states: 1,546,048 (6)
abstracting: (2<=P4) states: 909,440 (5)
abstracting: (Pback4<=Pout2) states: 1,676,808 (6)
abstracting: (Pout1<=Pm1) states: 1,546,048 (6)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[[Pout1<=Pout3 & Pm1<=Pout2] | [[2<=P4 | Pback2<=Pm2] | [2<=Pback3 & P1<=P4]]]]
normalized: ~ [E [true U ~ [[[Pout1<=Pout3 & Pm1<=Pout2] | [[2<=Pback3 & P1<=P4] | [2<=P4 | Pback2<=Pm2]]]]]]

abstracting: (Pback2<=Pm2) states: 1,499,008 (6)
abstracting: (2<=P4) states: 909,440 (5)
abstracting: (P1<=P4) states: 1,602,888 (6)
abstracting: (2<=Pback3) states: 1,053,696 (6)
abstracting: (Pm1<=Pout2) states: 1,676,808 (6)
abstracting: (Pout1<=Pout3) states: 1,676,808 (6)
-> the formula is FALSE

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

MC time: 0m 0.021sec

checking: EF [[[[Pback3<=P1 | 3<=Pm2] | ~ [Pback3<=Pm4]] & [[3<=Pout2 & Pback2<=Pout4] & [Pm2<=Pback4 & 1<=Pout1]]]]
normalized: E [true U [[[Pm2<=Pback4 & 1<=Pout1] & [3<=Pout2 & Pback2<=Pout4]] & [~ [Pback3<=Pm4] | [Pback3<=P1 | 3<=Pm2]]]]

abstracting: (3<=Pm2) states: 567,616 (5)
abstracting: (Pback3<=P1) states: 1,491,000 (6)
abstracting: (Pback3<=Pm4) states: 1,491,000 (6)
abstracting: (Pback2<=Pout4) states: 1,491,000 (6)
abstracting: (3<=Pout2) states: 567,616 (5)
abstracting: (1<=Pout1) states: 1,591,520 (6)
abstracting: (Pm2<=Pback4) states: 1,491,000 (6)
-> the formula is TRUE

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

MC time: 0m 0.009sec


Total processing time: 0m 5.580sec


BK_STOP 1463724822671

--------------------
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:371 (23), effective:110 (6)

initing FirstDep: 0m 0.000sec


iterations count:82 (5), effective:18 (1)

iterations count:159 (9), effective:39 (2)

iterations count:159 (9), effective:39 (2)

iterations count:169 (10), effective:43 (2)

iterations count:128 (8), effective:31 (1)

iterations count:213 (13), effective:56 (3)

iterations count:181 (11), effective:45 (2)

iterations count:290 (18), effective:80 (5)

iterations count:282 (17), effective:75 (4)

iterations count:99 (6), effective:31 (1)

iterations count:169 (10), effective:50 (3)

iterations count:155 (9), effective:44 (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="Kanban-PT-0005"
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/Kanban-PT-0005.tgz
mv Kanban-PT-0005 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 Kanban-PT-0005, 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 r065kn-blw3-146358913300106"
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 ;