About the Execution of LoLA for S_TCPcondis-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1045.000 | 123550.00 | 123953.00 | 82.80 | FTFFFFTTFTFFFFFF | 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-3253
Executing tool lola
Input is S_TCPcondis-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464100204
=====================================================================
--------------------
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 TCPcondis-PT-05-LTLFireability-0
FORMULA_NAME TCPcondis-PT-05-LTLFireability-1
FORMULA_NAME TCPcondis-PT-05-LTLFireability-10
FORMULA_NAME TCPcondis-PT-05-LTLFireability-11
FORMULA_NAME TCPcondis-PT-05-LTLFireability-12
FORMULA_NAME TCPcondis-PT-05-LTLFireability-13
FORMULA_NAME TCPcondis-PT-05-LTLFireability-14
FORMULA_NAME TCPcondis-PT-05-LTLFireability-15
FORMULA_NAME TCPcondis-PT-05-LTLFireability-2
FORMULA_NAME TCPcondis-PT-05-LTLFireability-3
FORMULA_NAME TCPcondis-PT-05-LTLFireability-4
FORMULA_NAME TCPcondis-PT-05-LTLFireability-5
FORMULA_NAME TCPcondis-PT-05-LTLFireability-6
FORMULA_NAME TCPcondis-PT-05-LTLFireability-7
FORMULA_NAME TCPcondis-PT-05-LTLFireability-8
FORMULA_NAME TCPcondis-PT-05-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1496564991587
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_TCPcondis-PT-05: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_TCPcondis-PT-05: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLFireability @ S_TCPcondis-PT-05 @ 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: 62/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 32 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48 transition conflict sets
lola: TASK
lola: reading formula from TCPcondis-PT-05-LTLFireability.task
lola: A (X (G (G (F (G (FIREABLE(xCLOSE2))))))) : A (G (G ((F (FIREABLE(ras)) U F (FIREABLE(xAOPEN)))))) : A (G (((FIREABLE(end) U FIREABLE(rf1)) U G (FIREABLE(CLOSE2))))) : A (X (X (FIREABLE(xAOPEN)))) : A (G (FIREABLE(xAOPEN))) : A (X (X (FIREABLE(raf2)))) : A (FIREABLE(xCLOSE3)) : A (FIREABLE(rf2)) : A (FIREABLE(end)) : A (G ((X (G (FIREABLE(POPEN))) U F (FIREABLE(xraf))))) : A ((F (FIREABLE(end)) U (FIREABLE(rsa) U FIREABLE(raf)))) : A (FIREABLE(xCLOSE2)) : A (F (X (X (FIREABLE(xraf2))))) : A ((FIREABLE(rs1) U G (X (FIREABLE(xCLOSE3))))) : A (F (((FIREABLE(rs) U FIREABLE(raf)) U X (F (FIREABLE(POPEN)))))) : A (G ((FIREABLE(AOPEN) U G (F (FIREABLE(xCLOSE2))))))
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 (X (G (G (F (G (FIREABLE(xCLOSE2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G (FIREABLE(xCLOSE2)))))
lola: processed formula: A (X (F (G (FIREABLE(xCLOSE2)))))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 (G ((F (FIREABLE(ras)) U F (FIREABLE(xAOPEN))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G ((F (FIREABLE(ras)) U F (FIREABLE(xAOPEN))))))
lola: processed formula: A (G (G ((F (FIREABLE(ras)) U F (FIREABLE(xAOPEN))))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 892281 markings, 2680690 edges, 178456 markings/sec, 0 secs
lola: 1552868 markings, 5196530 edges, 132117 markings/sec, 5 secs
lola: 2130581 markings, 7631301 edges, 115543 markings/sec, 10 secs
lola: 2391640 markings, 10170256 edges, 52212 markings/sec, 15 secs
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 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(end) U FIREABLE(rf1)) U G (FIREABLE(CLOSE2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((FIREABLE(end) U FIREABLE(rf1)) U G (FIREABLE(CLOSE2)))))
lola: processed formula: A (G (((FIREABLE(end) U FIREABLE(rf1)) U G (FIREABLE(CLOSE2)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 28 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 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(xAOPEN))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (FIREABLE(xAOPEN))))
lola: processed formula: A (X (X (FIREABLE(xAOPEN))))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(xAOPEN)))
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 84 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 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(raf2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (FIREABLE(raf2))))
lola: processed formula: A (X (X (FIREABLE(raf2))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(xCLOSE3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(xCLOSE3)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: processed formula with 0 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 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(rf2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(rf2)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: processed formula with 0 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 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(end))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(end)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: processed formula with 0 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 9 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X (G (FIREABLE(POPEN))) U F (FIREABLE(xraf)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (G (FIREABLE(POPEN))) U F (FIREABLE(xraf)))))
lola: processed formula: A (G ((X (G (FIREABLE(POPEN))) U F (FIREABLE(xraf)))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 10 will run for 586 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(end)) U (FIREABLE(rsa) U FIREABLE(raf))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(end)) U (FIREABLE(rsa) U FIREABLE(raf))))
lola: processed formula: A ((F (FIREABLE(end)) U (FIREABLE(rsa) U FIREABLE(raf))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 11 will run for 703 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(xCLOSE2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(xCLOSE2)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: processed formula with 0 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 12 will run for 879 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (FIREABLE(xraf2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (FIREABLE(xraf2)))))
lola: processed formula: A (F (X (X (FIREABLE(xraf2)))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 13 will run for 1172 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(rs1) U G (X (FIREABLE(xCLOSE3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(rs1) U G (X (FIREABLE(xCLOSE3)))))
lola: processed formula: A ((FIREABLE(rs1) U G (X (FIREABLE(xCLOSE3)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 14 will run for 1759 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(rs) U FIREABLE(raf)) U X (F (FIREABLE(POPEN))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((FIREABLE(rs) U FIREABLE(raf)) U X (F (FIREABLE(POPEN))))))
lola: processed formula: A (F (((FIREABLE(rs) U FIREABLE(raf)) U X (F (FIREABLE(POPEN))))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 15 will run for 3518 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(AOPEN) U G (F (FIREABLE(xCLOSE2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((FIREABLE(AOPEN) U G (F (FIREABLE(xCLOSE2))))))
lola: processed formula: A (G ((FIREABLE(AOPEN) U G (F (FIREABLE(xCLOSE2))))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-05-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 891345 markings, 2985339 edges, 178269 markings/sec, 0 secs
lola: 1486248 markings, 5336222 edges, 118981 markings/sec, 5 secs
lola: 2011193 markings, 7663993 edges, 104989 markings/sec, 10 secs
lola: 2278548 markings, 9926647 edges, 53471 markings/sec, 15 secs
lola: 2480830 markings, 12265449 edges, 40456 markings/sec, 20 secs
lola: 3009165 markings, 15056744 edges, 105667 markings/sec, 25 secs
lola: 3464694 markings, 17679452 edges, 91106 markings/sec, 30 secs
lola: 3838302 markings, 20044234 edges, 74722 markings/sec, 35 secs
lola: 4176960 markings, 22412391 edges, 67732 markings/sec, 40 secs
lola: 4490103 markings, 24961270 edges, 62629 markings/sec, 45 secs
lola: 4661808 markings, 27493619 edges, 34341 markings/sec, 50 secs
lola: 4786882 markings, 29894437 edges, 25015 markings/sec, 55 secs
lola: 4962259 markings, 32553732 edges, 35075 markings/sec, 60 secs
lola: 5250746 markings, 35029170 edges, 57697 markings/sec, 65 secs
lola: 5505907 markings, 37489678 edges, 51032 markings/sec, 70 secs
lola: 5753265 markings, 40082597 edges, 49472 markings/sec, 75 secs
lola: 5982421 markings, 42991867 edges, 45831 markings/sec, 80 secs
lola: 6101284 markings, 45681544 edges, 23773 markings/sec, 85 secs
lola: 6201368 markings, 48306480 edges, 20017 markings/sec, 90 secs
lola: 6291185 markings, 51016470 edges, 17963 markings/sec, 95 secs
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: RESULT
lola:
SUMMARY: no yes no yes no no no no no no no no no no yes yes
lola: ========================================
FORMULA TCPcondis-PT-05-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-05-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496565115137
--------------------
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_TCPcondis-PT-05"
export BK_EXAMINATION="LTLFireability"
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_TCPcondis-PT-05.tgz
mv S_TCPcondis-PT-05 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_TCPcondis-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-ebro-149443464100204"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 ;