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

About the Execution of Irma.struct for Kanban-PT-0500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15898.920 193912.00 199897.00 355.90 ???????????????? 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 184K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.8K 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 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 14K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Kanban-PT-0500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666473500045
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527151155094


BK_STOP 1527151349006

--------------------
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 Kanban-PT-0500 as instance name.
Using Kanban as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, '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': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 1183281, 'Memory': 15950.77, 'Tool': 'lola'}, {'Time': 1194467, 'Memory': 15952.75, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola Kanban-PT-0500...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Kanban-PT-0500: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ Kanban-PT-0500 @ 3540 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 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: 32/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from Kanban-PT-0500-CTLCardinality.task
lola: ((((P3 <= Pm3) OR (Pm4 <= 1) OR (((3 <= Pm4) OR (1 <= Pm2)) AND (Pm1 <= 2))) OR E (G (((P3 <= Pm4) AND (1 <= Pout2))))) AND ((((2 <= Pm1) OR (P3 + 1 <= Pback1)) OR A (G ((2 <= P1)))) AND E (X ((Pout1 <= 1))))) : (((Pback1 + 1 <= Pback2) AND (Pm1 <= 0)) OR (E (F ((P1 + 1 <= Pout2))) AND A (F ((Pout4 <= P2))))) : A (G (((Pm1 <= Pm3) OR E (F ((1 <= P1)))))) : A (G ((2 <= P4))) : E (F (NOT(E (F ((Pback3 <= Pout3)))))) : NOT(E (F ((P1 <= Pback2)))) : E (F (((Pback1 + 1 <= Pm1) AND ((P4 <= 2) OR ((1 <= Pback1) AND (2 <= Pm2)))))) : E (F (FALSE)) : ((NOT(E (F ((P2 <= Pback4)))) AND ((Pm4 <= Pout3) AND (1 <= P4))) AND E (X (((3 <= P3) OR (1 <= P3) OR ((2 <= Pout4) AND (Pm4 <= Pout1)))))) : E (F (NOT(A (F ((1 <= P3)))))) : (((A (G ((3 <= P3))) AND A (F ((3 <= P3)))) OR ((P1 + 1 <= Pm2) AND (Pout3 <= Pback4) AND ((Pm3 <= Pback2) OR (1 <= Pm3) OR (Pm2 <= 2)))) AND (((Pback3 <= 1) OR (P2 <= Pm4)) OR A (G ((P3 + 1 <= Pm2))))) : A (G (((Pout1 <= 1)))) : (A (G (A (X ((Pback2 <= P4))))) OR NOT((E (G ((Pback2 <= Pout3))) OR (Pback3 <= P3)))) : A (G (())) : A (G ((E (X ((3 <= Pback4))) OR E (G ((3 <= P3)))))) : A (G (A (X ((Pback1 <= P3)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((P3 <= Pm3) OR (Pm4 <= 1) OR (((3 <= Pm4) OR (1 <= Pm2)) AND (Pm1 <= 2))) OR E (G (((P3 <= Pm4) AND (1 <= Pout2))))) AND ((((2 <= Pm1) OR (P3 + 1 <= Pback1)) OR A (G ((2 <= P1)))) AND E (X ((Pout1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P3 <= Pm3) OR (Pm4 <= 1) OR (((3 <= Pm4) OR (1 <= Pm2)) AND (Pm1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P3 <= Pm3) OR (Pm4 <= 1) OR (((3 <= Pm4) OR (1 <= Pm2)) AND (Pm1 <= 2)))
lola: processed formula length: 77
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= Pm1) OR (P3 + 1 <= Pback1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= Pm1) OR (P3 + 1 <= Pback1))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= P1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2995 markings, 2994 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Pback1 + 1 <= Pback2) AND (Pm1 <= 0)) OR (E (F ((P1 + 1 <= Pout2))) AND A (F ((Pout4 <= P2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Pback1 + 1 <= Pback2) AND (Pm1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pback1 + 1 <= Pback2) AND (Pm1 <= 0))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((P1 + 1 <= Pout2)))
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 44 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0500-CTLCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2007 markings, 2006 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Pout4 <= P2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((Pout4 <= P2)))
lola: processed formula: A (F ((Pout4 <= P2)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Pm1 <= Pm3) OR E (F ((1 <= P1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((Pm3 + 1 <= Pm1) AND NOT(E(TRUE U (1 <= P1))))))
lola: processed formula length: 62
lola: 4 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2994686 markings, 9530076 edges, 598937 markings/sec, 0 secs
lola: 5854600 markings, 18535682 edges, 571983 markings/sec, 5 secs
lola: 8738435 markings, 27565089 edges, 576767 markings/sec, 10 secs
lola: 11533242 markings, 36311158 edges, 558961 markings/sec, 15 secs
lola: 14512387 markings, 45594710 edges, 595829 markings/sec, 20 secs
lola: 17584056 markings, 55213632 edges, 614334 markings/sec, 25 secs
lola: 20530872 markings, 64450616 edges, 589363 markings/sec, 30 secs
lola: 23825932 markings, 74742771 edges, 659012 markings/sec, 35 secs
lola: 26880127 markings, 84315378 edges, 610839 markings/sec, 40 secs
lola: 29982716 markings, 94038547 edges, 620518 markings/sec, 45 secs
lola: 33108372 markings, 103761705 edges, 625131 markings/sec, 50 secs
lola: 36152315 markings, 113243518 edges, 608789 markings/sec, 55 secs
lola: 39164876 markings, 122640848 edges, 602512 markings/sec, 60 secs
lola: 42235134 markings, 132208843 edges, 614052 markings/sec, 65 secs
lola: 45476024 markings, 142299431 edges, 648178 markings/sec, 70 secs
lola: 48493573 markings, 151744583 edges, 603510 markings/sec, 75 secs
lola: 51677340 markings, 161652536 edges, 636753 markings/sec, 80 secs
lola: 54722764 markings, 171173259 edges, 609085 markings/sec, 85 secs
lola: 57761419 markings, 180436315 edges, 607731 markings/sec, 90 secs
lola: 60470052 markings, 188321556 edges, 541727 markings/sec, 95 secs
lola: 63103289 markings, 196047704 edges, 526647 markings/sec, 100 secs
lola: 65740769 markings, 203750968 edges, 527496 markings/sec, 105 secs
lola: 68299337 markings, 211240047 edges, 511714 markings/sec, 110 secs
lola: 70954549 markings, 219076750 edges, 531042 markings/sec, 115 secs
lola: 73807857 markings, 227422807 edges, 570662 markings/sec, 120 secs
lola: 76635113 markings, 235725143 edges, 565451 markings/sec, 125 secs
lola: 79338099 markings, 243728158 edges, 540597 markings/sec, 130 secs
lola: 81894848 markings, 251266743 edges, 511350 markings/sec, 135 secs
lola: 84383720 markings, 258644695 edges, 497774 markings/sec, 140 secs
lola: 86874549 markings, 266007457 edges, 498166 markings/sec, 145 secs
lola: 89361391 markings, 273344830 edges, 497368 markings/sec, 150 secs
lola: 91849994 markings, 280716552 edges, 497721 markings/sec, 155 secs
lola: 94399899 markings, 288263060 edges, 509981 markings/sec, 160 secs
lola: 96875253 markings, 295583294 edges, 495071 markings/sec, 165 secs
lola: 99527960 markings, 303394480 edges, 530541 markings/sec, 170 secs
lola: 102287128 markings, 311662997 edges, 551834 markings/sec, 175 secs
lola: 104886927 markings, 319472420 edges, 519960 markings/sec, 180 secs
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 Kanban-PT-0500-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0500-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="Kanban-PT-0500"
export BK_EXAMINATION="CTLCardinality"
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/Kanban-PT-0500.tgz
mv Kanban-PT-0500 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 Kanban-PT-0500, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-csrt-152666473500045"
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 ;