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 GPPP-PT-C0100N0000010000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r021-blw3-149440255300556
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494465462695

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: GPPP_PT_C0100N0000010000
(NrP: 33 NrTr: 22 NrArc: 83)

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

net check time: 0m 0.000sec

init dd package: 0m 1.109sec

parse successfull
net created successfully

Net: GPPP_PT_C0100N0000010000
(NrP: 33 NrTr: 22 NrArc: 83)

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

net check time: 0m 0.000sec

init dd package: 0m 3.624sec


RS generation: 5m 2.652sec


-> reachability set: #nodes 713713 (7.1e+05) #states 20,292,531,036,711,574 (16)



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

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

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

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.506sec

checking: EF [[~ [~ [2<=c2]] & 3<=c1]]
normalized: E [true U [2<=c2 & 3<=c1]]

abstracting: (3<=c1)
states: 18,692,174,588,834,984 (16)
abstracting: (2<=c2)
states: 20,266,493,617,345,472 (16)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-0 CANNOT_COMPUTE

MC time: 1m 9.441sec

checking: AG [_1_3_BPG<=c2]
normalized: ~ [E [true U ~ [_1_3_BPG<=c2]]]

abstracting: (_1_3_BPG<=c2)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-5 CANNOT_COMPUTE

MC time: 0m 0.003sec

checking: EF [GSSG<=PEP]
normalized: E [true U GSSG<=PEP]

abstracting: (GSSG<=PEP)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-9 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [NADPplus<=_1_3_BPG]
normalized: E [true U NADPplus<=_1_3_BPG]

abstracting: (NADPplus<=_1_3_BPG)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-13 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [b1<=ATP]
normalized: ~ [E [true U ~ [b1<=ATP]]]

abstracting: (b1<=ATP)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-14 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[3<=b2 & NADplus<=GAP]]
normalized: E [true U [3<=b2 & NADplus<=GAP]]

abstracting: (NADplus<=GAP)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-2 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [[[~ [2<=_3PG] & ~ [1<=G6P]] | 1<=Pi]]
normalized: ~ [E [true U ~ [[1<=Pi | [~ [1<=G6P] & ~ [2<=_3PG]]]]]]

abstracting: (2<=_3PG)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-12 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[[[1<=DHAP & 2<=start] | ~ [DHAP<=c1]] & 3<=E4P]]
normalized: E [true U [3<=E4P & [~ [DHAP<=c1] | [1<=DHAP & 2<=start]]]]

abstracting: (2<=start)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-8 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [~ [[[Pyr<=start & Pyr<=F6P] | ~ [1<=NADPplus]]]]
normalized: E [true U ~ [[~ [1<=NADPplus] | [Pyr<=start & Pyr<=F6P]]]]

abstracting: (Pyr<=F6P)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-10 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [[[[ATP<=NADplus & 3<=DHAP] | 2<=NADPH] | _2PG<=GAP]]
normalized: ~ [E [true U ~ [[_2PG<=GAP | [2<=NADPH | [ATP<=NADplus & 3<=DHAP]]]]]]

abstracting: (3<=DHAP)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-1 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [~ [[[3<=_3PG | 3<=F6P] & [NADPH<=a2 & Xu5P<=start]]]]
normalized: ~ [E [true U [[3<=_3PG | 3<=F6P] & [NADPH<=a2 & Xu5P<=start]]]]

abstracting: (Xu5P<=start)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-7 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [~ [[[PEP<=Ru5P | b2<=NADH] & ~ [NADplus<=DHAP]]]]
normalized: E [true U ~ [[~ [NADplus<=DHAP] & [PEP<=Ru5P | b2<=NADH]]]]

abstracting: (b2<=NADH)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-11 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[[[1<=_3PG & 2<=Ru5P] & GAP<=NADplus] & Xu5P<=GSSG]]
normalized: E [true U [Xu5P<=GSSG & [GAP<=NADplus & [1<=_3PG & 2<=Ru5P]]]]

abstracting: (2<=Ru5P)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-15 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[[[b2<=GSSG | Gluc<=NADPH] | 1<=R5P] & ~ [[3<=GSSG | 2<=Xu5P]]]]
normalized: E [true U [[1<=R5P | [b2<=GSSG | Gluc<=NADPH]] & ~ [[3<=GSSG | 2<=Xu5P]]]]

abstracting: (2<=Xu5P)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-3 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[[[2<=ADP & NADPH<=F6P] & ~ [c2<=a1]] & [[F6P<=G6P | 1<=R5P] & a1<=Pyr]]]
normalized: E [true U [[~ [c2<=a1] & [2<=ADP & NADPH<=F6P]] & [a1<=Pyr & [F6P<=G6P | 1<=R5P]]]]

abstracting: (1<=R5P)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-4 CANNOT_COMPUTE

MC time: 0m 0.000sec

totally nodes used: 33446979 (3.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 284303057 79933041 364236098
used/not used/entry size/cache size: 49236422 17872442 16 1024MB
basic ops cache: hits/miss/sum: 121749718 34458768 156208486
used/not used/entry size/cache size: 16546983 230233 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 5662538 1672230 7334768
used/not used/entry size/cache size: 1508090 6880518 32 256MB
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 50383657
1 9176882
2 3457791
3 1546847
4 1357541
5 616989
6 351359
7 110815
8 49779
9 24360
>= 10 32844

Total processing time: 6m27.323sec


BK_STOP 1494465850488

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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:11921 (541), effective:2875 (130)

initing FirstDep: 0m 0.000sec

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

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="GPPP-PT-C0100N0000010000"
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/GPPP-PT-C0100N0000010000.tgz
mv GPPP-PT-C0100N0000010000 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 GPPP-PT-C0100N0000010000, 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 r021-blw3-149440255300556"
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 ;