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 ResAllocation-PT-R003C015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r061-csrt-149440955200088
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494705844008

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_R003C015
(NrP: 90 NrTr: 60 NrArc: 264)

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

net check time: 0m 0.000sec

init dd package: 0m 1.287sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 321 (3.2e+02) #states 578,878,464 (8)



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

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

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

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

MC time: 0m 0.000sec

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

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

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (r_13_0<=r_14_0)
states: 578,878,464 (8)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[r_8_2<=r_14_1 & 3<=p_12_0]]]]
normalized: E [true U [r_8_2<=r_14_1 & 3<=p_12_0]]

abstracting: (3<=p_12_0)
states: 0
abstracting: (r_8_2<=r_14_1)
states: 468,136,960 (8)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[3<=r_13_0 & ~ [r_5_0<=p_5_1]]]
normalized: E [true U [~ [r_5_0<=p_5_1] & 3<=r_13_0]]

abstracting: (3<=r_13_0)
states: 0
abstracting: (r_5_0<=p_5_1)
states: 362,218,496 (8)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [~ [[[1<=p_0_1 & 1<=p_5_0] & ~ [2<=r_5_0]]]]
normalized: ~ [E [true U [~ [2<=r_5_0] & [1<=p_0_1 & 1<=p_5_0]]]]

abstracting: (1<=p_5_0)
states: 72,609,792 (7)
abstracting: (1<=p_0_1)
states: 227,993,600 (8)
abstracting: (2<=r_5_0)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [[1<=p_3_2 & [2<=p_4_0 & ~ [p_11_0<=r_14_0]]]]
normalized: E [true U [[2<=p_4_0 & ~ [p_11_0<=r_14_0]] & 1<=p_3_2]]

abstracting: (1<=p_3_2)
states: 213,769,216 (8)
abstracting: (p_11_0<=r_14_0)
states: 552,524,800 (8)
abstracting: (2<=p_4_0)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [~ [[p_0_2<=r_4_1 | r_5_2<=r_10_2]]]
normalized: E [true U ~ [[p_0_2<=r_4_1 | r_5_2<=r_10_2]]]

abstracting: (r_5_2<=r_10_2)
states: 436,970,496 (8)
abstracting: (p_0_2<=r_4_1)
states: 489,131,008 (8)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EF [~ [[1<=r_11_1 | [p_0_2<=p_13_2 | 3<=p_2_0]]]]
normalized: E [true U ~ [[1<=r_11_1 | [p_0_2<=p_13_2 | 3<=p_2_0]]]]

abstracting: (3<=p_2_0)
states: 0
abstracting: (p_0_2<=p_13_2)
states: 463,121,408 (8)
abstracting: (1<=r_11_1)
states: 270,111,744 (8)
-> the formula is TRUE

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

MC time: 0m 0.013sec

checking: AG [~ [[[p_2_2<=p_8_0 | 2<=r_13_0] & 3<=p_5_1]]]
normalized: ~ [E [true U [3<=p_5_1 & [p_2_2<=p_8_0 | 2<=r_13_0]]]]

abstracting: (2<=r_13_0)
states: 0
abstracting: (p_2_2<=p_8_0)
states: 520,059,904 (8)
abstracting: (3<=p_5_1)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[p_9_0<=p_13_0 | [~ [3<=r_3_1] & ~ [p_9_0<=p_5_0]]]]
normalized: ~ [E [true U ~ [[p_9_0<=p_13_0 | [~ [p_9_0<=p_5_0] & ~ [3<=r_3_1]]]]]]

abstracting: (3<=r_3_1)
states: 0
abstracting: (p_9_0<=p_5_0)
states: 518,097,920 (8)
abstracting: (p_9_0<=p_13_0)
states: 513,911,808 (8)
-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: EF [[[~ [1<=p_7_0] | [p_0_2<=p_5_1 & 2<=r_9_2]] & [3<=r_5_0 | 2<=r_10_2]]]
normalized: E [true U [[3<=r_5_0 | 2<=r_10_2] & [[p_0_2<=p_5_1 & 2<=r_9_2] | ~ [1<=p_7_0]]]]

abstracting: (1<=p_7_0)
states: 74,097,664 (7)
abstracting: (2<=r_9_2)
states: 0
abstracting: (p_0_2<=p_5_1)
states: 449,555,456 (8)
abstracting: (2<=r_10_2)
states: 0
abstracting: (3<=r_5_0)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[p_6_0<=p_1_1 | [p_12_2<=p_2_2 | [1<=r_11_2 & 3<=p_3_2]]]]
normalized: ~ [E [true U ~ [[p_6_0<=p_1_1 | [p_12_2<=p_2_2 | [1<=r_11_2 & 3<=p_3_2]]]]]]

abstracting: (3<=p_3_2)
states: 0
abstracting: (1<=r_11_2)
states: 267,206,656 (8)
abstracting: (p_12_2<=p_2_2)
states: 497,622,016 (8)
abstracting: (p_6_0<=p_1_1)
states: 390,175,232 (8)
-> the formula is FALSE

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

MC time: 0m 0.011sec

checking: AG [[[[r_0_2<=p_0_0 & 1<=p_4_2] & [r_4_2<=r_9_2 | 3<=r_7_1]] | ~ [[2<=r_10_2 & r_3_0<=r_11_0]]]]
normalized: ~ [E [true U ~ [[~ [[2<=r_10_2 & r_3_0<=r_11_0]] | [[r_4_2<=r_9_2 | 3<=r_7_1] & [r_0_2<=p_0_0 & 1<=p_4_2]]]]]]

abstracting: (1<=p_4_2)
states: 81,937,408 (7)
abstracting: (r_0_2<=p_0_0)
states: 452,660,224 (8)
abstracting: (3<=r_7_1)
states: 0
abstracting: (r_4_2<=r_9_2)
states: 435,143,680 (8)
abstracting: (r_3_0<=r_11_0)
states: 428,928,512 (8)
abstracting: (2<=r_10_2)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [[[[p_11_1<=p_4_0 & 3<=p_12_1] & [p_9_1<=p_1_0 & p_10_0<=p_6_2]] & [[2<=r_5_0 & 3<=r_4_2] & [r_3_0<=p_12_0 | p_6_2<=r_4_2]]]]
normalized: E [true U [[[2<=r_5_0 & 3<=r_4_2] & [r_3_0<=p_12_0 | p_6_2<=r_4_2]] & [[p_9_1<=p_1_0 & p_10_0<=p_6_2] & [p_11_1<=p_4_0 & 3<=p_12_1]]]]

abstracting: (3<=p_12_1)
states: 0
abstracting: (p_11_1<=p_4_0)
states: 497,386,496 (8)
abstracting: (p_10_0<=p_6_2)
states: 382,156,288 (8)
abstracting: (p_9_1<=p_1_0)
states: 446,143,488 (8)
abstracting: (p_6_2<=r_4_2)
states: 554,949,632 (8)
abstracting: (r_3_0<=p_12_0)
states: 413,180,928 (8)
abstracting: (3<=r_4_2)
states: 0
abstracting: (2<=r_5_0)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

totally nodes used: 189481(1.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 39333 137622 176955
used/not used/entry size/cache size: 135579 66973285 16 1024MB
basic ops cache: hits/miss/sum: 73549 236177 309726
used/not used/entry size/cache size: 569317 16207899 12 192MB
unary ops cache: hits/miss/sum: 0 990 990
used/not used/entry size/cache size: 990 8387618 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: 1660 4970 6630
used/not used/entry size/cache size: 4966 2092186 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 66919517
1 189213
2 134
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.072sec


BK_STOP 1494705846110

--------------------
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:459 (7), effective:90 (1)

initing FirstDep: 0m 0.000sec


iterations count:182 (3), effective:20 (0)

iterations count:240 (4), effective:32 (0)

iterations count:182 (3), effective:23 (0)

iterations count:271 (4), effective:31 (0)

iterations count:196 (3), effective:21 (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-R003C015"
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/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 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 ResAllocation-PT-R003C015, 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 r061-csrt-149440955200088"
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 ;