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-R020C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128700376
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464600065948


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: ResAllocation_PT_R020C002
(NrP: 80 NrTr: 42 NrArc: 200)

net check time: 0m 0.000sec

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

init dd package: 0m 3.675sec


RS generation: 0m 0.032sec


-> reachability set: #nodes 226 (2.3e+02) #states 11,534,336 (7)



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

checking: AG [~ [2<=r_1_12]]
normalized: ~ [E [true U 2<=r_1_12]]

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

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=r_1_15) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=r_0_6]
normalized: E [true U 2<=r_0_6]

abstracting: (2<=r_0_6) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=p_0_5]
normalized: E [true U 2<=p_0_5]

abstracting: (2<=p_0_5) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=r_1_15]
normalized: E [true U 2<=r_1_15]

abstracting: (2<=r_1_15) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[3<=p_0_4 | [~ [2<=r_1_13] | ~ [3<=p_1_18]]]]
normalized: ~ [E [true U ~ [[3<=p_0_4 | [~ [2<=r_1_13] | ~ [3<=p_1_18]]]]]]

abstracting: (3<=p_1_18) states: 0
abstracting: (2<=r_1_13) states: 0
abstracting: (3<=p_0_4) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [~ [p_1_7<=r_0_19]] | p_1_10<=r_0_0]]
normalized: ~ [E [true U ~ [[p_1_7<=r_0_19 | p_1_10<=r_0_0]]]]

abstracting: (p_1_10<=r_0_0) states: 9,830,400 (6)
abstracting: (p_1_7<=r_0_19) states: 10,354,688 (7)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EF [[3<=r_1_5 & ~ [[2<=p_0_1 & r_1_14<=r_1_0]]]]
normalized: E [true U [3<=r_1_5 & ~ [[2<=p_0_1 & r_1_14<=r_1_0]]]]

abstracting: (r_1_14<=r_1_0) states: 11,272,192 (7)
abstracting: (2<=p_0_1) states: 0
abstracting: (3<=r_1_5) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [1<=p_1_7] & [r_0_0<=r_0_8 | 2<=r_1_4]] & 1<=p_1_1]]
normalized: E [true U [1<=p_1_1 & [~ [1<=p_1_7] & [r_0_0<=r_0_8 | 2<=r_1_4]]]]

abstracting: (2<=r_1_4) states: 0
abstracting: (r_0_0<=r_0_8) states: 8,650,752 (6)
abstracting: (1<=p_1_7) states: 2,359,296 (6)
abstracting: (1<=p_1_1) states: 786,432 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [[r_0_4<=r_1_5 | [[1<=r_1_8 | 3<=p_0_0] | ~ [2<=r_1_19]]]]
normalized: ~ [E [true U ~ [[r_0_4<=r_1_5 | [~ [2<=r_1_19] | [1<=r_1_8 | 3<=p_0_0]]]]]]

abstracting: (3<=p_0_0) states: 0
abstracting: (1<=r_1_8) states: 8,912,896 (6)
abstracting: (2<=r_1_19) states: 0
abstracting: (r_0_4<=r_1_5) states: 10,747,904 (7)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [r_0_2<=r_1_9] | [2<=r_1_8 | 3<=p_1_13]] & 1<=p_1_5]]
normalized: E [true U [1<=p_1_5 & [[2<=r_1_8 | 3<=p_1_13] | ~ [r_0_2<=r_1_9]]]]

abstracting: (r_0_2<=r_1_9) states: 10,223,616 (7)
abstracting: (3<=p_1_13) states: 0
abstracting: (2<=r_1_8) states: 0
abstracting: (1<=p_1_5) states: 1,835,008 (6)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [[~ [[3<=r_0_16 & p_1_12<=p_0_9]] | ~ [[1<=r_0_4 & r_0_0<=r_0_13]]]]
normalized: ~ [E [true U ~ [[~ [[1<=r_0_4 & r_0_0<=r_0_13]] | ~ [[3<=r_0_16 & p_1_12<=p_0_9]]]]]]

abstracting: (p_1_12<=p_0_9) states: 8,388,608 (6)
abstracting: (3<=r_0_16) states: 0
abstracting: (r_0_0<=r_0_13) states: 8,650,752 (6)
abstracting: (1<=r_0_4) states: 5,505,024 (6)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[p_0_3<=r_0_9 | [1<=p_0_6 & 3<=r_1_7]] | ~ [[1<=p_1_10 | 2<=r_1_15]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p_1_10 | 2<=r_1_15]] | [p_0_3<=r_0_9 | [1<=p_0_6 & 3<=r_1_7]]]]]]

abstracting: (3<=r_1_7) states: 0
abstracting: (1<=p_0_6) states: 3,932,160 (6)
abstracting: (p_0_3<=r_0_9) states: 9,043,968 (6)
abstracting: (2<=r_1_15) states: 0
abstracting: (1<=p_1_10) states: 3,145,728 (6)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [[[r_0_1<=p_1_14 & ~ [1<=p_0_1]] & [2<=r_0_6 & [p_1_12<=p_1_6 & p_0_9<=p_0_2]]]]
normalized: E [true U [[2<=r_0_6 & [p_1_12<=p_1_6 & p_0_9<=p_0_2]] & [r_0_1<=p_1_14 & ~ [1<=p_0_1]]]]

abstracting: (1<=p_0_1) states: 5,242,880 (6)
abstracting: (r_0_1<=p_1_14) states: 7,995,392 (6)
abstracting: (p_0_9<=p_0_2) states: 9,961,472 (6)
abstracting: (p_1_12<=p_1_6) states: 8,912,896 (6)
abstracting: (2<=r_0_6) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[p_1_4<=p_1_9 | [p_1_13<=p_1_14 & r_0_18<=r_1_2]] | [[2<=p_0_1 & 3<=p_0_8] & ~ [2<=r_1_6]]]]
normalized: ~ [E [true U ~ [[[p_1_4<=p_1_9 | [p_1_13<=p_1_14 & r_0_18<=r_1_2]] | [~ [2<=r_1_6] & [2<=p_0_1 & 3<=p_0_8]]]]]]

abstracting: (3<=p_0_8) states: 0
abstracting: (2<=p_0_1) states: 0
abstracting: (2<=r_1_6) states: 0
abstracting: (r_0_18<=r_1_2) states: 11,010,048 (7)
abstracting: (p_1_13<=p_1_14) states: 9,568,256 (6)
abstracting: (p_1_4<=p_1_9) states: 10,747,904 (7)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [[[[r_1_8<=p_1_13 & p_0_0<=r_1_3] | [r_1_16<=p_0_10 | r_1_8<=p_0_11]] & [3<=r_1_5 & [r_0_15<=r_0_15 | r_0_11<=r_1_10]]]]
normalized: E [true U [[3<=r_1_5 & [r_0_15<=r_0_15 | r_0_11<=r_1_10]] & [[r_1_16<=p_0_10 | r_1_8<=p_0_11] | [r_1_8<=p_1_13 & p_0_0<=r_1_3]]]]

abstracting: (p_0_0<=r_1_3) states: 11,010,048 (7)
abstracting: (r_1_8<=p_1_13) states: 5,242,880 (6)
abstracting: (r_1_8<=p_0_11) states: 5,242,880 (6)
abstracting: (r_1_16<=p_0_10) states: 6,684,672 (6)
abstracting: (r_0_11<=r_1_10) states: 9,961,472 (6)
abstracting: (r_0_15<=r_0_15) states: 11,534,336 (7)
abstracting: (3<=r_1_5) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec


Total processing time: 0m 5.299sec


BK_STOP 1464600071282

--------------------
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.001sec

467
iterations count:1569 (37), effective:420 (10)

initing FirstDep: 0m 0.000sec

309
iterations count:1181 (28), effective:326 (7)

iterations count:823 (19), effective:222 (5)

iterations count:620 (14), effective:167 (3)

iterations count:512 (12), effective:145 (3)

iterations count:672 (16), effective:185 (4)

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-R020C002"
export BK_EXAMINATION="ReachabilityCardinality"
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-R020C002.tgz
mv S_ResAllocation-PT-R020C002 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-R020C002, 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 r185kn-smll-146444128700376"
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 ;