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 ResAllocation-PT-R003C010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101kn-smll-146369143900300
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463777720420


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: ResAllocation_PT_R003C010
(NrP: 60 NrTr: 40 NrArc: 174)

net check time: 0m 0.000sec

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

init dd package: 0m 3.994sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 376 (3.8e+02) #states 823,552 (5)



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

checking: EF [~ [EX [p_4_1<=r_0_0]]]
normalized: E [true U ~ [EX [p_4_1<=r_0_0]]]

abstracting: (p_4_1<=r_0_0) states: 709,888 (5)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: A [EX [1<=r_5_2] U EF [3<=r_2_0]]
normalized: [~ [EG [~ [E [true U 3<=r_2_0]]]] & ~ [E [~ [E [true U 3<=r_2_0]] U [~ [EX [1<=r_5_2]] & ~ [E [true U 3<=r_2_0]]]]]]

abstracting: (3<=r_2_0) states: 0
abstracting: (1<=r_5_2) states: 404,992 (5)
.abstracting: (3<=r_2_0) states: 0
abstracting: (3<=r_2_0) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AX [EF [~ [p_1_0<=r_4_2]]]
normalized: ~ [EX [~ [E [true U ~ [p_1_0<=r_4_2]]]]]

abstracting: (p_1_0<=r_4_2) states: 791,168 (5)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EX [EF [[1<=r_7_1 & 3<=r_0_0]]]
normalized: EX [E [true U [1<=r_7_1 & 3<=r_0_0]]]

abstracting: (3<=r_0_0) states: 0
abstracting: (1<=r_7_1) states: 433,920 (5)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [AF [~ [p_3_0<=r_0_2]]]
normalized: EX [~ [EG [p_3_0<=r_0_2]]]

abstracting: (p_3_0<=r_0_2) states: 765,952 (5)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[AF [p_8_0<=p_2_1] & 2<=p_2_1]]
normalized: E [true U [2<=p_2_1 & ~ [EG [~ [p_8_0<=p_2_1]]]]]

abstracting: (p_8_0<=p_2_1) states: 644,224 (5)
................
EG iterations: 16
abstracting: (2<=p_2_1) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: E [r_9_1<=r_6_2 U AF [2<=p_3_2]]
normalized: E [r_9_1<=r_6_2 U ~ [EG [~ [2<=p_3_2]]]]

abstracting: (2<=p_3_2) states: 0

EG iterations: 0
abstracting: (r_9_1<=r_6_2) states: 563,008 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[EF [2<=r_8_0] & EF [r_9_1<=p_4_1]]]
normalized: E [true U [E [true U r_9_1<=p_4_1] & E [true U 2<=r_8_0]]]

abstracting: (2<=r_8_0) states: 0
abstracting: (r_9_1<=p_4_1) states: 458,880 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[EF [p_3_1<=p_0_1] | 3<=p_6_2]]
normalized: ~ [E [true U ~ [[3<=p_6_2 | E [true U p_3_1<=p_0_1]]]]]

abstracting: (p_3_1<=p_0_1) states: 692,416 (5)
abstracting: (3<=p_6_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: EF [AG [[r_6_1<=r_7_1 & 3<=r_7_2]]]
normalized: E [true U ~ [E [true U ~ [[r_6_1<=r_7_1 & 3<=r_7_2]]]]]

abstracting: (3<=r_7_2) states: 0
abstracting: (r_6_1<=r_7_1) states: 735,232 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [~ [AG [~ [3<=r_9_2]]] & E [p_1_1<=r_8_2 U [3<=r_9_1 | 1<=r_2_2]]]
normalized: [E [p_1_1<=r_8_2 U [3<=r_9_1 | 1<=r_2_2]] & E [true U 3<=r_9_2]]

abstracting: (3<=r_9_2) states: 0
abstracting: (1<=r_2_2) states: 379,392 (5)
abstracting: (3<=r_9_1) states: 0
abstracting: (p_1_1<=r_8_2) states: 746,432 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: ~ [[E [p_0_2<=p_6_2 U 2<=p_1_0] & E [1<=r_9_0 U p_9_2<=p_8_0]]]
normalized: ~ [[E [1<=r_9_0 U p_9_2<=p_8_0] & E [p_0_2<=p_6_2 U 2<=p_1_0]]]

abstracting: (2<=p_1_0) states: 0
abstracting: (p_0_2<=p_6_2) states: 614,144 (5)
abstracting: (p_9_2<=p_8_0) states: 556,992 (5)
abstracting: (1<=r_9_0) states: 584,704 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [[A [r_7_2<=p_8_0 U p_7_2<=p_5_1] & EF [[2<=p_2_1 & 3<=r_2_0]]]]
normalized: ~ [[E [true U [2<=p_2_1 & 3<=r_2_0]] & [~ [E [~ [p_7_2<=p_5_1] U [~ [p_7_2<=p_5_1] & ~ [r_7_2<=p_8_0]]]] & ~ [EG [~ [p_7_2<=p_5_1]]]]]]

abstracting: (p_7_2<=p_5_1) states: 585,472 (5)
.............
EG iterations: 13
abstracting: (r_7_2<=p_8_0) states: 532,992 (5)
abstracting: (p_7_2<=p_5_1) states: 585,472 (5)
abstracting: (p_7_2<=p_5_1) states: 585,472 (5)
abstracting: (3<=r_2_0) states: 0
abstracting: (2<=p_2_1) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: E [EG [r_3_1<=r_2_2] U ~ [[p_4_2<=p_9_1 & p_7_1<=r_8_2]]]
normalized: E [EG [r_3_1<=r_2_2] U ~ [[p_4_2<=p_9_1 & p_7_1<=r_8_2]]]

abstracting: (p_7_1<=r_8_2) states: 700,416 (5)
abstracting: (p_4_2<=p_9_1) states: 752,896 (5)
abstracting: (r_3_1<=r_2_2) states: 593,152 (5)
...............
EG iterations: 15
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: AG [[EF [3<=r_9_0] | [[p_2_1<=r_5_1 & r_4_2<=r_6_1] & 3<=p_8_1]]]
normalized: ~ [E [true U ~ [[E [true U 3<=r_9_0] | [3<=p_8_1 & [p_2_1<=r_5_1 & r_4_2<=r_6_1]]]]]]

abstracting: (r_4_2<=r_6_1) states: 619,008 (5)
abstracting: (p_2_1<=r_5_1) states: 707,840 (5)
abstracting: (3<=p_8_1) states: 0
abstracting: (3<=r_9_0) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[[1<=r_9_2 | r_7_0<=p_0_2] & [p_2_0<=r_6_1 | 3<=r_5_2]] U [~ [3<=r_9_0] & 3<=r_8_2]]
normalized: E [[[1<=r_9_2 | r_7_0<=p_0_2] & [p_2_0<=r_6_1 | 3<=r_5_2]] U [3<=r_8_2 & ~ [3<=r_9_0]]]

abstracting: (3<=r_9_0) states: 0
abstracting: (3<=r_8_2) states: 0
abstracting: (3<=r_5_2) states: 0
abstracting: (p_2_0<=r_6_1) states: 639,488 (5)
abstracting: (r_7_0<=p_0_2) states: 520,320 (5)
abstracting: (1<=r_9_2) states: 444,288 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec


Total processing time: 0m 5.951sec


BK_STOP 1463777726412

--------------------
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:306 (7), effective:60 (1)

initing FirstDep: 0m 0.000sec


iterations count:326 (8), effective:59 (1)

iterations count:219 (5), effective:37 (0)

iterations count:187 (4), effective:26 (0)

iterations count:127 (3), effective:13 (0)

iterations count:75 (1), effective:7 (0)

iterations count:131 (3), effective:18 (0)

iterations count:40 (1), effective:0 (0)

iterations count:70 (1), effective:4 (0)

iterations count:50 (1), effective:2 (0)

iterations count:210 (5), effective:26 (0)

iterations count:40 (1), effective:0 (0)

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="ResAllocation-PT-R003C010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 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 ResAllocation-PT-R003C010, 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 r101kn-smll-146369143900300"
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 '' CTLCardinality.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 ;