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

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

=== Now, execution of the tool begins

BK_START 1465033842486


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_C0001N0000000010
(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.075sec


RS generation: 0m 0.017sec


-> reachability set: #nodes 1088 (1.1e+03) #states 1,655,346 (6)



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

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

abstracting: (3<=Lac) states: 100,947 (5)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [Pi<=ADP]
normalized: ~ [E [true U ~ [Pi<=ADP]]]

abstracting: (Pi<=ADP) states: 1,655,346 (6)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [DHAP<=ADP]
normalized: ~ [E [true U ~ [DHAP<=ADP]]]

abstracting: (DHAP<=ADP) states: 1,655,346 (6)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (a2<=ATP) states: 1,655,346 (6)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [~ [[Ru5P<=GSH & 3<=FBP]]]]
normalized: E [true U [Ru5P<=GSH & 3<=FBP]]

abstracting: (3<=FBP) states: 1,848 (3)
abstracting: (Ru5P<=GSH) states: 1,645,518 (6)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [~ [[ATP<=G6P | _2PG<=E4P]]]
normalized: E [true U ~ [[ATP<=G6P | _2PG<=E4P]]]

abstracting: (_2PG<=E4P) states: 1,045,506 (6)
abstracting: (ATP<=G6P) states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [[[[2<=F6P & 1<=DHAP] & ~ [2<=NADH]] | 3<=NADplus]]
normalized: ~ [E [true U ~ [[3<=NADplus | [~ [2<=NADH] & [2<=F6P & 1<=DHAP]]]]]]

abstracting: (1<=DHAP) states: 714,252 (5)
abstracting: (2<=F6P) states: 32,340 (4)
abstracting: (2<=NADH) states: 1,401,708 (6)
abstracting: (3<=NADplus) states: 1,655,346 (6)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[[3<=c2 | Xu5P<=ADP] | ~ [GSH<=GSH]]]]
normalized: E [true U ~ [[[3<=c2 | Xu5P<=ADP] | ~ [GSH<=GSH]]]]

abstracting: (GSH<=GSH) states: 1,655,346 (6)
abstracting: (Xu5P<=ADP) states: 1,655,346 (6)
abstracting: (3<=c2) states: 936,012 (5)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[PEP<=NADPH | [2<=a2 & [2<=R5P | PEP<=DHAP]]]]
normalized: ~ [E [true U ~ [[PEP<=NADPH | [2<=a2 & [2<=R5P | PEP<=DHAP]]]]]]

abstracting: (PEP<=DHAP) states: 1,158,234 (6)
abstracting: (2<=R5P) states: 0
abstracting: (2<=a2) states: 6,930 (3)
abstracting: (PEP<=NADPH) states: 1,601,842 (6)
-> the formula is FALSE

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

MC time: 0m 0.062sec

checking: AG [[[~ [DHAP<=R5P] & ADP<=c1] | S7P<=S7P]]
normalized: ~ [E [true U ~ [[S7P<=S7P | [ADP<=c1 & ~ [DHAP<=R5P]]]]]]

abstracting: (DHAP<=R5P) states: 943,404 (5)
abstracting: (ADP<=c1) states: 259,875 (5)
abstracting: (S7P<=S7P) states: 1,655,346 (6)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [[1<=GSH & _1_3_BPG<=NADplus]] & ~ [[b2<=R5P | GSH<=Xu5P]]]]
normalized: E [true U [~ [[b2<=R5P | GSH<=Xu5P]] & ~ [[1<=GSH & _1_3_BPG<=NADplus]]]]

abstracting: (_1_3_BPG<=NADplus) states: 1,655,346 (6)
abstracting: (1<=GSH) states: 1,504,860 (6)
abstracting: (GSH<=Xu5P) states: 150,591 (5)
abstracting: (b2<=R5P) states: 1,450,680 (6)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [~ [[[1<=F6P | GSH<=R5P] | [b2<=ADP & NADH<=NADPplus]]]]
normalized: E [true U ~ [[[b2<=ADP & NADH<=NADPplus] | [1<=F6P | GSH<=R5P]]]]

abstracting: (GSH<=R5P) states: 150,486 (5)
abstracting: (1<=F6P) states: 285,516 (5)
abstracting: (NADH<=NADPplus) states: 1,387,826 (6)
abstracting: (b2<=ADP) states: 1,655,346 (6)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: EF [[~ [[NADplus<=NADPH | S7P<=PEP]] & ~ [[3<=GSSG | F6P<=Xu5P]]]]
normalized: E [true U [~ [[3<=GSSG | F6P<=Xu5P]] & ~ [[NADplus<=NADPH | S7P<=PEP]]]]

abstracting: (S7P<=PEP) states: 1,647,954 (6)
abstracting: (NADplus<=NADPH) states: 346,346 (5)
abstracting: (F6P<=Xu5P) states: 1,379,763 (6)
abstracting: (3<=GSSG) states: 1,203,888 (6)
-> the formula is TRUE

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

MC time: 0m 0.033sec

checking: AG [[[[3<=b1 | E4P<=E4P] | [c2<=c2 | S7P<=NADPplus]] | 3<=Ru5P]]
normalized: ~ [E [true U ~ [[3<=Ru5P | [[c2<=c2 | S7P<=NADPplus] | [3<=b1 | E4P<=E4P]]]]]]

abstracting: (E4P<=E4P) states: 1,655,346 (6)
abstracting: (3<=b1) states: 1,446,060 (6)
abstracting: (S7P<=NADPplus) states: 1,654,994 (6)
abstracting: (c2<=c2) states: 1,655,346 (6)
abstracting: (3<=Ru5P) states: 1,155 (3)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AG [[[[R5P<=Xu5P | 3<=_1_3_BPG] | [3<=E4P & 2<=Gluc]] | [[3<=ADP & PEP<=a2] & NADPplus<=NADPplus]]]
normalized: ~ [E [true U ~ [[[NADPplus<=NADPplus & [3<=ADP & PEP<=a2]] | [[3<=E4P & 2<=Gluc] | [R5P<=Xu5P | 3<=_1_3_BPG]]]]]]

abstracting: (3<=_1_3_BPG) states: 100,947 (5)
abstracting: (R5P<=Xu5P) states: 1,648,416 (6)
abstracting: (2<=Gluc) states: 5,313 (3)
abstracting: (3<=E4P) states: 0
abstracting: (PEP<=a2) states: 1,022,868 (6)
abstracting: (3<=ADP) states: 1,635,249 (6)
abstracting: (NADPplus<=NADPplus) states: 1,655,346 (6)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[[b1<=GSSG | NADPplus<=_2PG] & 1<=Ru5P] | [[3<=S7P | b2<=b2] & [S7P<=NADplus & 1<=GSSG]]]]
normalized: ~ [E [true U ~ [[[[S7P<=NADplus & 1<=GSSG] & [3<=S7P | b2<=b2]] | [1<=Ru5P & [b1<=GSSG | NADPplus<=_2PG]]]]]]

abstracting: (NADPplus<=_2PG) states: 132,330 (5)
abstracting: (b1<=GSSG) states: 1,224,384 (6)
abstracting: (1<=Ru5P) states: 106,953 (5)
abstracting: (b2<=b2) states: 1,655,346 (6)
abstracting: (3<=S7P) states: 0
abstracting: (1<=GSSG) states: 1,504,860 (6)
abstracting: (S7P<=NADplus) states: 1,655,346 (6)
-> the formula is FALSE

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

MC time: 0m 0.025sec


Total processing time: 0m 5.762sec


BK_STOP 1465033848282

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

1092
iterations count:1795 (81), effective:420 (19)

initing FirstDep: 0m 0.000sec


iterations count:223 (10), effective:48 (2)

iterations count:469 (21), effective:110 (5)

iterations count:224 (10), effective:50 (2)

iterations count:430 (19), effective:116 (5)
1444 1453
iterations count:2270 (103), effective:545 (24)
1251 1242
iterations count:2680 (121), effective:663 (30)
1096 1090
iterations count:2869 (130), effective:717 (32)

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-C0001N0000000010"
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-C0001N0000000010.tgz
mv GPPP-PT-C0001N0000000010 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-C0001N0000000010, 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-146468027600448"
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 ;