About the Execution of MARCIE for S_ResAllocation-PT-R003C050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3213.090 | 74451.00 | 73999.00 | 20.40 | TFTTFFTFFTTTTFFF | normal |
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-3254
Executing tool marcie
Input is S_ResAllocation-PT-R003C050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423900102
=====================================================================
--------------------
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-R003C050-CTLCardinality-0
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-1
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-15
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-2
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-3
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-4
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-5
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-6
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-7
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-8
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1495085057999
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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 --memory=6
parse successfull
net created successfully
Net: ResAllocation_PT_R003C050
(NrP: 300 NrTr: 200 NrArc: 894)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec
net check time: 0m 0.000sec
init dd package: 0m 1.347sec
RS generation: 0m 0.047sec
-> reachability set: #nodes 1126 (1.1e+03) #states 48,717,538,008,124,384,423,924,727,808 (28)
starting MCC model checker
--------------------------
checking: ~ [AG [~ [2<=p_13_0]]]
normalized: E [true U 2<=p_13_0]
abstracting: (2<=p_13_0)
states: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [AG [~ [3<=r_17_0]]]
normalized: EG [~ [E [true U 3<=r_17_0]]]
abstracting: (3<=r_17_0)
states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [~ [EG [p_37_2<=p_30_0]]]
normalized: EG [~ [EG [p_37_2<=p_30_0]]]
abstracting: (p_37_2<=p_30_0)
states: 37,119,373,242,238,095,270,239,797,248 (28)
.......................................................................
EG iterations: 71
after gc: zbdd nodes used:9177, unused:18740823..............................................................................
EG iterations: 78
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.604sec
checking: EG [p_0_2<=r_38_1]
normalized: EG [p_0_2<=r_38_1]
abstracting: (p_0_2<=r_38_1)
states: 41,436,645,885,448,574,712,573,591,552 (28)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.122sec
checking: [3<=p_35_1 | EX [EX [2<=r_41_1]]]
normalized: [EX [EX [2<=r_41_1]] | 3<=p_35_1]
abstracting: (3<=p_35_1)
states: 0
abstracting: (2<=r_41_1)
states: 0
..-> the formula is FALSE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [AG [[r_12_1<=p_46_2 | 3<=p_21_1]]]
normalized: E [true U ~ [E [true U ~ [[r_12_1<=p_46_2 | 3<=p_21_1]]]]]
abstracting: (3<=p_21_1)
states: 0
abstracting: (r_12_1<=p_46_2)
states: 27,736,507,105,059,051,449,939,394,560 (28)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.345sec
checking: AF [AG [[p_31_0<=p_10_2 & 1<=p_25_2]]]
normalized: ~ [EG [E [true U ~ [[p_31_0<=p_10_2 & 1<=p_25_2]]]]]
abstracting: (1<=p_25_2)
states: 18,902,551,529,131,700,702,580,572,160 (28)
abstracting: (p_31_0<=p_10_2)
states: 43,171,387,665,417,282,294,091,087,872 (28)
...........
after gc: zbdd nodes used:44429, unused:37455571................................................................
EG iterations: 75
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.037sec
checking: ~ [~ [EG [[p_8_2<=p_4_0 | 2<=p_36_2]]]]
normalized: EG [[p_8_2<=p_4_0 | 2<=p_36_2]]
abstracting: (2<=p_36_2)
states: 0
abstracting: (p_8_2<=p_4_0)
states: 45,011,821,627,301,672,366,905,491,456 (28)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.099sec
checking: EF [[3<=p_16_1 & r_39_2<=r_19_0]]
normalized: E [true U [3<=p_16_1 & r_39_2<=r_19_0]]
abstracting: (r_39_2<=r_19_0)
states: 36,550,196,130,809,372,679,939,817,472 (28)
abstracting: (3<=p_16_1)
states: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: ~ [[EF [~ [1<=p_40_1]] & A [p_16_2<=p_26_0 U 2<=r_48_0]]]
normalized: ~ [[[~ [EG [~ [2<=r_48_0]]] & ~ [E [~ [2<=r_48_0] U [~ [p_16_2<=p_26_0] & ~ [2<=r_48_0]]]]] & E [true U ~ [1<=p_40_1]]]]
abstracting: (1<=p_40_1)
states: 12,488,731,899,020,890,603,637,440,512 (28)
abstracting: (2<=r_48_0)
states: 0
abstracting: (p_16_2<=p_26_0)
states: 44,815,105,787,554,120,207,869,935,616 (28)
abstracting: (2<=r_48_0)
states: 0
abstracting: (2<=r_48_0)
states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.292sec
checking: A [EF [p_2_0<=p_3_1] U EG [r_37_1<=r_32_2]]
normalized: [~ [EG [~ [EG [r_37_1<=r_32_2]]]] & ~ [E [~ [EG [r_37_1<=r_32_2]] U [~ [E [true U p_2_0<=p_3_1]] & ~ [EG [r_37_1<=r_32_2]]]]]]
abstracting: (r_37_1<=r_32_2)
states: 36,476,577,737,721,326,264,026,923,008 (28)
..............................................................................
EG iterations: 78
abstracting: (p_2_0<=p_3_1)
states: 32,283,057,640,574,900,171,530,305,536 (28)
abstracting: (r_37_1<=r_32_2)
states: 36,476,577,737,721,326,264,026,923,008 (28)
..............................................................................
EG iterations: 78
abstracting: (r_37_1<=r_32_2)
states: 36,476,577,737,721,326,264,026,923,008 (28)
..............................................................................
EG iterations: 78
..............................................................................
EG iterations: 78
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.685sec
checking: AX [[AF [r_18_0<=p_20_2] | AX [r_46_2<=p_11_2]]]
normalized: ~ [EX [~ [[~ [EG [~ [r_18_0<=p_20_2]]] | ~ [EX [~ [r_46_2<=p_11_2]]]]]]]
abstracting: (r_46_2<=p_11_2)
states: 34,676,978,030,002,836,284,448,440,320 (28)
.abstracting: (r_18_0<=p_20_2)
states: 28,729,151,863,222,312,178,227,871,744 (28)
..................................
after gc: zbdd nodes used:67692, unused:74932308.............................................
EG iterations: 79
.-> the formula is FALSE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12.632sec
checking: AG [EF [[p_44_2<=p_12_1 | r_15_2<=r_23_1]]]
normalized: ~ [E [true U ~ [E [true U [p_44_2<=p_12_1 | r_15_2<=r_23_1]]]]]
abstracting: (r_15_2<=r_23_1)
states: 36,665,411,298,199,001,197,413,662,720 (28)
abstracting: (p_44_2<=p_12_1)
states: 44,161,851,305,375,227,706,351,812,608 (28)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.203sec
checking: [[~ [3<=p_48_1] & AG [[p_13_1<=p_38_1 | 2<=p_44_0]]] | AG [EF [p_13_1<=r_36_1]]]
normalized: [~ [E [true U ~ [E [true U p_13_1<=r_36_1]]]] | [~ [E [true U ~ [[p_13_1<=p_38_1 | 2<=p_44_0]]]] & ~ [3<=p_48_1]]]
abstracting: (3<=p_48_1)
states: 0
abstracting: (2<=p_44_0)
states: 0
abstracting: (p_13_1<=p_38_1)
states: 39,415,545,543,502,912,717,259,276,288 (28)
abstracting: (p_13_1<=r_36_1)
states: 42,284,948,506,593,717,544,617,508,864 (28)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.387sec
checking: [[E [r_18_0<=r_31_0 U 3<=r_10_2] & [AF [r_29_2<=r_49_1] | p_14_0<=r_8_1]] & 1<=r_14_1]
normalized: [[[~ [EG [~ [r_29_2<=r_49_1]]] | p_14_0<=r_8_1] & E [r_18_0<=r_31_0 U 3<=r_10_2]] & 1<=r_14_1]
abstracting: (1<=r_14_1)
states: 23,680,310,714,811,229,407,297,929,216 (28)
abstracting: (3<=r_10_2)
states: 0
abstracting: (r_18_0<=r_31_0)
states: 36,556,264,222,952,937,970,192,089,088 (28)
abstracting: (p_14_0<=r_8_1)
states: 39,056,150,682,914,263,104,346,914,816 (28)
abstracting: (r_29_2<=r_49_1)
states: 39,489,867,778,295,906,171,803,926,528 (28)
...............................................................................
EG iterations: 79
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.549sec
checking: [EG [[[r_25_2<=p_15_0 | r_43_2<=p_10_0] | [1<=r_44_0 | p_3_2<=p_4_1]]] | EG [EF [p_5_1<=r_22_0]]]
normalized: [EG [E [true U p_5_1<=r_22_0]] | EG [[[1<=r_44_0 | p_3_2<=p_4_1] | [r_25_2<=p_15_0 | r_43_2<=p_10_0]]]]
abstracting: (r_43_2<=p_10_0)
states: 34,306,372,438,360,219,383,192,616,960 (28)
abstracting: (r_25_2<=p_15_0)
states: 28,355,013,214,530,746,744,460,804,096 (28)
abstracting: (p_3_2<=p_4_1)
states: 34,557,558,976,194,976,355,966,779,392 (28)
abstracting: (1<=r_44_0)
states: 23,179,277,376,933,238,857,351,036,928 (28)
.
EG iterations: 1
abstracting: (p_5_1<=r_22_0)
states: 42,401,798,047,134,128,551,810,301,952 (28)
..........................................................................
EG iterations: 74
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.581sec
totally nodes used: 102519338(1.0e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 34978317 61179522 96157839
used/not used/entry size/cache size: 18584625 48524239 16 1024MB
basic ops cache: hits/miss/sum: 41567675 77002248 118569923
used/not used/entry size/cache size: 16213235 563981 12 192MB
unary ops cache: hits/miss/sum: 0 11175 11175
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 7017 22557 29574
used/not used/entry size/cache size: 10198 2086954 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 38628852
1 21364679
2 5878461
3 1072554
4 146996
5 15683
6 1508
7 124
8 6
9 0
>= 10 1
Total processing time: 1m14.418sec
BK_STOP 1495085132450
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
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.002sec
iterations count:1526 (7), effective:300 (1)
initing FirstDep: 0m 0.000sec
iterations count:238 (1), effective:5 (0)
iterations count:297 (1), effective:16 (0)
iterations count:330 (1), effective:19 (0)
iterations count:215 (1), effective:2 (0)
iterations count:319 (1), effective:18 (0)
iterations count:257 (1), effective:8 (0)
iterations count:341 (1), effective:28 (0)
iterations count:263 (1), effective:10 (0)
iterations count:269 (1), effective:10 (0)
iterations count:245 (1), effective:6 (0)
iterations count:368 (1), effective:27 (0)
iterations count:242 (1), effective:6 (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-R003C050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-R003C050.tgz
mv S_ResAllocation-PT-R003C050 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_ResAllocation-PT-R003C050, 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 r141-csrt-149443423900102"
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 '
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 ;