fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r091-blw7-152650003600327
Last Updated
June 26, 2018

About the Execution of Irma.struct for GPPP-PT-C0100N0000010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.330 291549.00 299806.00 5104.50 ???????????????? normal

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)
.................
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is GPPP-PT-C0100N0000010000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-blw7-152650003600327
=====================================================================


--------------------
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-C0100N0000010000-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1527198636964


BK_STOP 1527198928513

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-C0100N0000010000 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 387793, 'Memory': 15933.58, 'Tool': 'marcie'}, {'Time': 395777, 'Memory': 15933.82, 'Tool': 'marcie'}, {'Time': 1327470, 'Memory': 15949.57, 'Tool': 'lola'}, {'Time': 1408400, 'Memory': 15952.78, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 3.4231406961961666x far from the best tool marcie.
ReachabilityCardinality marcie GPPP-PT-C0100N0000010000...
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_C0100N0000010000
(NrP: 33 NrTr: 22 NrArc: 83)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

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

net check time: 0m 0.000sec

init dd package: 0m 1.390sec

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

parse successfull
net created successfully

Net: GPPP_PT_C0100N0000010000
(NrP: 33 NrTr: 22 NrArc: 83)

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

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec


initing FirstDep: 0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 4.084sec


iterations count:11921 (541), effective:2875 (130)

initing FirstDep: 0m 0.000sec


RS generation: 3m46.049sec


-> reachability set: #nodes 713713 (7.1e+05) #states 20,292,531,036,711,574 (16)



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

std::bad_alloc
checking: EF [1<=PEP]

normalized: E [true U 1<=PEP]
std::bad_alloc


abstracting: (1<=PEP)
states: 10,234,249,146,421,722 (16)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-14 CANNOT_COMPUTE

MC time: 0m37.304sec

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

abstracting: (NADPplus<=Ru5P)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-04 CANNOT_COMPUTE

MC time: 0m 0.775sec

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

abstracting: (NADPH<=NADPH)
states: 20,292,531,036,711,574 (16)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-09 CANNOT_COMPUTE

MC time: 0m 0.562sec

checking: AG [~ [~ [[c1<=E4P | 3<=NADplus]]]]
normalized: ~ [E [true U ~ [[c1<=E4P | 3<=NADplus]]]]

abstracting: (3<=NADplus)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-05 CANNOT_COMPUTE

MC time: 0m 0.873sec

checking: AG [[~ [[1<=_2PG & 3<=start]] | 2<=a2]]
normalized: ~ [E [true U ~ [[2<=a2 | ~ [[1<=_2PG & 3<=start]]]]]]

abstracting: (3<=start)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-06 CANNOT_COMPUTE

MC time: 0m 0.374sec

checking: AG [~ [~ [[b2<=Gluc | 3<=GSH]]]]
normalized: ~ [E [true U ~ [[b2<=Gluc | 3<=GSH]]]]

abstracting: (3<=GSH)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-07 CANNOT_COMPUTE

MC time: 0m 0.506sec

checking: EF [~ [~ [[1<=c2 & b2<=GSH]]]]
normalized: E [true U [1<=c2 & b2<=GSH]]

abstracting: (b2<=GSH)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-11 CANNOT_COMPUTE

MC time: 0m 0.195sec

checking: EF [[c1<=GSH & ~ [[1<=a2 & Xu5P<=Gluc]]]]
normalized: E [true U [c1<=GSH & ~ [[1<=a2 & Xu5P<=Gluc]]]]

abstracting: (Xu5P<=Gluc)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-02 CANNOT_COMPUTE

MC time: 0m 0.404sec

checking: EF [[GSSG<=b1 & [2<=NADPplus & ~ [GSSG<=start]]]]
normalized: E [true U [GSSG<=b1 & [2<=NADPplus & ~ [GSSG<=start]]]]

abstracting: (GSSG<=start)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-15 CANNOT_COMPUTE

MC time: 0m 0.772sec

checking: AG [[PEP<=_3PG | [~ [3<=Pi] & [NADplus<=b1 | R5P<=NADPplus]]]]
normalized: ~ [E [true U ~ [[PEP<=_3PG | [[NADplus<=b1 | R5P<=NADPplus] & ~ [3<=Pi]]]]]]

abstracting: (3<=Pi)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-08 CANNOT_COMPUTE

MC time: 0m 0.465sec

checking: EF [[[[_3PG<=a2 & 3<=Lac] | [1<=_2PG & 2<=start]] & ~ [[3<=c1 | NADPplus<=Lac]]]]
std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

normalized: E [true U [~ [[3<=c1 | NADPplus<=Lac]] & [[1<=_2PG & 2<=start] | [_3PG<=a2 & 3<=Lac]]]]

abstracting: (3<=Lac)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-00 CANNOT_COMPUTE

MC time: 0m 0.044sec

checking: EF [[~ [~ [3<=_3PG]] & [[3<=_2PG & c1<=Xu5P] | [GSH<=NADPH | _3PG<=Ru5P]]]]
normalized: E [true U [3<=_3PG & [[GSH<=NADPH | _3PG<=Ru5P] | [3<=_2PG & c1<=Xu5P]]]]

abstracting: (c1<=Xu5P)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-13 CANNOT_COMPUTE

MC time: 0m 0.122sec

checking: EF [[[~ [GSH<=ATP] | [2<=c2 & NADplus<=S7P]] & ~ [[GSH<=a1 & NADplus<=_3PG]]]]
normalized: E [true U [~ [[GSH<=a1 & NADplus<=_3PG]] & [[2<=c2 & NADplus<=S7P] | ~ [GSH<=ATP]]]]

abstracting: (GSH<=ATP)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-01 CANNOT_COMPUTE

MC time: 0m 0.041sec

checking: EF [[[[b2<=R5P & 2<=a2] & [Lac<=GSSG | 2<=FBP]] & [1<=Lac | [3<=FBP & 2<=Lac]]]]
normalized: E [true U [[1<=Lac | [3<=FBP & 2<=Lac]] & [[Lac<=GSSG | 2<=FBP] & [b2<=R5P & 2<=a2]]]]

abstracting: (2<=a2)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-03 CANNOT_COMPUTE

MC time: 0m 0.207sec

checking: AG [[[[Lac<=Gluc | _1_3_BPG<=_2PG] | 1<=c1] | [[Ru5P<=F6P & 1<=_2PG] & ~ [_1_3_BPG<=Lac]]]]
normalized: ~ [E [true U ~ [[[~ [_1_3_BPG<=Lac] & [Ru5P<=F6P & 1<=_2PG]] | [1<=c1 | [Lac<=Gluc | _1_3_BPG<=_2PG]]]]]]

abstracting: (_1_3_BPG<=_2PG)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-12 CANNOT_COMPUTE

MC time: 0m 0.043sec

checking: EF [[[~ [NADH<=_3PG] & [2<=PEP & ATP<=NADH]] & [[1<=b2 | a1<=NADPH] | [3<=_2PG | Pi<=Ru5P]]]]
normalized: E [true U [[[3<=_2PG | Pi<=Ru5P] | [1<=b2 | a1<=NADPH]] & [[2<=PEP & ATP<=NADH] & ~ [NADH<=_3PG]]]]

abstracting: (NADH<=_3PG)

FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-10 CANNOT_COMPUTE

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

MC time: 0m 0.156sec

totally nodes used: 30600196 (3.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 299973180 62669525 362642705
used/not used/entry size/cache size: 43087211 24021653 16 1024MB
basic ops cache: hits/miss/sum: 129909056 30308664 160217720
used/not used/entry size/cache size: 16452798 324418 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: 7700314 1320081 9020395
used/not used/entry size/cache size: 1216331 7172277 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 52454915
1 7670443
2 3057943
3 1349062
4 1409780
5 614557
6 349364
7 101604
8 50377
9 24466
>= 10 26353

Total processing time: 4m47.777sec

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-C0100N0000010000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
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-C0100N0000010000.tgz
mv GPPP-PT-C0100N0000010000 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is GPPP-PT-C0100N0000010000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-blw7-152650003600327"
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 ;