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

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

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

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

net check time: 0m 0.000sec

init dd package: 0m 1.101sec

parse successfull
net created successfully

Net: Kanban_PT_0005
(NrP: 16 NrTr: 16 NrArc: 40)

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

net check time: 0m 0.000sec

init dd package: 0m 3.596sec


RS generation: 0m 0.002sec


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



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

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

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

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

MC time: 0m 0.003sec

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

abstracting: (3<=Pout1)
states: 454,720 (5)
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (1<=P1)
states: 1,591,520 (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: EF [~ [~ [3<=Pout3]]]
normalized: E [true U 3<=Pout3]

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

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

MC time: 0m 0.002sec

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

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

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

abstracting: (Pm3<=Pm3)
states: 2,546,432 (6)
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (3<=Pback3)
states: 567,616 (5)
abstracting: (P1<=Pm3)
states: 1,676,808 (6)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EF [~ [[~ [3<=Pback2] | [1<=Pback1 & 3<=P4]]]]
normalized: E [true U ~ [[[1<=Pback1 & 3<=P4] | ~ [3<=Pback2]]]]

abstracting: (3<=Pback2)
states: 567,616 (5)
abstracting: (3<=P4)
states: 454,720 (5)
abstracting: (1<=Pback1)
states: 1,591,520 (6)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AG [[1<=Pm4 | Pout3<=P4]]
normalized: ~ [E [true U ~ [[1<=Pm4 | Pout3<=P4]]]]

abstracting: (Pout3<=P4)
states: 1,491,000 (6)
abstracting: (1<=Pm4)
states: 1,591,520 (6)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [~ [~ [[Pm1<=P3 | Pback1<=Pm3]]]]
normalized: ~ [E [true U ~ [[Pm1<=P3 | Pback1<=Pm3]]]]

abstracting: (Pback1<=Pm3)
states: 1,676,808 (6)
abstracting: (Pm1<=P3)
states: 1,365,504 (6)
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: AG [[[3<=P1 | 2<=Pout2] | Pback3<=Pout2]]
normalized: ~ [E [true U ~ [[[3<=P1 | 2<=Pout2] | Pback3<=Pout2]]]]

abstracting: (Pback3<=Pout2)
states: 1,580,544 (6)
abstracting: (2<=Pout2)
states: 1,053,696 (6)
abstracting: (3<=P1)
states: 454,720 (5)
-> the formula is FALSE

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

MC time: 0m 0.003sec

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

abstracting: (Pback4<=Pback4)
states: 2,546,432 (6)
abstracting: (1<=Pout4)
states: 1,591,520 (6)
abstracting: (P2<=Pm1)
states: 1,958,208 (6)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [[[[2<=Pm1 | 1<=Pm1] | [Pback2<=P1 | 3<=Pm4]] & 2<=Pout1]]
normalized: E [true U [[[Pback2<=P1 | 3<=Pm4] | [2<=Pm1 | 1<=Pm1]] & 2<=Pout1]]

abstracting: (2<=Pout1)
states: 909,440 (5)
abstracting: (1<=Pm1)
states: 1,591,520 (6)
abstracting: (2<=Pm1)
states: 909,440 (5)
abstracting: (3<=Pm4)
states: 454,720 (5)
abstracting: (Pback2<=P1)
states: 1,491,000 (6)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [[~ [Pout1<=P3] & [[P3<=Pback3 & P2<=P4] & 3<=Pout4]]]
normalized: E [true U [[3<=Pout4 & [P3<=Pback3 & P2<=P4]] & ~ [Pout1<=P3]]]

abstracting: (Pout1<=P3)
states: 1,365,504 (6)
abstracting: (P2<=P4)
states: 1,958,208 (6)
abstracting: (P3<=Pback3)
states: 1,947,456 (6)
abstracting: (3<=Pout4)
states: 454,720 (5)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: AG [[[[P2<=Pback1 | 1<=Pback3] | ~ [Pm3<=Pout4]] | ~ [[2<=Pout2 & 3<=Pm2]]]]
normalized: ~ [E [true U ~ [[~ [[2<=Pout2 & 3<=Pm2]] | [~ [Pm3<=Pout4] | [P2<=Pback1 | 1<=Pback3]]]]]]

abstracting: (1<=Pback3)
states: 1,712,256 (6)
abstracting: (P2<=Pback1)
states: 1,958,208 (6)
abstracting: (Pm3<=Pout4)
states: 1,491,000 (6)
abstracting: (3<=Pm2)
states: 567,616 (5)
abstracting: (2<=Pout2)
states: 1,053,696 (6)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[3<=Pm1 & [[P4<=Pback3 & Pm2<=Pout1] | [P2<=Pout2 | 2<=Pm4]]]]
normalized: E [true U [3<=Pm1 & [[P2<=Pout2 | 2<=Pm4] | [P4<=Pback3 & Pm2<=Pout1]]]]

abstracting: (Pm2<=Pout1)
states: 1,491,000 (6)
abstracting: (P4<=Pback3)
states: 1,676,808 (6)
abstracting: (2<=Pm4)
states: 909,440 (5)
abstracting: (P2<=Pout2)
states: 1,947,456 (6)
abstracting: (3<=Pm1)
states: 454,720 (5)
-> the formula is TRUE

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

MC time: 0m 0.003sec

totally nodes used: 12154 (1.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 61165 35273 96438
used/not used/entry size/cache size: 44268 67064596 16 1024MB
basic ops cache: hits/miss/sum: 21320 15972 37292
used/not used/entry size/cache size: 30930 16746286 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 2746 1941 4687
used/not used/entry size/cache size: 1941 8386667 32 256MB
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 67097427
1 11179
2 134
3 42
4 23
5 14
6 21
7 5
8 3
9 5
>= 10 11

Total processing time: 0m 6.410sec


BK_STOP 1494775504322

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:73 (4), effective:18 (1)

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

iterations count:141 (8), effective:34 (2)

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

iterations count:55 (3), effective:16 (1)

iterations count:176 (11), effective:47 (2)

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

iterations count:144 (9), effective:36 (2)

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

iterations count:152 (9), effective:39 (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="S_Kanban-PT-0005"
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_Kanban-PT-0005.tgz
mv S_Kanban-PT-0005 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_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 r111-blw7-149441636900124"
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 ;