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)
..............
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is TokenRing-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r134kn-smll-146384395400124
=====================================================================

--------------------
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 TokenRing-COL-020-ReachabilityCardinality-0
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-1
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-10
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-11
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-12
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-13
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-14
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-15
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-2
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-3
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-4
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-5
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-6
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-7
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-8
FORMULA_NAME TokenRing-COL-020-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1463855816349

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ TokenRing-PT-020
FORMULA TokenRing-COL-020-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-020-ReachabilityCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 8862/65536 symbol table entries, 437 collisions
lola: preprocessing...
lola: finding significant places
lola: 441 places, 8421 transitions, 420 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 8862 transition conflict sets
lola: TASK
lola: reading formula from TokenRing-COL-020-ReachabilityCardinality.task
lola: read: AG (!(!((2 <= State_9_0 + State_5_8 + State_6_14 + State_7_9 + State_4_2 + State_11_16 + State_0_11 + State_14_9 + State_1_19 + State_8_13 + State_7_8 + State_18_13 + State_14_8 + State_0_10 + State_16_14 + State_4_15 + State_16_17 + State_14_10 + State_7_17 + State_8_20 + State_10_6 + State_19_0 + State_18_19 + State_2_6 + State_6_5 + State_7_1 + State_8_4 + State_0_9 + State_16_1 + State_1_3 + S... (shortened)
lola: formula length: 334115
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to TokenRing-COL-020-ReachabilityCardinality.sara
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: calling and running sara
lola: ...considering subproblem: AG (-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14 ... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
sara: try reading problem file TokenRing-COL-020-ReachabilityCardinality.sara.
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14 ... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file TokenRing-COL-020-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file TokenRing-COL-020-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14 ... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file TokenRing-COL-020-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 865 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file TokenRing-COL-020-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file TokenRing-COL-020-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-State_6_20 + -State_12_9 + -State_11_20 + -State_9_20 + -State_16_9 + -State_10_20 + -State_17_9 + -State_0_9 + -State_18_9 + -State_15_20 + -State_8_20 + -State_7_9 + -State_2_20 + -State_3_9 + -State_14_20 + -State_4_9 + -State_5_9 + -State_19_20 + -State_1_20 + -State_20_9 + -State_13_20 + -State_7_0 + -State_13_19 + -State_13_18 + -State_13_17 + -State_13_16 + -State_13_15 + -State_13_14 ... (shortened)
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 1680 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: yes yes no yes yes yes no no yes no yes yes no yes no yes

BK_STOP 1463855897026

--------------------
content from 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="TokenRing-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/TokenRing-PT-020.tgz
mv TokenRing-PT-020 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is TokenRing-PT-020, 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 r134kn-smll-146384395400124"
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 ;