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_ResAllocation-PT-R003C015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128500309
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464598297377


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_R003C015
(NrP: 90 NrTr: 60 NrArc: 264)

net check time: 0m 0.000sec

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

init dd package: 0m 4.375sec


RS generation: 0m 0.011sec


-> reachability set: #nodes 586 (5.9e+02) #states 578,878,464 (8)



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

checking: EF [AX [2<=r_2_0]]
normalized: E [true U ~ [EX [~ [2<=r_2_0]]]]

abstracting: (2<=r_2_0) states: 0
.-> the formula is TRUE

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

MC time: 0m 0.046sec

checking: AF [3<=r_4_2]
normalized: ~ [EG [~ [3<=r_4_2]]]

abstracting: (3<=r_4_2) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AF [[1<=p_9_2 | EX [3<=p_1_0]]]
normalized: ~ [EG [~ [[1<=p_9_2 | EX [3<=p_1_0]]]]]

abstracting: (3<=p_1_0) states: 0
.abstracting: (1<=p_9_2) states: 221,420,544 (8)
...........................
EG iterations: 27
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.279sec

checking: E [~ [2<=r_8_0] U 3<=p_4_2]
normalized: E [~ [2<=r_8_0] U 3<=p_4_2]

abstracting: (3<=p_4_2) states: 0
abstracting: (2<=r_8_0) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EG [r_1_1<=r_0_1]
normalized: EG [r_1_1<=r_0_1]

abstracting: (r_1_1<=r_0_1) states: 438,099,968 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: E [EF [3<=r_5_0] U ~ [p_13_1<=p_0_2]]
normalized: E [E [true U 3<=r_5_0] U ~ [p_13_1<=p_0_2]]

abstracting: (p_13_1<=p_0_2) states: 507,785,728 (8)
abstracting: (3<=r_5_0) states: 0
-> the formula is FALSE

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

MC time: 0m 0.013sec

checking: AF [AG [[p_6_1<=p_10_2 | 3<=r_11_2]]]
normalized: ~ [EG [E [true U ~ [[p_6_1<=p_10_2 | 3<=r_11_2]]]]]

abstracting: (3<=r_11_2) states: 0
abstracting: (p_6_1<=p_10_2) states: 452,254,720 (8)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.038sec

checking: [AX [p_7_1<=p_4_1] & AF [AX [3<=p_4_0]]]
normalized: [~ [EG [EX [~ [3<=p_4_0]]]] & ~ [EX [~ [p_7_1<=p_4_1]]]]

abstracting: (p_7_1<=p_4_1) states: 462,781,696 (8)
.abstracting: (3<=p_4_0) states: 0
.........................
EG iterations: 24
-> the formula is FALSE

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

MC time: 0m 0.245sec

checking: AF [EG [[1<=p_6_0 & p_7_0<=r_1_1]]]
normalized: ~ [EG [~ [EG [[1<=p_6_0 & p_7_0<=r_1_1]]]]]

abstracting: (p_7_0<=r_1_1) states: 544,859,648 (8)
abstracting: (1<=p_6_0) states: 226,552,832 (8)
.....................
EG iterations: 21
........................
EG iterations: 24
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.462sec

checking: EG [A [3<=p_3_1 U p_10_2<=p_14_2]]
normalized: EG [[~ [E [~ [p_10_2<=p_14_2] U [~ [p_10_2<=p_14_2] & ~ [3<=p_3_1]]]] & ~ [EG [~ [p_10_2<=p_14_2]]]]]

abstracting: (p_10_2<=p_14_2) states: 525,441,024 (8)
........................
EG iterations: 24
abstracting: (3<=p_3_1) states: 0
abstracting: (p_10_2<=p_14_2) states: 525,441,024 (8)
abstracting: (p_10_2<=p_14_2) states: 525,441,024 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.114sec

checking: ~ [~ [[AF [2<=r_6_2] | [~ [1<=r_11_2] | [3<=r_1_2 | 3<=p_14_2]]]]]
normalized: [~ [EG [~ [2<=r_6_2]]] | [~ [1<=r_11_2] | [3<=r_1_2 | 3<=p_14_2]]]

abstracting: (3<=p_14_2) states: 0
abstracting: (3<=r_1_2) states: 0
abstracting: (1<=r_11_2) states: 267,206,656 (8)
abstracting: (2<=r_6_2) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: [AX [2<=r_9_0] | EF [~ [[p_5_0<=r_12_0 | 3<=p_7_1]]]]
normalized: [E [true U ~ [[p_5_0<=r_12_0 | 3<=p_7_1]]] | ~ [EX [~ [2<=r_9_0]]]]

abstracting: (2<=r_9_0) states: 0
.abstracting: (3<=p_7_1) states: 0
abstracting: (p_5_0<=r_12_0) states: 543,235,072 (8)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: [~ [[2<=p_9_0 | AF [3<=r_10_1]]] & [p_13_2<=p_3_2 | 3<=p_14_0]]
normalized: [[p_13_2<=p_3_2 | 3<=p_14_0] & ~ [[2<=p_9_0 | ~ [EG [~ [3<=r_10_1]]]]]]

abstracting: (3<=r_10_1) states: 0

EG iterations: 0
abstracting: (2<=p_9_0) states: 0
abstracting: (3<=p_14_0) states: 0
abstracting: (p_13_2<=p_3_2) states: 464,899,072 (8)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [r_10_0<=p_2_0 | [[AF [2<=r_10_2] | EF [3<=p_2_0]] & ~ [EX [3<=p_7_2]]]]
normalized: [r_10_0<=p_2_0 | [~ [EX [3<=p_7_2]] & [~ [EG [~ [2<=r_10_2]]] | E [true U 3<=p_2_0]]]]

abstracting: (3<=p_2_0) states: 0
abstracting: (2<=r_10_2) states: 0

EG iterations: 0
abstracting: (3<=p_7_2) states: 0
.abstracting: (r_10_0<=p_2_0) states: 413,180,928 (8)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: [EF [AG [p_1_2<=p_13_1]] | A [r_8_2<=r_12_1 U [1<=r_2_1 & 2<=r_6_0]]]
normalized: [[~ [EG [~ [[1<=r_2_1 & 2<=r_6_0]]]] & ~ [E [~ [[1<=r_2_1 & 2<=r_6_0]] U [~ [r_8_2<=r_12_1] & ~ [[1<=r_2_1 & 2<=r_6_0]]]]]] | E [true U ~ [E [true U ~ [p_1_2<=p_13_1]]]]]

abstracting: (p_1_2<=p_13_1) states: 429,391,616 (8)
abstracting: (2<=r_6_0) states: 0
abstracting: (1<=r_2_1) states: 270,111,744 (8)
abstracting: (r_8_2<=r_12_1) states: 445,300,736 (8)
abstracting: (2<=r_6_0) states: 0
abstracting: (1<=r_2_1) states: 270,111,744 (8)
abstracting: (2<=r_6_0) states: 0
abstracting: (1<=r_2_1) states: 270,111,744 (8)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.028sec

checking: EF [[EG [2<=r_0_2] & [[r_0_0<=p_2_1 | 1<=p_5_0] | [r_11_2<=r_1_2 | r_3_1<=r_4_2]]]]
normalized: E [true U [[[r_11_2<=r_1_2 | r_3_1<=r_4_2] | [r_0_0<=p_2_1 | 1<=p_5_0]] & EG [2<=r_0_2]]]

abstracting: (2<=r_0_2) states: 0
.
EG iterations: 1
abstracting: (1<=p_5_0) states: 72,609,792 (7)
abstracting: (r_0_0<=p_2_1) states: 399,332,352 (8)
abstracting: (r_3_1<=r_4_2) states: 425,595,392 (8)
abstracting: (r_11_2<=r_1_2) states: 450,202,624 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec


Total processing time: 0m 7.581sec


BK_STOP 1464598304998

--------------------
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:459 (7), effective:90 (1)

initing FirstDep: 0m 0.000sec


iterations count:582 (9), effective:96 (1)

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

iterations count:120 (2), effective:9 (0)

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

iterations count:172 (2), effective:17 (0)

iterations count:89 (1), effective:5 (0)

iterations count:124 (2), effective:11 (0)

iterations count:142 (2), effective:14 (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="S_ResAllocation-PT-R003C015"
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/S_ResAllocation-PT-R003C015.tgz
mv S_ResAllocation-PT-R003C015 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_ResAllocation-PT-R003C015, 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 r185kn-smll-146444128500309"
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 ;