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 GPPP-PT-C1000N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468027900574
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465063060312


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

parse successfull
net created successfully

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

net check time: 0m 0.000sec

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

init dd package: 0m 4.042sec


RS generation: 0m59.256sec


-> reachability set: #nodes 561475 (5.6e+05) #states 1,140,616,996,412,371 (15)



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

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

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

FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.313sec

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

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

FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.838sec

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

abstracting: (3<=NADH) states: 846,924,444,597,774 (14)
-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m25.347sec

checking: EF [[3<=Xu5P | 2<=Lac]]
normalized: E [true U [3<=Xu5P | 2<=Lac]]

abstracting: (2<=Lac) states: 218,458,674,068,037 (14)
abstracting: (3<=Xu5P) states: 1,121,369,667,789,764 (15)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.031sec

checking: AG [~ [~ [[1<=c2 | 1<=GSSG]]]]
normalized: ~ [E [true U ~ [[1<=c2 | 1<=GSSG]]]]

abstracting: (1<=GSSG) states: 1,130,053,229,863,008 (15)
abstracting: (1<=c2) states: 1,138,113,727,587,675 (15)
-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.925sec

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

abstracting: (ATP<=_1_3_BPG) states: 15,722,404,232,919 (13)

before gc: list nodes free: 669444

after gc: idd nodes used:1384209, unused:62615791; list nodes free:567464586

FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-10 CANNOT_COMPUTE

MC time: 9m52.958sec

checking: EF [~ [[[1<=a1 | 2<=Pyr] | 3<=ATP]]]
normalized: E [true U ~ [[3<=ATP | [1<=a1 | 2<=Pyr]]]]


FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-11 CANNOT_COMPUTE

MC time: 0m 0.004sec

checking: EF [[Pyr<=ADP & 1<=Lac]]
normalized: E [true U [Pyr<=ADP & 1<=Lac]]


before gc: list nodes free: 75

after gc: idd nodes used:561586, unused:63438414; list nodes free:679468037
abstracting: (1<=Lac) states: 518,854,666,053,552 (14)
abstracting: (Pyr<=ADP) states: 1,140,616,996,412,371 (15)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.116sec

checking: AG [[[~ [2<=Xu5P] | ~ [2<=c2]] | ~ [~ [ATP<=_3PG]]]]
normalized: ~ [E [true U ~ [[ATP<=_3PG | [~ [2<=c2] | ~ [2<=Xu5P]]]]]]

abstracting: (2<=Xu5P) states: 1,127,783,556,545,121 (15)
abstracting: (2<=c2) states: 1,138,113,727,587,675 (15)
abstracting: (ATP<=_3PG) states: 15,777,622,303,287 (13)
-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.380sec

checking: EF [~ [[[3<=ATP | 2<=Ru5P] & Pyr<=Gluc]]]
normalized: E [true U ~ [[Pyr<=Gluc & [3<=ATP | 2<=Ru5P]]]]

abstracting: (2<=Ru5P) states: 1,127,788,952,635,929 (15)
abstracting: (3<=ATP) states: 1,113,493,314,562,198 (15)
abstracting: (Pyr<=Gluc) states: 1,140,616,996,412,371 (15)

FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-14 CANNOT_COMPUTE

MC time: 4m45.800sec

checking: AG [[3<=DHAP | [2<=Pyr | [_2PG<=GAP | 3<=Pi]]]]
normalized: ~ [E [true U ~ [[3<=DHAP | [2<=Pyr | [_2PG<=GAP | 3<=Pi]]]]]]


FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-12 CANNOT_COMPUTE

MC time: 0m 0.852sec

checking: EF [[~ [[_1_3_BPG<=b2 | 3<=_2PG]] & [2<=start | Pyr<=c2]]]
normalized: E [true U [~ [[_1_3_BPG<=b2 | 3<=_2PG]] & [2<=start | Pyr<=c2]]]


FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-1 CANNOT_COMPUTE

MC time: 0m 0.035sec

checking: EF [[1<=c2 & [[1<=c2 & 1<=b1] & [b1<=E4P & 3<=NADPH]]]]
normalized: E [true U [1<=c2 & [[b1<=E4P & 3<=NADPH] & [1<=c2 & 1<=b1]]]]


FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-5 CANNOT_COMPUTE

MC time: 0m 0.028sec

checking: EF [[[[1<=NADH & 3<=Lac] & [GSSG<=S7P & 1<=DHAP]] & Ru5P<=NADPplus]]
normalized: E [true U [Ru5P<=NADPplus & [[GSSG<=S7P & 1<=DHAP] & [1<=NADH & 3<=Lac]]]]


FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-6 CANNOT_COMPUTE

MC time: 0m 0.030sec

checking: EF [[NADPplus<=c1 & [GSSG<=F6P & [1<=Pyr | NADPplus<=_3PG]]]]
normalized: E [true U [NADPplus<=c1 & [GSSG<=F6P & [1<=Pyr | NADPplus<=_3PG]]]]


FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-9 CANNOT_COMPUTE

MC time: 0m 0.030sec

checking: EF [[[[NADplus<=a1 | 2<=c1] | NADplus<=E4P] & [NADPplus<=G6P & ~ [2<=FBP]]]]
normalized: E [true U [[NADplus<=E4P | [NADplus<=a1 | 2<=c1]] & [NADPplus<=G6P & ~ [2<=FBP]]]]


FORMULA GPPP-PT-C1000N0000000100-ReachabilityCardinality-0 CANNOT_COMPUTE

MC time: 0m 0.030sec


Total processing time: 20m37.973sec


BK_STOP 1465064298734

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

1224 2424 72267 107126 157421 212078 265350 315671 396578 476100 549948 561475
iterations count:12167 (553), effective:2934 (133)

initing FirstDep: 0m 0.000sec


iterations count:270 (12), effective:46 (2)

iterations count:230 (10), effective:42 (1)
465832 520925
iterations count:2043 (92), effective:303 (13)
532705std::bad_alloc

std::bad_alloc


iterations count:188 (8), effective:30 (1)

iterations count:223 (10), effective:39 (1)
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-C1000N0000000100"
export BK_EXAMINATION="ReachabilityCardinality"
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/GPPP-PT-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 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 GPPP-PT-C1000N0000000100, 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 r221su-smll-146468027900574"
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 ;