About the Execution of LoLA for S_Echo-PT-d02r11
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15952.450 | 70784.00 | 70282.00 | 219.50 | FTTFFFFF?FTFFFFF | 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 S_Echo-PT-d02r11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612200248
=====================================================================
--------------------
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 Echo-PT-d02r11-LTLCardinality-0
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-1
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-10
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-11
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-12
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-13
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-14
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-15
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-2
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-3
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-4
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-5
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-6
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-7
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-8
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496362512299
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_Echo-PT-d02r11: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_Echo-PT-d02r11: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_Echo-PT-d02r11 @ 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: 1993/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1119 places, 874 transitions, 558 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1736 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r11-LTLCardinality.task
lola: A ((1 <= p504)) : A ((p791 <= p962)) : A (F ((F ((3 <= p215)) U (1 <= p551)))) : A (F (F (G (X ((3 <= p420)))))) : A (F (F (X ((p147 <= p1028))))) : A (X (G ((1 <= p712)))) : A ((1 <= p586)) : A (X (F (((p1118 <= p36) U (3 <= p208))))) : A (X (F (((3 <= p288) U (3 <= p350))))) : A (G (((1 <= p255) U (1 <= p955)))) : A (X (F (((1 <= p1018) U (p728 <= p263))))) : A (X (X (F ((1 <= p809))))) : A (F ((2 <= p560))) : A ((1 <= p828)) : A ((F (F ((p636 <= p400))) U (3 <= p257))) : A ((F (F ((2 <= p570))) U G (X ((1 <= p123)))))
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 ((1 <= p504))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p504)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p791 <= p962))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p791 <= p962)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= p215)) U (1 <= p551))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((3 <= p215)) U (1 <= p551))))
lola: processed formula: A (F ((F ((3 <= p215)) U (1 <= p551))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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: 850296 markings, 1512709 edges, 170059 markings/sec, 0 secs
lola: 1631537 markings, 2946317 edges, 156248 markings/sec, 5 secs
lola: 2398187 markings, 4351716 edges, 153330 markings/sec, 10 secs
lola: 3144804 markings, 5685441 edges, 149323 markings/sec, 15 secs
lola: 3820552 markings, 6914380 edges, 135150 markings/sec, 20 secs
lola: 4528612 markings, 8234016 edges, 141612 markings/sec, 25 secs
lola: 5225642 markings, 9486373 edges, 139406 markings/sec, 30 secs
lola: 5939389 markings, 10803823 edges, 142749 markings/sec, 35 secs
lola: 6620001 markings, 12105968 edges, 136122 markings/sec, 40 secs
lola: 7333262 markings, 13406860 edges, 142652 markings/sec, 45 secs
lola: 8042173 markings, 14717331 edges, 141782 markings/sec, 50 secs
lola: 8767830 markings, 16034702 edges, 145131 markings/sec, 55 secs
lola: 9486464 markings, 17310492 edges, 143727 markings/sec, 60 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((3 <= p420))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((3 <= p420)))))
lola: processed formula: A (F (G (X ((3 <= p420)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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: subprocess 4 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((p147 <= p1028)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((p147 <= p1028))))
lola: ========================================
lola: processed formula: A (F (X ((p147 <= p1028))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((1 <= p712))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((1 <= p712))))
lola: processed formula: A (X (G ((1 <= p712))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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 6 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p586))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p586)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-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 7 will run for 385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p1118 <= p36) U (3 <= p208)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((p1118 <= p36) U (3 <= p208)))))
lola: processed formula: A (X (F (((p1118 <= p36) U (3 <= p208)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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 8 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((3 <= p288) U (3 <= p350)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((3 <= p288) U (3 <= p350)))))
lola: processed formula: A (X (F (((3 <= p288) U (3 <= p350)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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 9 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p255) U (1 <= p955))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((1 <= p255) U (1 <= p955))))
lola: processed formula: A (G (((1 <= p255) U (1 <= p955))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((1 <= p1018) U (p728 <= p263)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((1 <= p1018) U (p728 <= p263)))))
lola: processed formula: A (X (F (((1 <= p1018) U (p728 <= p263)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((1 <= p809)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= p809)))))
lola: processed formula: A (X (X (F ((1 <= p809)))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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 12 will run for 867 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p560)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((2 <= p560)))
lola: processed formula: A (F ((2 <= p560)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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: 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 1156 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p828))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p828)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-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 14 will run for 1735 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((p636 <= p400))) U (3 <= p257)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p636 <= p400)) U (3 <= p257)))
lola: processed formula: A ((F ((p636 <= p400)) U (3 <= p257)))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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 15 will run for 3470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= p570))) U G (X ((1 <= p123)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= p570)) U G (X ((1 <= p123)))))
lola: processed formula: A ((F ((2 <= p570)) U G (X ((1 <= p123)))))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 1119 places; total mentions: 0
lola: closed formula file Echo-PT-d02r11-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2236 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 unknown no yes no no no no no yes no no no no no
FORMULA Echo-PT-d02r11-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496362583083
--------------------
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="S_Echo-PT-d02r11"
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/S_Echo-PT-d02r11.tgz
mv S_Echo-PT-d02r11 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 S_Echo-PT-d02r11, 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 r108-blw3-149441612200248"
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 ;