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

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

=== Now, execution of the tool begins

BK_START 1463785597837


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_R100C002
(NrP: 400 NrTr: 202 NrArc: 1000)

net check time: 0m 0.000sec

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

init dd package: 0m 4.052sec


RS generation: 0m 3.035sec


-> reachability set: #nodes 1106 (1.1e+03) #states 64,650,180,611,639,699,476,331,863,474,176 (31)



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

checking: AG [~ [3<=p_0_27]]
normalized: ~ [E [true U 3<=p_0_27]]

abstracting: (3<=p_0_27) states: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [1<=r_1_82]
normalized: ~ [E [true U ~ [1<=r_1_82]]]

abstracting: (1<=r_1_82) states: 38,029,518,006,846,882,044,901,096,161,280 (31)
-> the formula is FALSE

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

MC time: 0m 0.314sec

checking: AG [r_0_92<=r_1_69]
normalized: ~ [E [true U ~ [r_0_92<=r_1_69]]]

abstracting: (r_0_92<=r_1_69) states: 53,399,781,534,614,163,538,048,622,526,464 (31)
-> the formula is FALSE

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

MC time: 0m 0.804sec

checking: AG [~ [~ [r_1_8<=r_1_56]]]
normalized: ~ [E [true U ~ [r_1_8<=r_1_56]]]

abstracting: (r_1_8<=r_1_56) states: 47,853,810,158,615,659,906,500,546,002,944 (31)
-> the formula is FALSE

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

MC time: 0m 1.034sec

checking: EF [~ [[~ [3<=r_0_38] | ~ [2<=r_1_93]]]]
normalized: E [true U ~ [[~ [3<=r_0_38] | ~ [2<=r_1_93]]]]

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

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

MC time: 0m 0.002sec

checking: AG [p_0_51<=p_0_23]
normalized: ~ [E [true U ~ [p_0_51<=p_0_23]]]

abstracting: (p_0_51<=p_0_23) states: 56,727,364,360,213,265,716,977,468,440,576 (31)
-> the formula is FALSE

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

MC time: 0m 0.528sec

checking: EF [[~ [[2<=r_0_26 & 3<=p_1_5]] & 3<=p_0_76]]
normalized: E [true U [3<=p_0_76 & ~ [[2<=r_0_26 & 3<=p_1_5]]]]

abstracting: (3<=p_1_5) states: 0
abstracting: (2<=r_0_26) states: 0
abstracting: (3<=p_0_76) states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[[p_1_40<=p_0_96 | p_1_72<=p_1_96] & 3<=r_1_70]]
normalized: E [true U [3<=r_1_70 & [p_1_40<=p_0_96 | p_1_72<=p_1_96]]]

abstracting: (p_1_72<=p_1_96) states: 52,924,412,559,528,577,512,487,358,824,448 (31)
abstracting: (p_1_40<=p_0_96) states: 51,339,849,309,243,290,760,616,479,817,728 (31)
abstracting: (3<=r_1_70) states: 0
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: AG [~ [[[r_1_66<=p_1_36 | 2<=r_0_12] & p_1_53<=r_0_35]]]
normalized: ~ [E [true U [p_1_53<=r_0_35 & [r_1_66<=p_1_36 | 2<=r_0_12]]]]

abstracting: (2<=r_0_12) states: 0
abstracting: (r_1_66<=p_1_36) states: 27,571,400,554,963,989,482,553,294,716,928 (31)
abstracting: (p_1_53<=r_0_35) states: 55,776,626,410,042,093,665,854,941,036,544 (31)
-> the formula is FALSE

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

MC time: 0m 0.888sec

checking: EF [~ [[1<=p_0_21 | [r_0_60<=p_0_99 | r_0_27<=r_0_41]]]]
normalized: E [true U ~ [[1<=p_0_21 | [r_0_60<=p_0_99 | r_0_27<=r_0_41]]]]

abstracting: (r_0_27<=r_0_41) states: 48,487,635,458,729,774,607,248,897,605,632 (31)
abstracting: (r_0_60<=p_0_99) states: 32,958,915,605,933,964,438,914,283,339,776 (31)
abstracting: (1<=p_0_21) states: 25,353,012,004,564,588,029,934,064,107,520 (31)
-> the formula is TRUE

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

MC time: 0m 1.711sec

checking: AG [~ [[[3<=p_0_33 & r_1_61<=r_0_6] & ~ [p_1_54<=p_0_81]]]]
normalized: ~ [E [true U [[3<=p_0_33 & r_1_61<=r_0_6] & ~ [p_1_54<=p_0_81]]]]

abstracting: (p_1_54<=p_0_81) states: 46,903,072,208,444,487,855,378,018,598,912 (31)
abstracting: (r_1_61<=r_0_6) states: 42,149,382,457,588,627,599,765,381,578,752 (31)
abstracting: (3<=p_0_33) states: 0
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: AG [[p_0_78<=p_0_48 & [p_1_44<=p_0_40 | [1<=p_1_88 & 1<=r_0_81]]]]
normalized: ~ [E [true U ~ [[p_0_78<=p_0_48 & [p_1_44<=p_0_40 | [1<=p_1_88 & 1<=r_0_81]]]]]]

abstracting: (1<=r_0_81) states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=p_1_88) states: 28,522,138,505,135,161,533,675,822,120,960 (31)
abstracting: (p_1_44<=p_0_40) states: 50,864,480,334,157,704,735,055,216,115,712 (31)
abstracting: (p_0_78<=p_0_48) states: 61,005,685,135,983,539,947,028,841,758,720 (31)
-> the formula is FALSE

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

MC time: 0m 0.494sec

checking: AG [[[~ [p_0_29<=r_0_49] | ~ [r_0_3<=r_1_95]] | p_0_7<=r_1_1]]
normalized: ~ [E [true U ~ [[p_0_7<=r_1_1 | [~ [p_0_29<=r_0_49] | ~ [r_0_3<=r_1_95]]]]]]

abstracting: (r_0_3<=r_1_95) states: 49,438,373,408,900,946,658,371,425,009,664 (31)
abstracting: (p_0_29<=r_0_49) states: 53,082,868,884,557,106,187,674,446,725,120 (31)
abstracting: (p_0_7<=r_1_1) states: 64,650,180,611,639,699,476,331,863,474,176 (31)
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: AG [[[~ [3<=r_0_34] & ~ [2<=p_1_2]] | [p_0_24<=p_0_65 | [r_0_60<=p_1_38 | 3<=p_1_10]]]]
normalized: ~ [E [true U ~ [[[p_0_24<=p_0_65 | [r_0_60<=p_1_38 | 3<=p_1_10]] | [~ [2<=p_1_2] & ~ [3<=r_0_34]]]]]]

abstracting: (3<=r_0_34) states: 0
abstracting: (2<=p_1_2) states: 0
abstracting: (3<=p_1_10) states: 0
abstracting: (r_0_60<=p_1_38) states: 38,980,255,957,018,054,096,023,623,565,312 (31)
abstracting: (p_0_24<=p_0_65) states: 45,952,334,258,273,315,804,255,491,194,880 (31)
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[[[r_1_55<=r_0_58 | 2<=p_1_77] | [p_0_89<=r_1_69 | p_1_83<=r_0_53]] | 2<=r_1_45]]
normalized: ~ [E [true U ~ [[2<=r_1_45 | [[p_0_89<=r_1_69 | p_1_83<=r_0_53] | [r_1_55<=r_0_58 | 2<=p_1_77]]]]]]

abstracting: (2<=p_1_77) states: 0
abstracting: (r_1_55<=r_0_58) states: 41,040,188,182,388,926,873,455,766,274,048 (31)
abstracting: (p_1_83<=r_0_53) states: 51,022,936,659,186,233,410,242,304,016,384 (31)
abstracting: (p_0_89<=r_1_69) states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (2<=r_1_45) states: 0
-> the formula is TRUE

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

MC time: 0m 0.007sec

checking: AG [[~ [[1<=p_0_15 | 3<=p_1_88]] | [[p_0_46<=r_1_32 | p_0_51<=r_1_69] & [2<=r_1_98 & 2<=r_1_10]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p_0_15 | 3<=p_1_88]] | [[p_0_46<=r_1_32 | p_0_51<=r_1_69] & [2<=r_1_98 & 2<=r_1_10]]]]]]

abstracting: (2<=r_1_10) states: 0
abstracting: (2<=r_1_98) states: 0
abstracting: (p_0_51<=r_1_69) states: 61,639,510,436,097,654,647,777,193,361,408 (31)
abstracting: (p_0_46<=r_1_32) states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (3<=p_1_88) states: 0
abstracting: (1<=p_0_15) states: 27,254,487,904,906,932,132,179,118,915,584 (31)
-> the formula is FALSE

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

MC time: 0m 0.041sec


Total processing time: 0m14.670sec


BK_STOP 1463785612551

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

478 476 492 506 518 530 540 748 558 566 574 582 908 596 830 1225 2547 3684 4742 5939 7046 8063 8990 9827 10508 11430 11946 12412 12878 13254 13299 13094 12518 11140 8555
iterations count:35849 (177), effective:10100 (50)

initing FirstDep: 0m 0.000sec


iterations count:870 (4), effective:189 (0)
1335 1380
iterations count:2432 (12), effective:619 (3)
1153 1203 1238 1268
iterations count:4146 (20), effective:1043 (5)
1957 3833 5093 5413
iterations count:4793 (23), effective:1506 (7)
1387 1408
iterations count:2772 (13), effective:698 (3)
1810 1881 1873 2035 1901 1921 2170 3127
iterations count:8173 (40), effective:2091 (10)
1810
iterations count:1758 (8), effective:426 (2)

iterations count:659 (3), effective:152 (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-R100C002"
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/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 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-R100C002, 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 r101kn-smll-146369144000394"
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 ;