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

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

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

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000010
(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.866sec


RS generation: 0m 0.062sec


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



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

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

abstracting: (1<=ATP)
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 [[2<=Pyr & 1<=GSH]]
normalized: E [true U [2<=Pyr & 1<=GSH]]

abstracting: (1<=GSH)
states: 1,504,860 (6)
abstracting: (2<=Pyr)
states: 279,048 (5)
-> the formula is TRUE

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

MC time: 0m 0.032sec

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

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

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

MC time: 0m 0.000sec

checking: AG [~ [GSSG<=NADPH]]
normalized: ~ [E [true U GSSG<=NADPH]]

abstracting: (GSSG<=NADPH)
states: 1,261,216 (6)
-> the formula is FALSE

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

MC time: 0m 0.018sec

checking: AG [[Lac<=_3PG | ~ [2<=b1]]]
normalized: ~ [E [true U ~ [[~ [2<=b1] | Lac<=_3PG]]]]

abstracting: (Lac<=_3PG)
states: 1,158,234 (6)
abstracting: (2<=b1)
states: 1,643,796 (6)
-> the formula is FALSE

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

MC time: 0m 0.015sec

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

abstracting: (1<=GSSG)
states: 1,504,860 (6)
abstracting: (GAP<=b1)
states: 1,616,076 (6)
-> the formula is FALSE

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

MC time: 0m 0.017sec

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

abstracting: (_3PG<=ATP)
states: 1,655,346 (6)
abstracting: (2<=Gluc)
states: 5,313 (3)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [~ [[~ [2<=S7P] | ~ [R5P<=GAP]]]]
normalized: E [true U ~ [[~ [R5P<=GAP] | ~ [2<=S7P]]]]

abstracting: (2<=S7P)
states: 0
abstracting: (R5P<=GAP)
states: 1,648,416 (6)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [~ [[~ [2<=F6P] | [_3PG<=PEP | 3<=GSSG]]]]
normalized: E [true U ~ [[[_3PG<=PEP | 3<=GSSG] | ~ [2<=F6P]]]]

abstracting: (2<=F6P)
states: 32,340 (4)
abstracting: (3<=GSSG)
states: 1,203,888 (6)
abstracting: (_3PG<=PEP)
states: 1,158,234 (6)
-> the formula is TRUE

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

MC time: 0m 0.031sec

checking: AG [[[[1<=F6P | 3<=NADPplus] | G6P<=Gluc] | ~ [~ [1<=R5P]]]]
normalized: ~ [E [true U ~ [[1<=R5P | [G6P<=Gluc | [1<=F6P | 3<=NADPplus]]]]]]

abstracting: (3<=NADPplus)
states: 1,418,868 (6)
abstracting: (1<=F6P)
states: 285,516 (5)
abstracting: (G6P<=Gluc)
states: 1,551,396 (6)
abstracting: (1<=R5P)
states: 11,550 (4)
-> the formula is FALSE

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

MC time: 0m 0.051sec

checking: AG [[~ [~ [2<=Ru5P]] | [[b2<=Gluc | Pi<=NADPH] | ~ [2<=Lac]]]]
normalized: ~ [E [true U ~ [[2<=Ru5P | [~ [2<=Lac] | [b2<=Gluc | Pi<=NADPH]]]]]]

abstracting: (Pi<=NADPH)
states: 1,424,665 (6)
abstracting: (b2<=Gluc)
states: 1,548,393 (6)
abstracting: (2<=Lac)
states: 279,048 (5)
abstracting: (2<=Ru5P)
states: 4,620 (3)
-> the formula is FALSE

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

MC time: 0m 0.024sec

checking: EF [[~ [[NADPH<=Pyr | 1<=b2]] & ~ [[3<=ADP | Pyr<=DHAP]]]]
normalized: E [true U [~ [[3<=ADP | Pyr<=DHAP]] & ~ [[NADPH<=Pyr | 1<=b2]]]]

abstracting: (1<=b2)
states: 209,286 (5)
abstracting: (NADPH<=Pyr)
states: 132,330 (5)
abstracting: (Pyr<=DHAP)
states: 1,158,234 (6)
abstracting: (3<=ADP)
states: 1,635,249 (6)
-> the formula is TRUE

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

MC time: 0m 0.034sec

checking: AG [[~ [2<=S7P] | [[ATP<=NADplus & ATP<=Xu5P] | [3<=_3PG & a1<=b2]]]]
normalized: ~ [E [true U ~ [[[[3<=_3PG & a1<=b2] | [ATP<=NADplus & ATP<=Xu5P]] | ~ [2<=S7P]]]]]

abstracting: (2<=S7P)
states: 0
abstracting: (ATP<=Xu5P)
states: 0
abstracting: (ATP<=NADplus)
states: 0
abstracting: (a1<=b2)
states: 208,131 (5)
abstracting: (3<=_3PG)
states: 100,947 (5)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EF [[[FBP<=c2 | [ADP<=F6P & 3<=_2PG]] & [[2<=ATP | 2<=G6P] & [2<=Xu5P & R5P<=Ru5P]]]]
normalized: E [true U [[[2<=Xu5P & R5P<=Ru5P] & [2<=ATP | 2<=G6P]] & [FBP<=c2 | [ADP<=F6P & 3<=_2PG]]]]

abstracting: (3<=_2PG)
states: 100,947 (5)
abstracting: (ADP<=F6P)
states: 2,079 (3)
abstracting: (FBP<=c2)
states: 1,648,878 (6)
abstracting: (2<=G6P)
states: 5,313 (3)
abstracting: (2<=ATP)
states: 1,655,346 (6)
abstracting: (R5P<=Ru5P)
states: 1,648,416 (6)
abstracting: (2<=Xu5P)
states: 1,155 (3)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[[[_3PG<=b2 | b1<=ADP] | 1<=FBP] & [GSH<=ATP | [3<=Pi & b1<=GSH]]]]
normalized: ~ [E [true U ~ [[[GSH<=ATP | [3<=Pi & b1<=GSH]] & [1<=FBP | [_3PG<=b2 | b1<=ADP]]]]]]

abstracting: (b1<=ADP)
states: 1,635,249 (6)
abstracting: (_3PG<=b2)
states: 1,000,230 (6)
abstracting: (1<=FBP)
states: 285,516 (5)
abstracting: (b1<=GSH)
states: 1,373,820 (6)
abstracting: (3<=Pi)
states: 967,659 (5)
abstracting: (GSH<=ATP)
states: 1,655,346 (6)
-> the formula is FALSE

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

MC time: 0m 0.024sec

checking: AG [[[[1<=start & GAP<=S7P] | [S7P<=NADplus | ATP<=c1]] & [~ [2<=Pi] | [3<=a2 | 1<=ADP]]]]
normalized: ~ [E [true U ~ [[[[3<=a2 | 1<=ADP] | ~ [2<=Pi]] & [[S7P<=NADplus | ATP<=c1] | [1<=start & GAP<=S7P]]]]]]

abstracting: (GAP<=S7P)
states: 943,866 (5)
abstracting: (1<=start)
states: 231
abstracting: (ATP<=c1)
states: 0
abstracting: (S7P<=NADplus)
states: 1,655,346 (6)
abstracting: (2<=Pi)
states: 1,258,719 (6)
abstracting: (1<=ADP)
states: 1,653,267 (6)
abstracting: (3<=a2)
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.004sec

totally nodes used: 66409 (6.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 361943 223254 585197
used/not used/entry size/cache size: 274865 66833999 16 1024MB
basic ops cache: hits/miss/sum: 83229 121896 205125
used/not used/entry size/cache size: 196937 16580279 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: 5347 8480 13827
used/not used/entry size/cache size: 8479 8380129 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 67049976
1 57954
2 547
3 127
4 37
5 14
6 20
7 23
8 9
9 4
>= 10 153

Total processing time: 0m 7.245sec


BK_STOP 1494464520053

--------------------
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.001sec


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

initing FirstDep: 0m 0.000sec


iterations count:506 (23), effective:117 (5)

iterations count:1427 (64), effective:350 (15)

iterations count:164 (7), effective:37 (1)

iterations count:3128 (142), effective:782 (35)

iterations count:2679 (121), effective:661 (30)

iterations count:2832 (128), effective:705 (32)

iterations count:493 (22), effective:136 (6)

iterations count:599 (27), effective:148 (6)

iterations count:391 (17), effective:94 (4)

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="/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-C0001N0000000010.tgz
mv GPPP-PT-C0001N0000000010 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-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 r021-blw3-149440255300520"
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 ;