About the Execution of Irma.struct for QuasiCertifProtocol-PT-32
| Execution Summary | |||||
| Max Memory Used (MB)  | 
      Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status  | 
   
| 7934.480 | 237963.00 | 271046.00 | 1756.00 | ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? | 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 2.5M
-rw-r--r-- 1 mcc users  34K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users  13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users  59K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users  30K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users  27K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users  43K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users  116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users  354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users  38K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users  11K 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    3 May 15 18:50 instance
-rw-r--r-- 1 mcc users    6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.8M May 15 18:50 model.pnml
=====================================================================
 Generated by BenchKit 2-3637
    Executing tool irma4mcc-structural
    Input is QuasiCertifProtocol-PT-32, examination is UpperBounds
    Time confinement is 3600 seconds
    Memory confinement is 16384 MBytes
    Number of cores is 4
    Run identifier is r139-qhx2-152673581200100
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1527789271597
BK_STOP 1527789509560
--------------------
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 QuasiCertifProtocol-PT-32 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool random-forest.
Model characteristics are: {'Examination': 'UpperBounds', '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': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 2272170, 'Memory': 15952.04, 'Tool': 'lola'}, {'Time': 2921905, 'Memory': 15952.52, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'gspn'}].
UpperBounds lola QuasiCertifProtocol-PT-32...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
QuasiCertifProtocol-PT-32: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-32: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
UpperBounds @ QuasiCertifProtocol-PT-32 @ 3537 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3537 seconds at most (--timelimit)
lola: NET
lola:   reading net from model.pnml.lola
lola:   finished parsing
lola:   closed net file model.pnml.lola
lola:   4312/65536 symbol table entries, 134 collisions
lola:   preprocessing...
lola:   finding significant places
lola:   3806 places, 506 transitions, 505 significant places
lola:   computing forward-conflicting sets
lola:   computing back-conflicting sets
lola:   671 transition conflict sets
lola: TASK
lola:   reading formula from QuasiCertifProtocol-PT-32-UpperBounds.task
lola:   MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9) : MAX(n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_19 + n4_20 + n4_21 + n4_22 + n4_23 + n4_24 + n4_25 + n4_26 + n4_27 + n4_28 + n4_29 + n4_30 + n4_31 + n4_32 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9) : MAX(Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22 + Sstart_23 + Sstart_24 + Sstart_25 + Sstart_26 + Sstart_27 + Sstart_28 + Sstart_29 + Sstart_30 + Sstart_31 + Sstart_32) : MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9) : MAX(malicious_reservoir) : MAX(n7_27_21) : MAX(n5_18) : MAX(n9_11_13) : MAX(n8_25_2) : MAX(n9_7_0) : MAX(n7_17_0) : MAX(n7_20_30) : MAX(n9_10_21)
lola:   computing a collection of formulas
lola: RUNNING
lola:   subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola:   ========================================
lola:   ...considering subproblem: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola:   ========================================
lola:   SUBTASK
lola:     computing bound of an expression
lola:   STORE
lola:     using a bit-perfect encoder (--encoder=bit)
lola:     using 2020 bytes per marking, with 0 unused bits
lola:     using a prefix tree store (--store=prefix)
lola:   SEARCH
lola:   using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola:       260407 markings,     306189 edges,    52081 markings/sec,     0 secs
lola:       526104 markings,     626392 edges,    53139 markings/sec,     5 secs
lola:       793164 markings,     942885 edges,    53412 markings/sec,    10 secs
lola:      1059909 markings,    1273211 edges,    53349 markings/sec,    15 secs
lola:      1322778 markings,    1594044 edges,    52574 markings/sec,    20 secs
lola:      1586830 markings,    1925897 edges,    52810 markings/sec,    25 secs
lola:      1848854 markings,    2258506 edges,    52405 markings/sec,    30 secs
lola:      2109594 markings,    2590864 edges,    52148 markings/sec,    35 secs
lola:      2371616 markings,    2942591 edges,    52404 markings/sec,    40 secs
lola:      2633406 markings,    3276918 edges,    52358 markings/sec,    45 secs
lola:      2893611 markings,    3627516 edges,    52041 markings/sec,    50 secs
lola:      3157127 markings,    3987450 edges,    52703 markings/sec,    55 secs
lola:      3434125 markings,    4368258 edges,    55400 markings/sec,    60 secs
lola:      3707100 markings,    4755712 edges,    54595 markings/sec,    65 secs
lola:      3978100 markings,    5154371 edges,    54200 markings/sec,    70 secs
lola:      4248203 markings,    5540250 edges,    54021 markings/sec,    75 secs
lola:      4522741 markings,    5956455 edges,    54908 markings/sec,    80 secs
lola:      4798876 markings,    6379522 edges,    55227 markings/sec,    85 secs
lola:      5080114 markings,    6828992 edges,    56248 markings/sec,    90 secs
lola:      5358333 markings,    7288927 edges,    55644 markings/sec,    95 secs
lola:      5631902 markings,    7757990 edges,    54714 markings/sec,   100 secs
lola:      5907616 markings,    8245408 edges,    55143 markings/sec,   105 secs
lola:      6177857 markings,    8725878 edges,    54048 markings/sec,   110 secs
lola:      6452002 markings,    9292929 edges,    54829 markings/sec,   115 secs
lola:      6678557 markings,   10006616 edges,    45311 markings/sec,   120 secs
lola:      6917534 markings,   10694091 edges,    47795 markings/sec,   125 secs
lola:      7145344 markings,   11432019 edges,    45562 markings/sec,   130 secs
lola:      7367068 markings,   12157393 edges,    44345 markings/sec,   135 secs
lola:      7629095 markings,   12797274 edges,    52405 markings/sec,   140 secs
lola:      7852227 markings,   13539735 edges,    44626 markings/sec,   145 secs
lola:      8091263 markings,   14243836 edges,    47807 markings/sec,   150 secs
lola:      8313312 markings,   15004420 edges,    44410 markings/sec,   155 secs
lola:      8539529 markings,   15646173 edges,    45243 markings/sec,   160 secs
lola:      8805882 markings,   15967720 edges,    53271 markings/sec,   165 secs
lola:      9067502 markings,   16287459 edges,    52324 markings/sec,   170 secs
lola:      9329549 markings,   16613492 edges,    52409 markings/sec,   175 secs
lola:      9595439 markings,   16944556 edges,    53178 markings/sec,   180 secs
lola:      9859421 markings,   17288549 edges,    52796 markings/sec,   185 secs
lola:     10125256 markings,   17623955 edges,    53167 markings/sec,   190 secs
lola:     10379131 markings,   17959016 edges,    50775 markings/sec,   195 secs
lola:     10646840 markings,   18310914 edges,    53542 markings/sec,   200 secs
lola:     10925808 markings,   18683806 edges,    55794 markings/sec,   205 secs
lola:     11198184 markings,   19062554 edges,    54475 markings/sec,   210 secs
lola:     11474071 markings,   19443249 edges,    55177 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: ''
Aborted (core dumped)
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-0 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-1 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-2 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-4 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-5 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-6 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-7 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-8 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-9 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-10 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-11 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-12 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-13 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-14 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-15 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----
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="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="UpperBounds"
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/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 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 QuasiCertifProtocol-PT-32, examination is UpperBounds"
echo "    Time confinement is $BK_TIME_CONFINEMENT seconds"
echo "    Memory confinement is 16384 MBytes"
echo "    Number of cores is 4"
echo "    Run identifier is r139-qhx2-152673581200100"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
	echo "The expected result is a vector of positive values"
	echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
	echo "here is the order used to build the result vector(from text file)"
	for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
		echo "FORMULA_NAME $x"
	done
elif [ -f "UpperBounds.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 '
		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 ;
