About the Execution of LoLA for CircularTrains-PT-012
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
110.440 | 146.00 | 30.00 | 0.00 | FTFFFFTFFFFTFFFF | 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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is CircularTrains-PT-012, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500617
=====================================================================
--------------------
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 CircularTrains-PT-012-LTLCardinality-0
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-1
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-15
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-2
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-3
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-4
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-5
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-6
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-7
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-8
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494622228491
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ CircularTrains-PT-012 @ 3540 seconds
----- 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: 36/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 24 places, 12 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-012-LTLCardinality.task
lola: A (G ((X ((1 <= F12)) U F ((3 <= F6))))) : A ((G ((Section_12 <= F10)) U (F3 <= F4))) : A ((G (X ((1 <= Section_5))) U X (X ((3 <= F8))))) : A (G (X ((F11 <= Section_11)))) : A ((F (F ((F12 <= F11))) U X (G ((3 <= Section_5))))) : A ((G (F ((1 <= F11))) U (Section_4 <= F6))) : A ((F (G ((F6 <= Section_7))) U G (F ((3 <= F8))))) : A ((3 <= F8)) : A (F (X (X (G ((F2 <= F11)))))) : A ((3 <= F7)) : A ((3 <= Section_4)) : A (G ((3 <= Section_11))) : A (((Section_3 <= Section_7) U ((1 <= F7) U (2 <= Section_2)))) : A ((X (F ((F5 <= Section_2))) U X ((1 <= Section_4)))) : A (((2 <= F12) U ((F7 <= Section_12) U (Section_8 <= Section_4)))) : A (X (X (((Section_9 <= F4) U (F5 <= F11)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((1 <= F12)) U F ((3 <= F6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((1 <= F12)) U F ((3 <= F6)))))
lola: processed formula: A (G ((X ((1 <= F12)) U F ((3 <= F6)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((Section_12 <= F10)) U (F3 <= F4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((Section_12 <= F10)) U (F3 <= F4)))
lola: processed formula: A ((G ((Section_12 <= F10)) U (F3 <= F4)))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 30 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((1 <= Section_5))) U X (X ((3 <= F8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((1 <= Section_5))) U X (X ((3 <= F8)))))
lola: processed formula: A ((G (X ((1 <= Section_5))) U X (X ((3 <= F8)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((F11 <= Section_11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((F11 <= Section_11))))
lola: processed formula: A (G (X ((F11 <= Section_11))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((F12 <= F11))) U X (G ((3 <= Section_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((F12 <= F11)) U X (G ((3 <= Section_5)))))
lola: processed formula: A ((F ((F12 <= F11)) U X (G ((3 <= Section_5)))))
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((1 <= F11))) U (Section_4 <= F6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((1 <= F11))) U (Section_4 <= F6)))
lola: processed formula: A ((G (F ((1 <= F11))) U (Section_4 <= F6)))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 30 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: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((F6 <= Section_7))) U G (F ((3 <= F8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((F6 <= Section_7))) U G (F ((3 <= F8)))))
lola: processed formula: A ((F (G ((F6 <= Section_7))) U G (F ((3 <= F8)))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 29 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= F8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= F8)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (G ((F2 <= F11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (G ((F2 <= F11))))))
lola: processed formula: A (F (X (X (G ((F2 <= F11))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= F7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= F7)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= Section_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Section_4)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Section_11)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((Section_3 <= Section_7) U ((1 <= F7) U (2 <= Section_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Section_3 <= Section_7) U ((1 <= F7) U (2 <= Section_2))))
lola: processed formula: A (((Section_3 <= Section_7) U ((1 <= F7) U (2 <= Section_2))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 30 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((F5 <= Section_2))) U X ((1 <= Section_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((F5 <= Section_2)) U (1 <= Section_4))))
lola: processed formula: A (X ((F ((F5 <= Section_2)) U (1 <= Section_4))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= F12) U ((F7 <= Section_12) U (Section_8 <= Section_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= F12) U ((F7 <= Section_12) U (Section_8 <= Section_4))))
lola: processed formula: A (((2 <= F12) U ((F7 <= Section_12) U (Section_8 <= Section_4))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 30 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: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((Section_9 <= F4) U (F5 <= F11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((Section_9 <= F4) U (F5 <= F11)))))
lola: processed formula: A (X (X (((Section_9 <= F4) U (F5 <= F11)))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no yes no no no no no no no no yes no
FORMULA CircularTrains-PT-012-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494622228637
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="CircularTrains-PT-012"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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/CircularTrains-PT-012.tgz
mv CircularTrains-PT-012 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is CircularTrains-PT-012, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r008-csrt-149436126500617"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 ;