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 S_GPPP-PT-C1000N0000000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441599100574
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494884824965

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_C1000N0000000010
(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.176sec

parse successfull
net created successfully

Net: GPPP_PT_C1000N0000000010
(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.720sec


RS generation: 0m 0.359sec


-> reachability set: #nodes 19855 (2.0e+04) #states 14,184,612,091 (10)



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

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

abstracting: (3<=Lac)
states: 1,311,646,473 (9)
-> the formula is TRUE

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

MC time: 0m 1.719sec

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

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

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

MC time: 0m 0.019sec

checking: EF [1<=_3PG]
normalized: E [true U 1<=_3PG]

abstracting: (1<=_3PG)
states: 6,495,048,153 (9)
-> the formula is TRUE

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

MC time: 0m 0.820sec

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

abstracting: (Lac<=b2)
states: 14,184,612,091 (10)
-> the formula is TRUE

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

MC time: 0m 0.702sec

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

abstracting: (_3PG<=ATP)
states: 13,410,921,259 (10)
-> the formula is FALSE

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

MC time: 0m 1.967sec

checking: EF [[3<=F6P & Pi<=a1]]
normalized: E [true U [3<=F6P & Pi<=a1]]

abstracting: (Pi<=a1)
states: 1
abstracting: (3<=F6P)
states: 16,907,667 (7)
-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.682sec

checking: EF [[~ [R5P<=b1] | ~ [[3<=NADplus | 3<=NADPH]]]]
normalized: E [true U [~ [[3<=NADplus | 3<=NADPH]] | ~ [R5P<=b1]]]

abstracting: (R5P<=b1)
states: 14,184,612,091 (10)
abstracting: (3<=NADPH)
states: 12,034,996,818 (10)
abstracting: (3<=NADplus)
states: 14,184,612,091 (10)
-> the formula is FALSE

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

MC time: 0m 0.470sec

checking: EF [~ [[~ [1<=b2] | [2<=a2 | PEP<=ATP]]]]
normalized: E [true U ~ [[~ [1<=b2] | [2<=a2 | PEP<=ATP]]]]

abstracting: (PEP<=ATP)
states: 13,410,921,259 (10)
abstracting: (2<=a2)
states: 14,184,015,774 (10)
abstracting: (1<=b2)
states: 14,184,612,049 (10)
-> the formula is FALSE

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

MC time: 0m 0.105sec

checking: AG [[~ [[3<=NADplus | _2PG<=b1]] | ~ [[3<=Lac & 2<=Xu5P]]]]
normalized: ~ [E [true U ~ [[~ [[3<=Lac & 2<=Xu5P]] | ~ [[3<=NADplus | _2PG<=b1]]]]]]

abstracting: (_2PG<=b1)
states: 14,184,240,308 (10)
abstracting: (3<=NADplus)
states: 14,184,612,091 (10)
abstracting: (2<=Xu5P)
states: 12,506,226,876 (10)
abstracting: (3<=Lac)
states: 1,311,646,473 (9)
-> the formula is FALSE

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

MC time: 0m 1.049sec

checking: EF [[[3<=start & [Pi<=GSSG & 3<=c1]] & ~ [1<=GSH]]]
normalized: E [true U [~ [1<=GSH] & [3<=start & [Pi<=GSSG & 3<=c1]]]]

abstracting: (3<=c1)
states: 12,629,766,820 (10)
abstracting: (Pi<=GSSG)
states: 1
abstracting: (3<=start)
states: 0
abstracting: (1<=GSH)
states: 12,846,993,996 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.755sec

checking: EF [[1<=c1 & ~ [[_2PG<=ADP | G6P<=b1]]]]
normalized: E [true U [1<=c1 & ~ [[_2PG<=ADP | G6P<=b1]]]]

abstracting: (G6P<=b1)
states: 11,868,259,358 (10)
abstracting: (_2PG<=ADP)
states: 14,184,612,091 (10)
abstracting: (1<=c1)
states: 14,093,890,987 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.129sec

checking: AG [~ [[[GSSG<=Gluc & 3<=Gluc] & ~ [start<=ADP]]]]
normalized: ~ [E [true U [~ [start<=ADP] & [GSSG<=Gluc & 3<=Gluc]]]]

abstracting: (3<=Gluc)
states: 14,184,612,090 (10)
abstracting: (GSSG<=Gluc)
states: 14,184,612,090 (10)
abstracting: (start<=ADP)
states: 14,184,612,090 (10)
-> the formula is TRUE

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

MC time: 14m45.435sec

checking: AG [[[1<=c1 | ADP<=c1] | ~ [[a1<=NADplus & 2<=_3PG]]]]
normalized: ~ [E [true U ~ [[~ [[a1<=NADplus & 2<=_3PG]] | [1<=c1 | ADP<=c1]]]]]

abstracting: (ADP<=c1)
states: 2
abstracting: (1<=c1)
states: 14,093,890,987 (10)
abstracting: (2<=_3PG)
states: 2,751,593,763 (9)
abstracting: (a1<=NADplus)
states: 10,396,467,471 (10)
-> the formula is TRUE

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

MC time: 0m40.930sec

checking: EF [[2<=S7P & [[b2<=c2 & Pi<=a2] | [1<=E4P | a2<=b1]]]]
normalized: E [true U [2<=S7P & [[1<=E4P | a2<=b1] | [b2<=c2 & Pi<=a2]]]]

abstracting: (Pi<=a2)
states: 1
abstracting: (b2<=c2)

before gc: list nodes free: 5851

after gc: idd nodes used:126975, unused:63873025; list nodes free:554775639
states: 14,157,899,067 (10)
abstracting: (a2<=b1)
states: 596,317 (5)
abstracting: (1<=E4P)
states: 942,157,236 (8)
abstracting: (2<=S7P)
states: 0
-> the formula is FALSE

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

MC time: 18m10.887sec

checking: AG [[[[1<=ATP | 3<=F6P] | [3<=NADH | Pi<=PEP]] | ~ [[_3PG<=NADPplus | NADPplus<=NADPH]]]]
normalized: ~ [E [true U ~ [[~ [[_3PG<=NADPplus | NADPplus<=NADPH]] | [[3<=NADH | Pi<=PEP] | [1<=ATP | 3<=F6P]]]]]]

abstracting: (3<=F6P)
states: 16,907,667 (7)
abstracting: (1<=ATP)
states: 13,128,134,452 (10)
abstracting: (Pi<=PEP)
states: 1
abstracting: (3<=NADH)
states: 10,788,237,324 (10)
abstracting: (NADPplus<=NADPH)
states: 7,115,875,933 (9)
abstracting: (_3PG<=NADPplus)
states: 13,720,482,885 (10)
MC time: 20m57.707sec

checking: AG [[[[_2PG<=Gluc | F6P<=start] | ~ [3<=NADPplus]] | [[_3PG<=_3PG | start<=R5P] | [2<=a2 & 2<=c2]]]]
normalized: ~ [E [true U ~ [[[[2<=a2 & 2<=c2] | [_3PG<=_3PG | start<=R5P]] | [~ [3<=NADPplus] | [_2PG<=Gluc | F6P<=start]]]]]]

abstracting: (F6P<=start)
states: 11,629,501,356 (10)
abstracting: (_2PG<=Gluc)
states: 14,184,612,091 (10)
abstracting: (3<=NADPplus)
states: 12,344,443,070 (10)
abstracting: (start<=R5P)
states: 14,184,612,090 (10)
abstracting: (_3PG<=_3PG)
states: 14,184,612,091 (10)
abstracting: (2<=c2)
states: 14,157,899,025 (10)
abstracting: (2<=a2)
states: 14,184,015,774 (10)
-> the formula is TRUE

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

MC time: 2m22.875sec

checking: AG [[[[1<=ATP | 3<=F6P] | [3<=NADH | Pi<=PEP]] | ~ [[_3PG<=NADPplus | NADPplus<=NADPH]]]]
normalized: ~ [E [true U ~ [[~ [[_3PG<=NADPplus | NADPplus<=NADPH]] | [[3<=NADH | Pi<=PEP] | [1<=ATP | 3<=F6P]]]]]]

abstracting: (3<=F6P)
states: 16,907,667 (7)
abstracting: (1<=ATP)
states: 13,128,134,452 (10)
abstracting: (Pi<=PEP)
states: 1
abstracting: (3<=NADH)
states: 10,788,237,324 (10)
abstracting: (NADPplus<=NADPH)
states: 7,115,875,933 (9)
abstracting: (_3PG<=NADPplus)
states: 13,720,482,885 (10)
-> the formula is FALSE

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

MC time: 0m 4.012sec

totally nodes used: 85393095 (8.5e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 10171228 5400356 15571584
used/not used/entry size/cache size: 2604459 64504405 16 1024MB
basic ops cache: hits/miss/sum: 5456523 87453871 92910394
used/not used/entry size/cache size: 16754357 22859 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: 439188 242232 681420
used/not used/entry size/cache size: 118876 8269732 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 66418547
1 668471
2 11654
3 956
4 968
5 544
6 123
7 45
8 94
9 34
>= 10 7428

Total processing time: 57m28.466sec


BK_STOP 1494888273789

--------------------
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:1727 (78), effective:414 (18)

initing FirstDep: 0m 0.000sec


iterations count:287 (13), effective:56 (2)

iterations count:186 (8), effective:28 (1)

iterations count:416 (18), effective:74 (3)

iterations count:329 (14), effective:62 (2)

sat_reach.icc:155: Timeout: after 780 sec


iterations count:366 (16), effective:84 (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="S_GPPP-PT-C1000N0000000010"
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/S_GPPP-PT-C1000N0000000010.tgz
mv S_GPPP-PT-C1000N0000000010 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 S_GPPP-PT-C1000N0000000010, 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 r101-blw3-149441599100574"
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 ;