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

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


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=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: ResAllocation_PT_R003C050
(NrP: 300 NrTr: 200 NrArc: 894)

net check time: 0m 0.000sec

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

init dd package: 0m 3.766sec


RS generation: 0m 0.119sec


-> reachability set: #nodes 2056 (2.1e+03) #states 48,717,538,008,124,384,423,924,727,808 (28)



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

checking: ~ [AF [AG [2<=r_27_0]]]
normalized: EG [E [true U ~ [2<=r_27_0]]]

abstracting: (2<=r_27_0) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.132sec

checking: AF [EG [1<=p_0_2]]
normalized: ~ [EG [~ [EG [1<=p_0_2]]]]

abstracting: (1<=p_0_2) states: 14,163,388,726,529,372,859,779,776,512 (28)
.............................................................................
EG iterations: 77
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.285sec

checking: ~ [EF [AX [1<=r_34_2]]]
normalized: ~ [E [true U ~ [EX [~ [1<=r_34_2]]]]]

abstracting: (1<=r_34_2) states: 23,430,354,212,995,139,740,291,301,376 (28)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.891sec

checking: ~ [~ [EF [~ [p_23_1<=r_25_2]]]]
normalized: E [true U ~ [p_23_1<=r_25_2]]

abstracting: (p_23_1<=r_25_2) states: 41,905,647,290,090,176,701,322,493,952 (28)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.168sec

checking: EF [~ [EF [p_44_2<=r_40_1]]]
normalized: E [true U ~ [E [true U p_44_2<=r_40_1]]]

abstracting: (p_44_2<=r_40_1) states: 45,808,667,575,349,299,601,498,701,824 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EG [AF [[3<=r_21_0 & 2<=p_2_1]]]
normalized: EG [~ [EG [~ [[3<=r_21_0 & 2<=p_2_1]]]]]

abstracting: (2<=p_2_1) states: 0
abstracting: (3<=r_21_0) states: 0

EG iterations: 0
.
EG iterations: 1
-> 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: EX [[AG [r_37_2<=r_22_1] | AG [2<=r_32_2]]]
normalized: EX [[~ [E [true U ~ [2<=r_32_2]]] | ~ [E [true U ~ [r_37_2<=r_22_1]]]]]

abstracting: (r_37_2<=r_22_1) states: 36,674,639,783,793,439,501,434,486,784 (28)
abstracting: (2<=r_32_2) states: 0
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.285sec

checking: ~ [[AG [~ [1<=r_48_0]] | AF [[2<=r_15_1 & 2<=p_37_1]]]]
normalized: ~ [[~ [EG [~ [[2<=r_15_1 & 2<=p_37_1]]]] | ~ [E [true U 1<=r_48_0]]]]

abstracting: (1<=r_48_0) states: 19,335,897,689,134,881,895,404,797,952 (28)
abstracting: (2<=p_37_1) states: 0
abstracting: (2<=r_15_1) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[EX [3<=r_10_2] & [~ [1<=r_46_2] | ~ [3<=r_1_2]]]]
normalized: E [true U [[~ [3<=r_1_2] | ~ [1<=r_46_2]] & EX [3<=r_10_2]]]

abstracting: (3<=r_10_2) states: 0
.abstracting: (1<=r_46_2) states: 22,937,670,968,470,090,424,793,432,064 (28)
abstracting: (3<=r_1_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [AF [[3<=p_45_2 & r_14_2<=r_18_0]]]
normalized: ~ [E [true U EG [~ [[3<=p_45_2 & r_14_2<=r_18_0]]]]]

abstracting: (r_14_2<=r_18_0) states: 36,542,787,800,867,372,141,591,396,352 (28)
abstracting: (3<=p_45_2) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [AF [[p_18_2<=r_16_2 & 2<=r_40_2]]]
normalized: ~ [EX [EG [~ [[p_18_2<=r_16_2 & 2<=r_40_2]]]]]

abstracting: (2<=r_40_2) states: 0
abstracting: (p_18_2<=r_16_2) states: 46,861,395,932,786,575,036,001,550,336 (28)

EG iterations: 0
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [[[r_13_1<=p_11_1 | 2<=p_27_1] | ~ [2<=p_1_2]]]]
normalized: E [true U ~ [[~ [2<=p_1_2] | [r_13_1<=p_11_1 | 2<=p_27_1]]]]

abstracting: (2<=p_27_1) states: 0
abstracting: (r_13_1<=p_11_1) states: 30,346,158,641,568,683,449,915,539,456 (28)
abstracting: (2<=p_1_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: E [~ [[p_38_0<=r_26_1 & 2<=r_35_1]] U EX [2<=p_44_2]]
normalized: E [~ [[p_38_0<=r_26_1 & 2<=r_35_1]] U EX [2<=p_44_2]]

abstracting: (2<=p_44_2) states: 0
.abstracting: (2<=r_35_1) states: 0
abstracting: (p_38_0<=r_26_1) states: 39,007,938,423,259,944,168,024,178,688 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [E [[1<=p_18_0 | p_12_0<=p_15_1] U [2<=r_12_0 & 1<=p_24_0]] & ~ [A [r_29_1<=p_46_1 U 2<=p_13_1]]]
normalized: [E [[1<=p_18_0 | p_12_0<=p_15_1] U [2<=r_12_0 & 1<=p_24_0]] & ~ [[~ [E [~ [2<=p_13_1] U [~ [2<=p_13_1] & ~ [r_29_1<=p_46_1]]]] & ~ [EG [~ [2<=p_13_1]]]]]]

abstracting: (2<=p_13_1) states: 0

EG iterations: 0
abstracting: (r_29_1<=p_46_1) states: 30,535,959,983,806,212,162,084,405,248 (28)
abstracting: (2<=p_13_1) states: 0
abstracting: (2<=p_13_1) states: 0
abstracting: (1<=p_24_0) states: 18,902,551,529,131,700,702,580,572,160 (28)
abstracting: (2<=r_12_0) states: 0
abstracting: (p_12_0<=p_15_1) states: 34,218,353,651,477,092,472,427,905,024 (28)
abstracting: (1<=p_18_0) states: 18,902,628,563,907,325,169,244,307,456 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.120sec

checking: AG [[[[p_15_2<=p_7_1 & r_13_2<=p_30_1] | 1<=r_2_0] | [p_20_0<=p_40_0 | [r_4_1<=p_47_0 | r_7_2<=r_36_1]]]]
normalized: ~ [E [true U ~ [[[p_20_0<=p_40_0 | [r_4_1<=p_47_0 | r_7_2<=r_36_1]] | [1<=r_2_0 | [p_15_2<=p_7_1 & r_13_2<=p_30_1]]]]]]

abstracting: (r_13_2<=p_30_1) states: 31,306,836,078,844,350,830,991,114,240 (28)
abstracting: (p_15_2<=p_7_1) states: 34,655,889,390,760,645,782,554,017,792 (28)
abstracting: (1<=r_2_0) states: 22,937,670,968,470,090,424,793,432,064 (28)
abstracting: (r_7_2<=r_36_1) states: 36,659,842,443,975,882,875,502,329,856 (28)
abstracting: (r_4_1<=p_47_0) states: 29,282,613,008,871,806,983,257,194,496 (28)
abstracting: (p_20_0<=p_40_0) states: 37,141,344,775,200,975,993,354,321,920 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.481sec

checking: [[EF [[3<=r_15_2 | 2<=r_26_1]] | ~ [[[r_2_2<=r_26_2 | r_0_2<=r_6_0] & ~ [1<=p_8_1]]]] & AX [[p_37_1<=p_37_2 | [3<=r_39_1 | p_6_1<=p_23_1]]]]
normalized: [~ [EX [~ [[p_37_1<=p_37_2 | [3<=r_39_1 | p_6_1<=p_23_1]]]]] & [~ [[~ [1<=p_8_1] & [r_2_2<=r_26_2 | r_0_2<=r_6_0]]] | E [true U [3<=r_15_2 | 2<=r_26_1]]]]

abstracting: (2<=r_26_1) states: 0
abstracting: (3<=r_15_2) states: 0
abstracting: (r_0_2<=r_6_0) states: 38,658,925,789,552,570,007,166,124,032 (28)
abstracting: (r_2_2<=r_26_2) states: 37,046,358,664,994,708,790,938,959,872 (28)
abstracting: (1<=p_8_1) states: 12,573,081,229,762,392,478,927,814,656 (28)
abstracting: (p_6_1<=p_23_1) states: 39,276,025,102,334,235,650,520,252,416 (28)
abstracting: (3<=r_39_1) states: 0
abstracting: (p_37_1<=p_37_2) states: 42,456,069,669,541,101,801,446,572,032 (28)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.166sec


Total processing time: 0m22.794sec


BK_STOP 1464598532351

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

1458
iterations count:1526 (7), effective:300 (1)

initing FirstDep: 0m 0.000sec


iterations count:200 (1), effective:0 (0)
2410 2491
iterations count:2267 (11), effective:359 (1)

iterations count:280 (1), effective:12 (0)

iterations count:238 (1), effective:5 (0)

iterations count:289 (1), effective:14 (0)

iterations count:200 (1), effective:0 (0)

iterations count:225 (1), effective:4 (0)

iterations count:200 (1), effective:0 (0)

iterations count:245 (1), effective:6 (0)

iterations count:452 (2), effective:39 (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="/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-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-2979"
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 r185kn-smll-146444128500327"
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 '' CTLCardinality.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 ;