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

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

=== Now, execution of the tool begins

BK_START 1464602471976


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_R050C002
(NrP: 200 NrTr: 102 NrArc: 500)

net check time: 0m 0.000sec

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

init dd package: 0m 4.049sec


RS generation: 0m 0.368sec


-> reachability set: #nodes 556 (5.6e+02) #states 29,273,397,577,908,224 (16)



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

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [p_1_6<=p_1_23]
normalized: ~ [E [true U ~ [p_1_6<=p_1_23]]]

abstracting: (p_1_6<=p_1_23) states: 28,147,497,671,065,600 (16)
-> the formula is FALSE

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

MC time: 0m 0.286sec

checking: AG [p_0_33<=p_0_37]
normalized: ~ [E [true U ~ [p_0_33<=p_0_37]]]

abstracting: (p_0_33<=p_0_37) states: 26,177,172,834,091,008 (16)
-> the formula is FALSE

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

MC time: 0m 0.139sec

checking: EF [[r_1_24<=r_0_39 & 3<=p_0_4]]
normalized: E [true U [r_1_24<=r_0_39 & 3<=p_0_4]]

abstracting: (3<=p_0_4) states: 0
abstracting: (r_1_24<=r_0_39) states: 18,014,398,509,481,984 (16)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[r_0_7<=p_1_28 | ~ [~ [p_0_37<=p_1_20]]]]
normalized: ~ [E [true U ~ [[r_0_7<=p_1_28 | p_0_37<=p_1_20]]]]

abstracting: (p_0_37<=p_1_20) states: 25,332,747,903,959,040 (16)
abstracting: (r_0_7<=p_1_28) states: 18,999,560,927,969,280 (16)
-> the formula is FALSE

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

MC time: 0m 0.194sec

checking: EF [[~ [[p_0_30<=p_1_8 | 3<=r_1_38]] & 3<=r_1_2]]
normalized: E [true U [3<=r_1_2 & ~ [[p_0_30<=p_1_8 | 3<=r_1_38]]]]

abstracting: (3<=r_1_38) states: 0
abstracting: (p_0_30<=p_1_8) states: 23,362,423,066,984,448 (16)
abstracting: (3<=r_1_2) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[[p_0_21<=r_0_9 | ~ [3<=r_1_38]] | 3<=p_0_15]]
normalized: ~ [E [true U ~ [[3<=p_0_15 | [p_0_21<=r_0_9 | ~ [3<=r_1_38]]]]]]

abstracting: (3<=r_1_38) states: 0
abstracting: (p_0_21<=r_0_9) states: 25,051,272,927,248,384 (16)
abstracting: (3<=p_0_15) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[2<=p_1_44 & ~ [3<=r_0_21]] & [p_1_20<=p_0_4 & 2<=r_1_36]]]
normalized: E [true U [[2<=p_1_44 & ~ [3<=r_0_21]] & [p_1_20<=p_0_4 & 2<=r_1_36]]]

abstracting: (2<=r_1_36) states: 0
abstracting: (p_1_20<=p_0_4) states: 25,473,485,392,314,368 (16)
abstracting: (3<=r_0_21) states: 0
abstracting: (2<=p_1_44) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[~ [p_1_48<=r_0_44] & [~ [r_0_1<=r_1_12] | ~ [r_0_7<=r_1_23]]]]
normalized: E [true U [~ [p_1_48<=r_0_44] & [~ [r_0_1<=r_1_12] | ~ [r_0_7<=r_1_23]]]]

abstracting: (r_0_7<=r_1_23) states: 25,895,697,857,380,352 (16)
abstracting: (r_0_1<=r_1_12) states: 27,443,810,229,288,960 (16)
abstracting: (p_1_48<=r_0_44) states: 22,095,785,671,786,496 (16)
-> the formula is TRUE

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

MC time: 0m 0.321sec

checking: EF [[~ [[p_1_4<=r_0_21 | 1<=p_1_4]] & [~ [r_1_28<=r_1_43] | ~ [p_0_3<=r_0_11]]]]
normalized: E [true U [~ [[p_1_4<=r_0_21 | 1<=p_1_4]] & [~ [r_1_28<=r_1_43] | ~ [p_0_3<=r_0_11]]]]

abstracting: (p_0_3<=r_0_11) states: 22,377,260,648,497,152 (16)
abstracting: (r_1_28<=r_1_43) states: 20,829,148,276,588,544 (16)
abstracting: (1<=p_1_4) states: 1,688,849,860,263,936 (15)
abstracting: (p_1_4<=r_0_21) states: 28,428,972,647,776,256 (16)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: EF [[[[2<=r_1_41 | r_1_47<=r_1_47] & [3<=r_1_18 & 1<=r_1_21]] & [1<=r_1_8 | r_1_44<=p_1_49]]]
normalized: E [true U [[1<=r_1_8 | r_1_44<=p_1_49] & [[3<=r_1_18 & 1<=r_1_21] & [2<=r_1_41 | r_1_47<=r_1_47]]]]

abstracting: (r_1_47<=r_1_47) states: 29,273,397,577,908,224 (16)
abstracting: (2<=r_1_41) states: 0
abstracting: (1<=r_1_21) states: 22,799,473,113,563,136 (16)
abstracting: (3<=r_1_18) states: 0
abstracting: (r_1_44<=p_1_49) states: 20,829,148,276,588,544 (16)
abstracting: (1<=r_1_8) states: 26,458,647,810,801,664 (16)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[[[3<=r_1_42 & 3<=r_0_46] & [p_1_0<=p_1_35 & 1<=r_1_2]] | [~ [1<=p_1_22] & p_1_30<=r_0_3]]]
normalized: ~ [E [true U ~ [[[p_1_30<=r_0_3 & ~ [1<=p_1_22]] | [[p_1_0<=p_1_35 & 1<=r_1_2] & [3<=r_1_42 & 3<=r_0_46]]]]]]

abstracting: (3<=r_0_46) states: 0
abstracting: (3<=r_1_42) states: 0
abstracting: (1<=r_1_2) states: 28,147,497,671,065,600 (16)
abstracting: (p_1_0<=p_1_35) states: 28,991,922,601,197,568 (16)
abstracting: (1<=p_1_22) states: 6,755,399,441,055,744 (15)
abstracting: (p_1_30<=r_0_3) states: 24,629,060,462,182,400 (16)
-> the formula is FALSE

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

MC time: 0m 0.235sec

checking: EF [[[[r_1_15<=p_0_0 | 3<=p_1_48] & [p_1_6<=p_1_36 | 2<=p_0_42]] & [[2<=r_0_7 & 2<=p_1_48] & p_0_24<=r_0_25]]]
normalized: E [true U [[p_0_24<=r_0_25 & [2<=r_0_7 & 2<=p_1_48]] & [[p_1_6<=p_1_36 | 2<=p_0_42] & [r_1_15<=p_0_0 | 3<=p_1_48]]]]

abstracting: (3<=p_1_48) states: 0
abstracting: (r_1_15<=p_0_0) states: 16,888,498,602,639,360 (16)
abstracting: (2<=p_0_42) states: 0
abstracting: (p_1_6<=p_1_36) states: 28,147,497,671,065,600 (16)
abstracting: (2<=p_1_48) states: 0
abstracting: (2<=r_0_7) states: 0
abstracting: (p_0_24<=r_0_25) states: 25,332,747,903,959,040 (16)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[r_1_17<=p_0_19 | [[p_0_37<=r_1_23 | r_1_5<=r_0_39] & [r_1_22<=p_0_16 | p_1_14<=r_0_32]]]]
normalized: ~ [E [true U ~ [[r_1_17<=p_0_19 | [[r_1_22<=p_0_16 | p_1_14<=r_0_32] & [p_0_37<=r_1_23 | r_1_5<=r_0_39]]]]]]

abstracting: (r_1_5<=r_0_39) states: 15,340,386,230,730,752 (16)
abstracting: (p_0_37<=r_1_23) states: 29,273,397,577,908,224 (16)
abstracting: (p_1_14<=r_0_32) states: 27,021,597,764,222,976 (16)
abstracting: (r_1_22<=p_0_16) states: 15,621,861,207,441,408 (16)
abstracting: (r_1_17<=p_0_19) states: 14,355,223,812,243,456 (16)
-> the formula is FALSE

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

MC time: 0m 0.171sec

checking: AG [[[[p_1_23<=r_0_19 | p_0_33<=r_0_33] | 3<=p_0_13] | [[3<=p_1_24 | r_0_41<=p_1_19] | [r_1_44<=r_0_26 & r_1_27<=p_1_45]]]]
normalized: ~ [E [true U ~ [[[3<=p_0_13 | [p_1_23<=r_0_19 | p_0_33<=r_0_33]] | [[3<=p_1_24 | r_0_41<=p_1_19] | [r_1_44<=r_0_26 & r_1_27<=p_1_45]]]]]]

abstracting: (r_1_27<=p_1_45) states: 17,310,711,067,705,344 (16)
abstracting: (r_1_44<=r_0_26) states: 20,969,885,764,943,872 (16)
abstracting: (r_0_41<=p_1_19) states: 17,873,661,021,126,656 (16)
abstracting: (3<=p_1_24) states: 0
abstracting: (p_0_33<=r_0_33) states: 24,206,847,997,116,416 (16)
abstracting: (p_1_23<=r_0_19) states: 25,614,222,880,669,696 (16)
abstracting: (3<=p_0_13) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec


Total processing time: 0m 7.311sec


BK_STOP 1464602479324

--------------------
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

278 276 292 306 1455 2500 3263 3524 2149
iterations count:9174 (89), effective:2550 (25)

initing FirstDep: 0m 0.000sec

703 753 756 786
iterations count:4088 (40), effective:1057 (10)
1823 1383
iterations count:2038 (19), effective:642 (6)
1831 2875
iterations count:2604 (25), effective:821 (8)
745 828 816 928
iterations count:4752 (46), effective:1247 (12)
797 829
iterations count:2539 (24), effective:668 (6)
671 721
iterations count:2903 (28), effective:759 (7)

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-R050C002"
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-R050C002.tgz
mv S_ResAllocation-PT-R050C002 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-R050C002, 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-146444128700385"
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 ;