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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441599100570
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494884806629

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=CTLCardinality.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.169sec

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


RS generation: 0m 0.252sec


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



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

checking: AX [EF [1<=Pyr]]
normalized: ~ [EX [~ [E [true U 1<=Pyr]]]]

abstracting: (1<=Pyr)
states: 7,001,206,377 (9)
.-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.071sec

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

abstracting: (S7P<=c1)
states: 14,184,612,091 (10)
-> the formula is FALSE

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

MC time: 11m38.661sec

checking: E [~ [~ [1<=DHAP]] U EG [3<=b1]]
normalized: E [1<=DHAP U EG [3<=b1]]

abstracting: (3<=b1)
states: 14,184,358,263 (10)
...........................................
EG iterations: 43
abstracting: (1<=DHAP)
states: 6,027,723,840 (9)
-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.501sec

checking: EF [[EX [1<=b1] & AX [2<=Lac]]]
normalized: E [true U [~ [EX [~ [2<=Lac]]] & EX [1<=b1]]]

abstracting: (1<=b1)
states: 14,184,611,895 (10)
.abstracting: (2<=Lac)
states: 3,188,955,627 (9)
.-> the formula is TRUE

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

MC time: 0m 1.195sec

checking: AX [~ [EG [DHAP<=E4P]]]
normalized: ~ [EX [EG [DHAP<=E4P]]]

abstracting: (DHAP<=E4P)
states: 8,376,093,433 (9)
.........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 345
.-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.500sec

checking: EG [A [3<=a1 U b2<=_1_3_BPG]]
normalized: EG [[~ [EG [~ [b2<=_1_3_BPG]]] & ~ [E [~ [b2<=_1_3_BPG] U [~ [3<=a1] & ~ [b2<=_1_3_BPG]]]]]]

abstracting: (b2<=_1_3_BPG)
states: 42
abstracting: (3<=a1)
states: 13,286,020,654 (10)
abstracting: (b2<=_1_3_BPG)
states: 42
abstracting: (b2<=_1_3_BPG)
states: 42
.
EG iterations: 1
...........................................
EG iterations: 43
-> the formula is FALSE

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

MC time: 1m35.019sec

checking: AF [[AG [2<=NADPplus] & AG [GAP<=NADPplus]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [GAP<=NADPplus]]] & ~ [E [true U ~ [2<=NADPplus]]]]]]]

abstracting: (2<=NADPplus)
states: 12,967,632,465 (10)
abstracting: (GAP<=NADPplus)
states: 13,776,284,256 (10)
....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 340
-> the formula is FALSE

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

MC time: 0m37.459sec

checking: AG [AF [[1<=ADP & a2<=ADP]]]
normalized: ~ [E [true U EG [~ [[1<=ADP & a2<=ADP]]]]]

abstracting: (a2<=ADP)

before gc: list nodes free: 784053

after gc: idd nodes used:94235, unused:63905765; list nodes free:408299906
states: 14,184,612,091 (10)
abstracting: (1<=ADP)
states: 14,184,612,090 (10)
MC time: 12m 8.105sec

checking: E [[3<=a2 | _3PG<=ATP] U AG [3<=GSSG]]
normalized: E [[3<=a2 | _3PG<=ATP] U ~ [E [true U ~ [3<=GSSG]]]]

abstracting: (3<=GSSG)
states: 10,455,225,550 (10)
abstracting: (_3PG<=ATP)
states: 13,410,921,259 (10)
abstracting: (3<=a2)
states: 14,184,015,774 (10)
-> the formula is TRUE

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

MC time: 0m 1.087sec

checking: E [~ [[3<=_2PG & 1<=c1]] U ~ [[DHAP<=a2 | Pyr<=F6P]]]
normalized: E [~ [[3<=_2PG & 1<=c1]] U ~ [[DHAP<=a2 | Pyr<=F6P]]]

abstracting: (Pyr<=F6P)
states: 7,874,351,098 (9)
abstracting: (DHAP<=a2)
states: 14,184,376,561 (10)
abstracting: (1<=c1)
states: 14,093,890,987 (10)
abstracting: (3<=_2PG)
states: 1,055,187,978 (9)
-> the formula is FALSE

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

MC time: 0m 0.477sec

checking: EF [[[2<=a2 & [Ru5P<=GSSG | 2<=a2]] & [~ [2<=PEP] & NADPplus<=b1]]]
normalized: E [true U [[NADPplus<=b1 & ~ [2<=PEP]] & [2<=a2 & [Ru5P<=GSSG | 2<=a2]]]]

abstracting: (2<=a2)
states: 14,184,015,774 (10)
abstracting: (Ru5P<=GSSG)
states: 4,847,754,182 (9)
abstracting: (2<=a2)
states: 14,184,015,774 (10)
abstracting: (2<=PEP)
states: 2,751,593,763 (9)
abstracting: (NADPplus<=b1)
states: 12,489,923,523 (10)
-> the formula is TRUE

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

MC time: 0m50.281sec

checking: EF [[[[3<=_2PG | GSSG<=NADH] | [GSH<=b1 | 1<=G6P]] & 3<=F6P]]
normalized: E [true U [3<=F6P & [[GSH<=b1 | 1<=G6P] | [3<=_2PG | GSSG<=NADH]]]]

abstracting: (GSSG<=NADH)
states: 6,055,198,694 (9)
abstracting: (3<=_2PG)
states: 1,055,187,978 (9)
abstracting: (1<=G6P)
states: 13,128,134,451 (10)
abstracting: (GSH<=b1)
states: 12,870,566,395 (10)
abstracting: (3<=F6P)
states: 16,907,667 (7)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.943sec

checking: AG [[[[GSH<=NADH | 2<=NADplus] & [R5P<=Gluc | G6P<=ADP]] | ~ [~ [2<=DHAP]]]]
normalized: ~ [E [true U ~ [[2<=DHAP | [[R5P<=Gluc | G6P<=ADP] & [GSH<=NADH | 2<=NADplus]]]]]]

abstracting: (2<=NADplus)
states: 14,184,612,091 (10)
abstracting: (GSH<=NADH)
states: 3,522,919,414 (9)
abstracting: (G6P<=ADP)
states: 14,184,612,091 (10)
abstracting: (R5P<=Gluc)
states: 14,184,612,091 (10)
abstracting: (2<=DHAP)
states: 2,361,709,584 (9)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 12m44.823sec

checking: [1<=NADH | [AG [~ [2<=Pyr]] | [[[2<=DHAP | a1<=_1_3_BPG] | [1<=b2 | 3<=G6P]] & 1<=a1]]]
normalized: [1<=NADH | [[1<=a1 & [[1<=b2 | 3<=G6P] | [2<=DHAP | a1<=_1_3_BPG]]] | ~ [E [true U 2<=Pyr]]]]

abstracting: (2<=Pyr)
states: 3,188,955,627 (9)
abstracting: (a1<=_1_3_BPG)
states: 236,052,979 (8)
abstracting: (2<=DHAP)
states: 2,361,709,584 (9)
abstracting: (3<=G6P)
states: 11,173,493,637 (10)
abstracting: (1<=b2)
states: 14,184,612,049 (10)
abstracting: (1<=a1)
states: 14,184,016,012 (10)
abstracting: (1<=NADH)
states: 13,838,382,921 (10)
-> the formula is FALSE

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

MC time: 0m26.184sec

checking: [[Ru5P<=GSH & A [c1<=DHAP U 3<=PEP]] | [AG [3<=NADPplus] | [c1<=DHAP | [3<=Pyr & F6P<=F6P]]]]
normalized: [[[c1<=DHAP | [3<=Pyr & F6P<=F6P]] | ~ [E [true U ~ [3<=NADPplus]]]] | [Ru5P<=GSH & [~ [EG [~ [3<=PEP]]] & ~ [E [~ [3<=PEP] U [~ [c1<=DHAP] & ~ [3<=PEP]]]]]]]

abstracting: (3<=PEP)
states: 1,055,187,978 (9)
abstracting: (c1<=DHAP)
states: 956,932,320 (8)
abstracting: (3<=PEP)
states: 1,055,187,978 (9)
abstracting: (3<=PEP)
states: 1,055,187,978 (9)
.
EG iterations: 1
abstracting: (Ru5P<=GSH)
states: 7,522,490,497 (9)
abstracting: (3<=NADPplus)
states: 12,344,443,070 (10)
abstracting: (F6P<=F6P)
states: 14,184,612,091 (10)
abstracting: (3<=Pyr)
states: 1,311,646,473 (9)
abstracting: (c1<=DHAP)
states: 956,932,320 (8)
-> the formula is FALSE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.524sec

checking: [[E [1<=E4P U c2<=_2PG] | [EX [Gluc<=FBP] & [~ [Lac<=c1] & [c1<=start & GAP<=GSSG]]]] & EG [GAP<=_1_3_BPG]]
normalized: [EG [GAP<=_1_3_BPG] & [[[[c1<=start & GAP<=GSSG] & ~ [Lac<=c1]] & EX [Gluc<=FBP]] | E [1<=E4P U c2<=_2PG]]]

abstracting: (c2<=_2PG)

before gc: list nodes free: 1399593

after gc: idd nodes used:309560, unused:63690440; list nodes free:450703325
states: 26,713,066 (7)
abstracting: (1<=E4P)
states: 942,157,236 (8)
MC time: 10m31.564sec

checking: AG [AF [[1<=ADP & a2<=ADP]]]
normalized: ~ [E [true U EG [~ [[1<=ADP & a2<=ADP]]]]]

abstracting: (a2<=ADP)
states: 14,184,612,091 (10)
abstracting: (1<=ADP)
states: 14,184,612,090 (10)
..
EG iterations: 2
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [[E [1<=E4P U c2<=_2PG] | [EX [Gluc<=FBP] & [~ [Lac<=c1] & [c1<=start & GAP<=GSSG]]]] & EG [GAP<=_1_3_BPG]]
normalized: [EG [GAP<=_1_3_BPG] & [[[[c1<=start & GAP<=GSSG] & ~ [Lac<=c1]] & EX [Gluc<=FBP]] | E [1<=E4P U c2<=_2PG]]]

abstracting: (c2<=_2PG)
states: 26,713,066 (7)
abstracting: (1<=E4P)
states: 942,157,236 (8)

BK_TIME_CONFINEMENT_REACHED

--------------------
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:187 (8), effective:29 (1)

iterations count:76 (3), effective:6 (0)

iterations count:227 (10), effective:41 (1)

iterations count:43 (1), effective:3 (0)

iterations count:980 (44), effective:219 (9)

iterations count:1191 (54), effective:270 (12)

net_ddint.h:596: Timeout: after 304 sec


iterations count:793 (36), effective:179 (8)

iterations count:1523 (69), effective:364 (16)

iterations count:196 (8), effective:24 (1)

iterations count:132 (6), effective:17 (0)

iterations count:235 (10), effective:41 (1)

iterations count:103 (4), effective:13 (0)

iterations count:885 (40), effective:197 (8)

sat_reach.icc:155: Timeout: after 570 sec


iterations count:22 (1), effective:0 (0)

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="CTLCardinality"
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 CTLCardinality"
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-149441599100570"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;