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

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

=== Now, execution of the tool begins

BK_START 1464598344520


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_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.096sec


RS generation: 0m 0.011sec


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



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

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

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

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

MC time: 0m 0.000sec

checking: AG [p_13_1<=r_7_1]
normalized: ~ [E [true U ~ [p_13_1<=r_7_1]]]

abstracting: (p_13_1<=r_7_1) states: 528,266,496 (8)
-> the formula is FALSE

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

MC time: 0m 0.019sec

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

abstracting: (p_11_0<=r_9_1) states: 552,971,264 (8)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[~ [~ [2<=r_9_1]] & ~ [~ [2<=r_13_1]]]]
normalized: E [true U [2<=r_9_1 & 2<=r_13_1]]

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

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

MC time: 0m 0.000sec

checking: EF [~ [~ [[2<=p_13_0 & r_7_0<=p_11_2]]]]
normalized: E [true U [2<=p_13_0 & r_7_0<=p_11_2]]

abstracting: (r_7_0<=p_11_2) states: 404,357,120 (8)
abstracting: (2<=p_13_0) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[2<=p_13_2 & r_0_0<=p_5_2]]]]
normalized: E [true U [2<=p_13_2 & r_0_0<=p_5_2]]

abstracting: (r_0_0<=p_5_2) states: 413,419,520 (8)
abstracting: (2<=p_13_2) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[[~ [p_3_1<=p_2_1] | ~ [3<=r_14_1]] & 2<=r_2_2]]
normalized: E [true U [2<=r_2_2 & [~ [3<=r_14_1] | ~ [p_3_1<=p_2_1]]]]

abstracting: (p_3_1<=p_2_1) states: 444,541,952 (8)
abstracting: (3<=r_14_1) states: 0
abstracting: (2<=r_2_2) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [~ [[~ [r_14_1<=r_5_1] & ~ [p_10_2<=p_2_0]]]]
normalized: ~ [E [true U [~ [r_14_1<=r_5_1] & ~ [p_10_2<=p_2_0]]]]

abstracting: (p_10_2<=p_2_0) states: 531,162,112 (8)
abstracting: (r_14_1<=r_5_1) states: 399,723,520 (8)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EF [[[~ [p_5_0<=r_8_0] | 3<=r_7_2] & ~ [~ [2<=p_9_0]]]]
normalized: E [true U [2<=p_9_0 & [3<=r_7_2 | ~ [p_5_0<=r_8_0]]]]

abstracting: (p_5_0<=r_8_0) states: 544,168,960 (8)
abstracting: (3<=r_7_2) states: 0
abstracting: (2<=p_9_0) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[p_14_2<=p_3_0 | [1<=r_6_0 | ~ [1<=p_11_2]]]]
normalized: ~ [E [true U ~ [[p_14_2<=p_3_0 | [1<=r_6_0 | ~ [1<=p_11_2]]]]]]

abstracting: (1<=p_11_2) states: 213,769,216 (8)
abstracting: (1<=r_6_0) states: 278,227,968 (8)
abstracting: (p_14_2<=p_3_0) states: 429,673,472 (8)
-> the formula is FALSE

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

MC time: 0m 0.013sec

checking: EF [[[[p_6_0<=p_7_1 | 2<=r_5_1] | 1<=r_10_1] & 2<=p_7_0]]
normalized: E [true U [2<=p_7_0 & [1<=r_10_1 | [p_6_0<=p_7_1 | 2<=r_5_1]]]]

abstracting: (2<=r_5_1) states: 0
abstracting: (p_6_0<=p_7_1) states: 397,978,624 (8)
abstracting: (1<=r_10_1) states: 287,965,696 (8)
abstracting: (2<=p_7_0) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[[[1<=r_8_2 | 2<=r_12_0] & [3<=r_12_1 & p_13_2<=p_11_2]] & ~ [1<=r_12_0]]]
normalized: E [true U [~ [1<=r_12_0] & [[3<=r_12_1 & p_13_2<=p_11_2] & [1<=r_8_2 | 2<=r_12_0]]]]

abstracting: (2<=r_12_0) states: 0
abstracting: (1<=r_8_2) states: 279,429,120 (8)
abstracting: (p_13_2<=p_11_2) states: 478,678,016 (8)
abstracting: (3<=r_12_1) states: 0
abstracting: (1<=r_12_0) states: 293,114,880 (8)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[[~ [3<=p_3_2] & [2<=p_9_2 & p_3_2<=r_3_1]] & p_12_1<=r_12_1]]
normalized: E [true U [p_12_1<=r_12_1 & [[2<=p_9_2 & p_3_2<=r_3_1] & ~ [3<=p_3_2]]]]

abstracting: (3<=p_3_2) states: 0
abstracting: (p_3_2<=r_3_1) states: 466,075,648 (8)
abstracting: (2<=p_9_2) states: 0
abstracting: (p_12_1<=r_12_1) states: 404,448,256 (8)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[~ [[2<=r_10_0 | p_14_1<=r_0_1]] | [~ [3<=p_9_1] & [p_3_1<=r_0_2 & 2<=r_3_2]]]]
normalized: E [true U [[[p_3_1<=r_0_2 & 2<=r_3_2] & ~ [3<=p_9_1]] | ~ [[2<=r_10_0 | p_14_1<=r_0_1]]]]

abstracting: (p_14_1<=r_0_1) states: 449,617,920 (8)
abstracting: (2<=r_10_0) states: 0
abstracting: (3<=p_9_1) states: 0
abstracting: (2<=r_3_2) states: 0
abstracting: (p_3_1<=r_0_2) states: 497,149,952 (8)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AG [[[[1<=r_5_0 & 1<=p_12_1] | [r_9_2<=r_11_1 | p_12_2<=p_12_2]] | [[1<=p_5_1 & 3<=p_8_1] | ~ [r_1_2<=p_0_0]]]]
normalized: ~ [E [true U ~ [[[~ [r_1_2<=p_0_0] | [1<=p_5_1 & 3<=p_8_1]] | [[r_9_2<=r_11_1 | p_12_2<=p_12_2] | [1<=r_5_0 & 1<=p_12_1]]]]]]

abstracting: (1<=p_12_1) states: 174,430,208 (8)
abstracting: (1<=r_5_0) states: 279,715,840 (8)
abstracting: (p_12_2<=p_12_2) states: 578,878,464 (8)
abstracting: (r_9_2<=r_11_1) states: 428,002,304 (8)
abstracting: (3<=p_8_1) states: 0
abstracting: (1<=p_5_1) states: 144,236,544 (8)
abstracting: (r_1_2<=p_0_0) states: 417,455,104 (8)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[[[r_6_1<=r_11_1 & 3<=p_5_0] | 1<=p_10_0] & [[3<=r_12_1 | 3<=p_0_1] & [r_7_0<=r_5_2 | p_0_1<=r_1_1]]]]
normalized: E [true U [[[3<=r_12_1 | 3<=p_0_1] & [r_7_0<=r_5_2 | p_0_1<=r_1_1]] & [1<=p_10_0 | [r_6_1<=r_11_1 & 3<=p_5_0]]]]

abstracting: (3<=p_5_0) states: 0
abstracting: (r_6_1<=r_11_1) states: 429,965,312 (8)
abstracting: (1<=p_10_0) states: 229,746,176 (8)
abstracting: (p_0_1<=r_1_1) states: 491,663,360 (8)
abstracting: (r_7_0<=r_5_2) states: 433,058,816 (8)
abstracting: (3<=p_0_1) states: 0
abstracting: (3<=r_12_1) states: 0
-> the formula is FALSE

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

MC time: 0m 0.003sec


Total processing time: 0m 5.758sec


BK_STOP 1464598350311

--------------------
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:168 (2), effective:18 (0)

iterations count:193 (3), effective:20 (0)

iterations count:257 (4), effective:30 (0)

iterations count:156 (2), effective:15 (0)

iterations count:108 (1), effective:10 (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="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-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 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-146444128500313"
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 ;