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-R003C020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423900097
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495085054751

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: ResAllocation_PT_R003C020
(NrP: 120 NrTr: 80 NrArc: 354)

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

net check time: 0m 0.000sec

init dd package: 0m 1.274sec


RS generation: 0m 0.007sec


-> reachability set: #nodes 436 (4.4e+02) #states 406,454,747,136 (11)



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

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [p_5_0<=p_8_2]
normalized: ~ [E [true U ~ [p_5_0<=p_8_2]]]

abstracting: (p_5_0<=p_8_2)
states: 359,293,403,136 (11)
-> the formula is FALSE

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

MC time: 0m 0.032sec

checking: EF [[p_10_0<=r_8_2 & ~ [~ [2<=r_19_0]]]]
normalized: E [true U [p_10_0<=r_8_2 & 2<=r_19_0]]

abstracting: (2<=r_19_0)
states: 0
abstracting: (p_10_0<=r_8_2)
states: 324,723,134,464 (11)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[2<=r_11_0 & [1<=p_11_1 | ~ [3<=r_5_0]]]]
normalized: E [true U [2<=r_11_0 & [1<=p_11_1 | ~ [3<=r_5_0]]]]

abstracting: (3<=r_5_0)
states: 0
abstracting: (1<=p_11_1)
states: 104,826,503,168 (11)
abstracting: (2<=r_11_0)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [~ [[r_8_1<=p_3_2 & [2<=r_10_2 | 3<=r_12_0]]]]
normalized: ~ [E [true U [r_8_1<=p_3_2 & [2<=r_10_2 | 3<=r_12_0]]]]

abstracting: (3<=r_12_0)
states: 0
abstracting: (2<=r_10_2)
states: 0
abstracting: (r_8_1<=p_3_2)
states: 282,583,220,224 (11)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[p_3_2<=p_2_0 | ~ [1<=p_2_2]] & ~ [~ [2<=r_2_0]]]]
normalized: E [true U [2<=r_2_0 & [p_3_2<=p_2_0 | ~ [1<=p_2_2]]]]

abstracting: (1<=p_2_2)
states: 68,706,238,464 (10)
abstracting: (p_3_2<=p_2_0)
states: 314,777,894,912 (11)
abstracting: (2<=r_2_0)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [~ [[[r_0_1<=r_18_2 & 1<=r_19_1] | ~ [r_12_1<=p_15_1]]]]
normalized: E [true U ~ [[~ [r_12_1<=p_15_1] | [r_0_1<=r_18_2 & 1<=r_19_1]]]]

abstracting: (1<=r_19_1)
states: 246,382,583,808 (11)
abstracting: (r_0_1<=r_18_2)
states: 311,556,833,280 (11)
abstracting: (r_12_1<=p_15_1)
states: 256,237,223,936 (11)
-> the formula is TRUE

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

MC time: 0m 0.038sec

checking: AG [[[[r_16_1<=p_18_1 | 1<=r_0_1] & 1<=r_3_1] | p_17_1<=r_6_2]]
normalized: ~ [E [true U ~ [[p_17_1<=r_6_2 | [1<=r_3_1 & [r_16_1<=p_18_1 | 1<=r_0_1]]]]]]

abstracting: (1<=r_0_1)
states: 176,000,909,312 (11)
abstracting: (r_16_1<=p_18_1)
states: 260,473,786,368 (11)
abstracting: (1<=r_3_1)
states: 202,262,413,312 (11)
abstracting: (p_17_1<=r_6_2)
states: 342,700,998,656 (11)
-> the formula is FALSE

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

MC time: 0m 0.037sec

checking: EF [[r_8_2<=r_14_0 & [[r_16_1<=p_13_0 & p_2_1<=r_6_2] & [3<=r_17_0 & 2<=r_7_1]]]]
normalized: E [true U [r_8_2<=r_14_0 & [[3<=r_17_0 & 2<=r_7_1] & [r_16_1<=p_13_0 & p_2_1<=r_6_2]]]]

abstracting: (p_2_1<=r_6_2)
states: 341,496,872,960 (11)
abstracting: (r_16_1<=p_13_0)
states: 244,041,154,560 (11)
abstracting: (2<=r_7_1)
states: 0
abstracting: (3<=r_17_0)
states: 0
abstracting: (r_8_2<=r_14_0)
states: 303,995,387,904 (11)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[[[1<=p_10_2 | 1<=p_16_2] & 3<=r_2_1] & [[p_17_0<=p_8_1 | p_4_2<=r_2_1] | ~ [3<=p_5_2]]]]
normalized: E [true U [[3<=r_2_1 & [1<=p_10_2 | 1<=p_16_2]] & [~ [3<=p_5_2] | [p_17_0<=p_8_1 | p_4_2<=r_2_1]]]]

abstracting: (p_4_2<=r_2_1)
states: 381,487,988,736 (11)
abstracting: (p_17_0<=p_8_1)
states: 355,336,536,064 (11)
abstracting: (3<=p_5_2)
states: 0
abstracting: (1<=p_16_2)
states: 46,310,277,120 (10)
abstracting: (1<=p_10_2)
states: 53,180,940,288 (10)
abstracting: (3<=r_2_1)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[~ [[r_8_0<=r_19_0 | 1<=p_3_0]] | [[r_17_1<=p_10_1 & r_2_2<=p_11_0] & [2<=p_8_0 & r_1_0<=p_11_0]]]]
normalized: E [true U [[[r_17_1<=p_10_1 & r_2_2<=p_11_0] & [2<=p_8_0 & r_1_0<=p_11_0]] | ~ [[r_8_0<=r_19_0 | 1<=p_3_0]]]]

abstracting: (1<=p_3_0)
states: 46,310,277,120 (10)
abstracting: (r_8_0<=r_19_0)
states: 349,709,680,640 (11)
abstracting: (r_1_0<=p_11_0)
states: 227,790,192,640 (11)
abstracting: (2<=p_8_0)
states: 0
abstracting: (r_2_2<=p_11_0)
states: 243,525,009,408 (11)
abstracting: (r_17_1<=p_10_1)
states: 247,966,265,344 (11)
-> the formula is TRUE

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

MC time: 0m 0.018sec

checking: EF [[[[p_10_1<=p_12_1 | 2<=p_5_1] | [1<=r_1_1 | r_18_1<=p_10_0]] & ~ [[p_17_0<=r_7_2 | r_11_2<=p_2_2]]]]
normalized: E [true U [[[p_10_1<=p_12_1 | 2<=p_5_1] | [1<=r_1_1 | r_18_1<=p_10_0]] & ~ [[p_17_0<=r_7_2 | r_11_2<=p_2_2]]]]

abstracting: (r_11_2<=p_2_2)
states: 243,778,191,360 (11)
abstracting: (p_17_0<=r_7_2)
states: 370,887,507,968 (11)
abstracting: (r_18_1<=p_10_0)
states: 298,654,568,448 (11)
abstracting: (1<=r_1_1)
states: 213,640,650,752 (11)
abstracting: (2<=p_5_1)
states: 0
abstracting: (p_10_1<=p_12_1)
states: 341,579,812,864 (11)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

totally nodes used: 347021(3.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 63732 226487 290219
used/not used/entry size/cache size: 223472 66885392 16 1024MB
basic ops cache: hits/miss/sum: 126963 415843 542806
used/not used/entry size/cache size: 977907 15799309 12 192MB
unary ops cache: hits/miss/sum: 0 1770 1770
used/not used/entry size/cache size: 1770 8386838 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: 2491 7671 10162
used/not used/entry size/cache size: 7660 2089492 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 66762319
1 346069
2 476
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.027sec


BK_STOP 1495085056807

--------------------
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.000sec


iterations count:611 (7), effective:120 (1)

initing FirstDep: 0m 0.000sec


iterations count:190 (2), effective:16 (0)

iterations count:251 (3), effective:29 (0)

iterations count:269 (3), effective:29 (0)

iterations count:175 (2), effective:14 (0)

iterations count:263 (3), effective:27 (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-R003C020"
export BK_EXAMINATION="ReachabilityCardinality"
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-R003C020.tgz
mv S_ResAllocation-PT-R003C020 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-R003C020, 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 r141-csrt-149443423900097"
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 ;