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

About the Execution of M4M.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
11922.870 224170.00 449207.00 133.40 ???????????????? 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 200K
-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 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 26 09:26 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 mcc4mcc-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 r095-blw7-152650007300327
=====================================================================


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


BK_STOP 1527618694271

--------------------
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 lola GPPP-PT-C0100N0000010000...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
GPPP-PT-C0100N0000010000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000010000: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ GPPP-PT-C0100N0000010000 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0100N0000010000-ReachabilityCardinality.task
lola: E (F (((c1 <= 2) AND (Lac + 1 <= NADPplus) AND (((2 <= start) AND (1 <= _2PG)) OR ((3 <= Lac) AND (_3PG <= a2)))))) : E (F ((((_3PG + 1 <= NADplus) OR (a1 + 1 <= GSH)) AND (((NADplus <= S7P) AND (2 <= c2)) OR (ATP + 1 <= GSH))))) : E (F ((((Gluc + 1 <= Xu5P) OR (a2 <= 0)) AND (c1 <= GSH)))) : E (F (((2 <= a2) AND (b2 <= R5P) AND ((2 <= FBP) OR (Lac <= GSSG)) AND (((2 <= Lac) AND (3 <= FBP)) OR (1 <= Lac))))) : A (G ((Ru5P + 1 <= NADPplus))) : A (G (((3 <= NADplus) OR (c1 <= E4P)))) : A (G (((start <= 2) OR (_2PG <= 0) OR (2 <= a2)))) : A (G (((3 <= GSH) OR (b2 <= Gluc)))) : A (G (((((R5P <= NADPplus) OR (NADplus <= b1)) AND (Pi <= 2)) OR (PEP <= _3PG)))) : A (G (TRUE)) : E (F (((ATP <= NADH) AND (2 <= PEP) AND (_3PG + 1 <= NADH) AND ((a1 <= NADPH) OR (1 <= b2) OR (Pi <= Ru5P) OR (3 <= _2PG))))) : E (F (((b2 <= GSH) AND (1 <= c2)))) : A (G (((_1_3_BPG <= _2PG) OR (Lac <= Gluc) OR (1 <= c1) OR ((1 <= _2PG) AND (Ru5P <= F6P) AND (Lac + 1 <= _1_3_BPG))))) : E (F ((((_3PG <= Ru5P) OR (GSH <= NADPH) OR ((c1 <= Xu5P) AND (3 <= _2PG))) AND (3 <= _3PG)))) : E (F ((1 <= PEP))) : E (F (((start + 1 <= GSSG) AND (2 <= NADPplus) AND (GSSG <= b1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((c1 <= 2) AND (Lac + 1 <= NADPplus) AND (((2 <= start) AND (1 <= _2PG)) OR ((3 <= Lac) AND (_3PG <= a2))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3710253 markings, 9989682 edges, 742051 markings/sec, 0 secs
lola: sara is running 5 secs || 7215571 markings, 18645948 edges, 701064 markings/sec, 5 secs
lola: sara is running 10 secs || 10581979 markings, 26722975 edges, 673282 markings/sec, 10 secs
lola: sara is running 15 secs || 13830543 markings, 34516910 edges, 649713 markings/sec, 15 secs
lola: sara is running 20 secs || 16984568 markings, 42084251 edges, 630805 markings/sec, 20 secs
lola: sara is running 25 secs || 20054391 markings, 49449343 edges, 613965 markings/sec, 25 secs
lola: sara is running 30 secs || 22974866 markings, 56456088 edges, 584095 markings/sec, 30 secs
lola: sara is running 35 secs || 25892531 markings, 63456028 edges, 583533 markings/sec, 35 secs
lola: sara is running 40 secs || 28824773 markings, 70491084 edges, 586448 markings/sec, 40 secs
lola: sara is running 45 secs || 31931875 markings, 77945232 edges, 621420 markings/sec, 45 secs
lola: sara is running 50 secs || 34971758 markings, 85238205 edges, 607977 markings/sec, 50 secs
lola: sara is running 55 secs || 37968156 markings, 92426733 edges, 599280 markings/sec, 55 secs
lola: sara is running 60 secs || 40903767 markings, 99469371 edges, 587122 markings/sec, 60 secs
lola: sara is running 65 secs || 44040201 markings, 106993569 edges, 627287 markings/sec, 65 secs
lola: sara is running 70 secs || 47178206 markings, 114521597 edges, 627601 markings/sec, 70 secs
lola: sara is running 75 secs || 50392117 markings, 122231409 edges, 642782 markings/sec, 75 secs
lola: sara is running 80 secs || 53293996 markings, 129177627 edges, 580376 markings/sec, 80 secs
lola: sara is running 85 secs || 56907407 markings, 136963881 edges, 722682 markings/sec, 85 secs
lola: sara is running 90 secs || 59649896 markings, 143426516 edges, 548498 markings/sec, 90 secs
lola: sara is running 95 secs || 62648555 markings, 151549288 edges, 599732 markings/sec, 95 secs
lola: sara is running 100 secs || 65421880 markings, 158575191 edges, 554665 markings/sec, 100 secs
lola: sara is running 105 secs || 68448725 markings, 165890977 edges, 605369 markings/sec, 105 secs
lola: sara is running 110 secs || 71562719 markings, 173450772 edges, 622799 markings/sec, 110 secs
lola: sara is running 115 secs || 74645993 markings, 180938921 edges, 616655 markings/sec, 115 secs
lola: sara is running 120 secs || 77704056 markings, 188331259 edges, 611613 markings/sec, 120 secs
lola: sara is running 125 secs || 80731169 markings, 195681030 edges, 605423 markings/sec, 125 secs
lola: sara is running 130 secs || 83753440 markings, 203022867 edges, 604454 markings/sec, 130 secs
lola: sara is running 135 secs || 86703489 markings, 210152819 edges, 590010 markings/sec, 135 secs
lola: sara is running 140 secs || 89523609 markings, 217008130 edges, 564024 markings/sec, 140 secs
lola: sara is running 145 secs || 92411917 markings, 223990819 edges, 577662 markings/sec, 145 secs
lola: sara is running 150 secs || 95231530 markings, 230844020 edges, 563923 markings/sec, 150 secs
lola: sara is running 155 secs || 98123283 markings, 237834511 edges, 578351 markings/sec, 155 secs
lola: sara is running 160 secs || 101179098 markings, 245256329 edges, 611163 markings/sec, 160 secs
lola: sara is running 165 secs || 104202180 markings, 252600454 edges, 604616 markings/sec, 165 secs
lola: sara is running 170 secs || 107243824 markings, 259952805 edges, 608329 markings/sec, 170 secs
lola: sara is running 175 secs || 110198940 markings, 267131079 edges, 591023 markings/sec, 175 secs
lola: sara is running 180 secs || 112997720 markings, 273871611 edges, 559756 markings/sec, 180 secs
lola: sara is running 185 secs || 116017294 markings, 281233397 edges, 603915 markings/sec, 185 secs
lola: sara is running 190 secs || 118967990 markings, 288403865 edges, 590139 markings/sec, 190 secs
lola: sara is running 195 secs || 121943417 markings, 295595941 edges, 595085 markings/sec, 195 secs
lola: sara is running 200 secs || 124861445 markings, 302686707 edges, 583606 markings/sec, 200 secs
lola: sara is running 205 secs || 127813071 markings, 309795297 edges, 590325 markings/sec, 205 secs
lola: sara is running 210 secs || 130828417 markings, 317146829 edges, 603069 markings/sec, 210 secs
lola: sara is running 215 secs || 133920937 markings, 324658424 edges, 618504 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
----- Kill lola and sara stderr -----
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="mcc4mcc-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 mcc4mcc-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 r095-blw7-152650007300327"
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 ;