About the Execution of Marcie for S_Kanban-PT-0005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5416.410 | 5415.00 | 4998.00 | 21.30 | TTFTTFFTFFFTFTTF | normal |
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-0005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418200102
=====================================================================
--------------------
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-CTLCardinality-0
FORMULA_NAME Kanban-PT-0005-CTLCardinality-1
FORMULA_NAME Kanban-PT-0005-CTLCardinality-10
FORMULA_NAME Kanban-PT-0005-CTLCardinality-11
FORMULA_NAME Kanban-PT-0005-CTLCardinality-12
FORMULA_NAME Kanban-PT-0005-CTLCardinality-13
FORMULA_NAME Kanban-PT-0005-CTLCardinality-14
FORMULA_NAME Kanban-PT-0005-CTLCardinality-15
FORMULA_NAME Kanban-PT-0005-CTLCardinality-2
FORMULA_NAME Kanban-PT-0005-CTLCardinality-3
FORMULA_NAME Kanban-PT-0005-CTLCardinality-4
FORMULA_NAME Kanban-PT-0005-CTLCardinality-5
FORMULA_NAME Kanban-PT-0005-CTLCardinality-6
FORMULA_NAME Kanban-PT-0005-CTLCardinality-7
FORMULA_NAME Kanban-PT-0005-CTLCardinality-8
FORMULA_NAME Kanban-PT-0005-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464331648027
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=CTLCardinality.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.019sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 111 (1.1e+02) #states 2,546,432 (6)
starting MCC model checker
--------------------------
checking: EF [[EX [3<=Pback3] & EX [2<=Pback1]]]
normalized: E [true U [EX [3<=Pback3] & EX [2<=Pback1]]]
abstracting: (2<=Pback1) states: 909,440 (5)
.abstracting: (3<=Pback3) states: 567,616 (5)
.-> the formula is TRUE
FORMULA Kanban-PT-0005-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [~ [~ [Pm3<=P1]]]
normalized: ~ [E [true U ~ [Pm3<=P1]]]
abstracting: (Pm3<=P1) states: 1,491,000 (6)
-> the formula is FALSE
FORMULA Kanban-PT-0005-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: ~ [[3<=Pout3 | AG [~ [3<=Pback1]]]]
normalized: ~ [[3<=Pout3 | ~ [E [true U 3<=Pback1]]]]
abstracting: (3<=Pback1) states: 454,720 (5)
abstracting: (3<=Pout3) states: 567,616 (5)
-> the formula is TRUE
FORMULA Kanban-PT-0005-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [~ [~ [EF [Pback3<=Pout2]]]]
normalized: ~ [E [true U Pback3<=Pout2]]
abstracting: (Pback3<=Pout2) states: 1,580,544 (6)
-> the formula is FALSE
FORMULA Kanban-PT-0005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: Pout4<=Pout1
normalized: Pout4<=Pout1
abstracting: (Pout4<=Pout1) states: 1,602,888 (6)
-> the formula is TRUE
FORMULA Kanban-PT-0005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: E [EF [2<=Pout3] U ~ [[3<=P1 | 3<=Pback1]]]
normalized: E [E [true U 2<=Pout3] U ~ [[3<=P1 | 3<=Pback1]]]
abstracting: (3<=Pback1) states: 454,720 (5)
abstracting: (3<=P1) states: 454,720 (5)
abstracting: (2<=Pout3) states: 1,053,696 (6)
-> the formula is TRUE
FORMULA Kanban-PT-0005-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [A [Pout2<=P4 U 1<=P3]]
normalized: ~ [E [true U ~ [[~ [EG [~ [1<=P3]]] & ~ [E [~ [1<=P3] U [~ [1<=P3] & ~ [Pout2<=P4]]]]]]]]
abstracting: (Pout2<=P4) states: 1,491,000 (6)
abstracting: (1<=P3) states: 1,163,456 (6)
abstracting: (1<=P3) states: 1,163,456 (6)
abstracting: (1<=P3) states: 1,163,456 (6)
.......
EG iterations: 7
-> the formula is FALSE
FORMULA Kanban-PT-0005-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [[AX [P2<=Pout4] | ~ [~ [3<=P1]]]]
normalized: ~ [E [true U ~ [[3<=P1 | ~ [EX [~ [P2<=Pout4]]]]]]]
abstracting: (P2<=Pout4) states: 1,958,208 (6)
.abstracting: (3<=P1) states: 454,720 (5)
-> the formula is FALSE
FORMULA Kanban-PT-0005-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EF [AG [[3<=P2 | Pm4<=Pm3]]]
normalized: E [true U ~ [E [true U ~ [[3<=P2 | Pm4<=Pm3]]]]]
abstracting: (Pm4<=Pm3) states: 1,676,808 (6)
abstracting: (3<=P2) states: 144,256 (5)
-> the formula is FALSE
FORMULA Kanban-PT-0005-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AX [[AG [Pm1<=P3] | 1<=Pout1]]
normalized: ~ [EX [~ [[1<=Pout1 | ~ [E [true U ~ [Pm1<=P3]]]]]]]
abstracting: (Pm1<=P3) states: 1,365,504 (6)
abstracting: (1<=Pout1) states: 1,591,520 (6)
.-> the formula is FALSE
FORMULA Kanban-PT-0005-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: ~ [[AF [Pback1<=P4] | EF [1<=Pm4]]]
normalized: ~ [[E [true U 1<=Pm4] | ~ [EG [~ [Pback1<=P4]]]]]
abstracting: (Pback1<=P4) states: 1,602,888 (6)
......
EG iterations: 6
abstracting: (1<=Pm4) states: 1,591,520 (6)
-> the formula is FALSE
FORMULA Kanban-PT-0005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: ~ [E [[1<=Pm1 | Pm1<=P4] U ~ [1<=P1]]]
normalized: ~ [E [[1<=Pm1 | Pm1<=P4] U ~ [1<=P1]]]
abstracting: (1<=P1) states: 1,591,520 (6)
abstracting: (Pm1<=P4) states: 1,602,888 (6)
abstracting: (1<=Pm1) states: 1,591,520 (6)
-> the formula is FALSE
FORMULA Kanban-PT-0005-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[~ [Pout4<=Pout2] | EF [Pout3<=Pm1]]]
normalized: ~ [E [true U ~ [[E [true U Pout3<=Pm1] | ~ [Pout4<=Pout2]]]]]
abstracting: (Pout4<=Pout2) states: 1,676,808 (6)
abstracting: (Pout3<=Pm1) states: 1,491,000 (6)
-> the formula is TRUE
FORMULA Kanban-PT-0005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [AG [EG [Pout1<=Pback1]] | Pback3<=Pm3]
normalized: [Pback3<=Pm3 | ~ [E [true U ~ [EG [Pout1<=Pback1]]]]]
abstracting: (Pout1<=Pback1) states: 1,546,048 (6)
.
EG iterations: 1
abstracting: (Pback3<=Pm3) states: 1,499,008 (6)
-> the formula is TRUE
FORMULA Kanban-PT-0005-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [AG [[[3<=Pm3 | Pm2<=Pback2] | Pm3<=P1]]]
normalized: E [true U ~ [[Pm3<=P1 | [3<=Pm3 | Pm2<=Pback2]]]]
abstracting: (Pm2<=Pback2) states: 1,499,008 (6)
abstracting: (3<=Pm3) states: 567,616 (5)
abstracting: (Pm3<=P1) states: 1,491,000 (6)
-> the formula is TRUE
FORMULA Kanban-PT-0005-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [~ [E [Pout4<=Pm1 U P3<=P1]] | AG [Pm2<=Pm2]]
normalized: [~ [E [true U ~ [Pm2<=Pm2]]] | ~ [E [Pout4<=Pm1 U P3<=P1]]]
abstracting: (P3<=P1) states: 1,958,208 (6)
abstracting: (Pout4<=Pm1) states: 1,602,888 (6)
abstracting: (Pm2<=Pm2) states: 2,546,432 (6)
-> the formula is TRUE
FORMULA Kanban-PT-0005-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
Total processing time: 0m 5.384sec
BK_STOP 1464331653442
--------------------
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:239 (14), effective:63 (3)
iterations count:195 (12), effective:51 (3)
iterations count:127 (7), effective:33 (2)
iterations count:21 (1), effective:5 (0)
iterations count:54 (3), effective:12 (0)
iterations count:127 (7), effective:30 (1)
iterations count:38 (2), effective:7 (0)
iterations count:91 (5), effective:20 (1)
iterations count:302 (18), effective:84 (5)
iterations count:122 (7), effective:35 (2)
iterations count:129 (8), effective:31 (1)
iterations count:53 (3), effective:11 (0)
iterations count:181 (11), effective:45 (2)
iterations count:182 (11), effective:45 (2)
iterations count:136 (8), effective:33 (2)
iterations count:218 (13), effective:59 (3)
iterations count:119 (7), effective:32 (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="CTLCardinality"
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-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-2979"
echo " Executing tool marcie"
echo " Input is S_Kanban-PT-0005, examination is CTLCardinality"
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-146416418200102"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
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 ;