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

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

=== Now, execution of the tool begins

BK_START 1465033745333


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_C0001N0000000001
(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.415sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 561 (5.6e+02) #states 10,380 (4)



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

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (NADPplus<=b1) states: 10,272 (4)
abstracting: (c2<=GSSG) states: 732
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=Gluc) states: 1,638 (3)
abstracting: (c2<=c1) states: 3,000 (3)
abstracting: (3<=Xu5P) states: 0
abstracting: (2<=c1) states: 9,408 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [~ [[~ [3<=PEP] | [Pyr<=NADPH & Pyr<=Lac]]]]
normalized: E [true U ~ [[~ [3<=PEP] | [Pyr<=NADPH & Pyr<=Lac]]]]

abstracting: (Pyr<=Lac) states: 8,844 (3)
abstracting: (Pyr<=NADPH) states: 9,164 (3)
abstracting: (3<=PEP) states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[~ [~ [3<=Xu5P]] | [~ [Pi<=_3PG] & [2<=F6P & 3<=G6P]]]]
normalized: E [true U [3<=Xu5P | [[2<=F6P & 3<=G6P] & ~ [Pi<=_3PG]]]]

abstracting: (Pi<=_3PG) states: 234
abstracting: (3<=G6P) states: 18
abstracting: (2<=F6P) states: 558
abstracting: (3<=Xu5P) states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[~ [ATP<=start] | _1_3_BPG<=NADPH] | ~ [2<=NADplus]]]
normalized: ~ [E [true U ~ [[~ [2<=NADplus] | [_1_3_BPG<=NADPH | ~ [ATP<=start]]]]]]

abstracting: (ATP<=start) states: 2,652 (3)
abstracting: (_1_3_BPG<=NADPH) states: 9,646 (3)
abstracting: (2<=NADplus) states: 1,308 (3)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[Xu5P<=ATP | ~ [NADPH<=c2]] | ~ [[1<=Pyr | 2<=G6P]]]]
normalized: ~ [E [true U ~ [[~ [[1<=Pyr | 2<=G6P]] | [Xu5P<=ATP | ~ [NADPH<=c2]]]]]]

abstracting: (NADPH<=c2) states: 9,892 (3)
abstracting: (Xu5P<=ATP) states: 9,990 (3)
abstracting: (2<=G6P) states: 66
abstracting: (1<=Pyr) states: 3,156 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[~ [_2PG<=E4P] & [~ [Pyr<=Pyr] & [1<=Ru5P | 2<=c1]]]]
normalized: E [true U [[~ [Pyr<=Pyr] & [1<=Ru5P | 2<=c1]] & ~ [_2PG<=E4P]]]

abstracting: (_2PG<=E4P) states: 8,682 (3)
abstracting: (2<=c1) states: 9,408 (3)
abstracting: (1<=Ru5P) states: 1,212 (3)
abstracting: (Pyr<=Pyr) states: 10,380 (4)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[[2<=_3PG & [1<=ATP & 2<=NADplus]] & [GSSG<=_2PG & ~ [NADH<=F6P]]]]
normalized: E [true U [[2<=_3PG & [1<=ATP & 2<=NADplus]] & [GSSG<=_2PG & ~ [NADH<=F6P]]]]

abstracting: (NADH<=F6P) states: 2,550 (3)
abstracting: (GSSG<=_2PG) states: 6,525 (3)
abstracting: (2<=NADplus) states: 1,308 (3)
abstracting: (1<=ATP) states: 7,728 (3)
abstracting: (2<=_3PG) states: 420
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[[PEP<=b1 & [2<=a2 & 3<=ATP]] & [~ [b2<=NADplus] & ~ [3<=Lac]]]]
normalized: E [true U [[~ [3<=Lac] & ~ [b2<=NADplus]] & [PEP<=b1 & [2<=a2 & 3<=ATP]]]]

abstracting: (3<=ATP) states: 3,594 (3)
abstracting: (2<=a2) states: 108
abstracting: (PEP<=b1) states: 10,380 (4)
abstracting: (b2<=NADplus) states: 8,970 (3)
abstracting: (3<=Lac) states: 1,572 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [[[_3PG<=PEP & Gluc<=PEP] & [3<=GAP & c2<=Pyr]]]]
normalized: ~ [E [true U [[3<=GAP & c2<=Pyr] & [_3PG<=PEP & Gluc<=PEP]]]]

abstracting: (Gluc<=PEP) states: 9,078 (3)
abstracting: (_3PG<=PEP) states: 8,130 (3)
abstracting: (c2<=Pyr) states: 708
abstracting: (3<=GAP) states: 780
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[~ [~ [2<=Pyr]] & [[b2<=a2 & NADPH<=Lac] | [GAP<=FBP | 2<=Ru5P]]]]
normalized: E [true U [2<=Pyr & [[GAP<=FBP | 2<=Ru5P] | [b2<=a2 & NADPH<=Lac]]]]

abstracting: (NADPH<=Lac) states: 6,938 (3)
abstracting: (b2<=a2) states: 10,182 (4)
abstracting: (2<=Ru5P) states: 48
abstracting: (GAP<=FBP) states: 5,862 (3)
abstracting: (2<=Pyr) states: 492
-> the formula is TRUE

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

MC time: 0m 0.022sec

checking: EF [[[3<=FBP & [b1<=G6P & 3<=Gluc]] & [_1_3_BPG<=E4P | [E4P<=FBP | 2<=F6P]]]]
normalized: E [true U [[_1_3_BPG<=E4P | [E4P<=FBP | 2<=F6P]] & [3<=FBP & [b1<=G6P & 3<=Gluc]]]]

abstracting: (3<=Gluc) states: 42
abstracting: (b1<=G6P) states: 180
abstracting: (3<=FBP) states: 0
abstracting: (2<=F6P) states: 558
abstracting: (E4P<=FBP) states: 6,546 (3)
abstracting: (_1_3_BPG<=E4P) states: 9,138 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[[~ [F6P<=Pi] & GSH<=E4P] & [[3<=Pyr & 1<=NADPH] | [3<=b2 & _1_3_BPG<=_2PG]]]]
normalized: E [true U [[[3<=b2 & _1_3_BPG<=_2PG] | [3<=Pyr & 1<=NADPH]] & [GSH<=E4P & ~ [F6P<=Pi]]]]

abstracting: (F6P<=Pi) states: 10,380 (4)
abstracting: (GSH<=E4P) states: 5,190 (3)
abstracting: (1<=NADPH) states: 6,920 (3)
abstracting: (3<=Pyr) states: 0
abstracting: (_1_3_BPG<=_2PG) states: 8,694 (3)
abstracting: (3<=b2) states: 96
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[[~ [3<=_3PG] | [1<=PEP | _1_3_BPG<=ATP]] | [[2<=a1 & start<=GAP] | [c2<=FBP & _1_3_BPG<=R5P]]]]
normalized: ~ [E [true U ~ [[[[1<=PEP | _1_3_BPG<=ATP] | ~ [3<=_3PG]] | [[c2<=FBP & _1_3_BPG<=R5P] | [2<=a1 & start<=GAP]]]]]]

abstracting: (start<=GAP) states: 10,374 (4)
abstracting: (2<=a1) states: 6,804 (3)
abstracting: (_1_3_BPG<=R5P) states: 8,382 (3)
abstracting: (c2<=FBP) states: 606
abstracting: (3<=_3PG) states: 0
abstracting: (_1_3_BPG<=ATP) states: 9,702 (3)
abstracting: (1<=PEP) states: 2,670 (3)
-> the formula is TRUE

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

MC time: 0m 0.003sec


Total processing time: 0m 6.049sec


BK_STOP 1465033751418

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


iterations count:446 (20), effective:99 (4)

initing FirstDep: 0m 0.000sec


iterations count:505 (22), effective:121 (5)

iterations count:332 (15), effective:76 (3)

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