fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r119-csrt-152666479800321
Last Updated
June 26, 2018

About the Execution of M4M.struct for NeoElection-PT-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2097.770 44766.00 93332.00 171.80 T 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 13M
-rw-r--r-- 1 mcc users 164K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 400K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 321K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 880K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 129K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 300K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 296K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 667K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 451K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 106K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 202K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 7.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is NeoElection-PT-6, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r119-csrt-152666479800321
=====================================================================


--------------------
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 NeoElection-PT-6-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1527323157687


BK_STOP 1527323202453

--------------------
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 NeoElection-PT-6 as instance name.
Using NeoElection as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityDeadlock', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 557, 'Memory': 112.63, 'Tool': 'lola'}, {'Time': 770, 'Memory': 110.86, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityDeadlock lola NeoElection-PT-6...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
NeoElection-PT-6: translating PT formula ReachabilityDeadlock into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityDeadlock @ NeoElection-PT-6 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 13265/65536 symbol table entries, 1397 collisions
lola: preprocessing...
lola: finding significant places
lola: 4830 places, 8435 transitions, 1197 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2401 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-6-ReachabilityDeadlock.task
lola: E (F (DEADLOCK))
lola: E (F (DEADLOCK))
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: siphon||findpath||search) (--findpath=par,--siphontrap=par)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 19 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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH (findpath)
lola: findpath: using deadlock preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: findpath: starting randomized, memory-less exploration (--search=findpath)
lola: findpath: searching for paths with maximal depth 1000000 (--depthlimit)
lola: findpath: no retry limit given (--retrylimit)
lola: findpath: transitions are chosen randomly
lola: computing symmetries (--symmetry)
lola: time limit for symmetry computation of 300 seconds given (--symmtimelimit)
lola: RESULT
lola: result: yes
lola: produced by: findpath
lola: The net has deadlock(s).
lola: STP: formula with 162787 variables and 779391 clauses shipped to Minisat
lola: stp: The siphon/trap property does not hold
lola: 62 generators;10240089 candidates remain ( 0%), 0 secs
lola: 100 generators; 9242861 candidates remain ( 0%), 5 secs
lola: 132 generators; 8118440 candidates remain ( 0%), 10 secs
lola: 6753 generators; 6585979 candidates remain ( 0%), 15 secs
lola: 34486 generators; 6555294 candidates remain ( 0%), 20 secs
lola: 62734 generators; 6524422 candidates remain ( 0%), 25 secs
lola: 88978 generators; 6495226 candidates remain ( 1%), 30 secs
lola: 115158 generators; 6466422 candidates remain ( 1%), 35 secs
FORMULA NeoElection-PT-6-ReachabilityDeadlock-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="NeoElection-PT-6"
export BK_EXAMINATION="ReachabilityDeadlock"
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/NeoElection-PT-6.tgz
mv NeoElection-PT-6 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 NeoElection-PT-6, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r119-csrt-152666479800321"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.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 ;