About the Execution of LoLA for ERK-PT-001000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15948.120 | 112198.00 | 111058.00 | 81.40 | FT?TFTFFFFTFFFFF | 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 ERK-PT-001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264200365
=====================================================================
--------------------
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 ERK-PT-001000-LTLCardinality-0
FORMULA_NAME ERK-PT-001000-LTLCardinality-1
FORMULA_NAME ERK-PT-001000-LTLCardinality-10
FORMULA_NAME ERK-PT-001000-LTLCardinality-11
FORMULA_NAME ERK-PT-001000-LTLCardinality-12
FORMULA_NAME ERK-PT-001000-LTLCardinality-13
FORMULA_NAME ERK-PT-001000-LTLCardinality-14
FORMULA_NAME ERK-PT-001000-LTLCardinality-15
FORMULA_NAME ERK-PT-001000-LTLCardinality-2
FORMULA_NAME ERK-PT-001000-LTLCardinality-3
FORMULA_NAME ERK-PT-001000-LTLCardinality-4
FORMULA_NAME ERK-PT-001000-LTLCardinality-5
FORMULA_NAME ERK-PT-001000-LTLCardinality-6
FORMULA_NAME ERK-PT-001000-LTLCardinality-7
FORMULA_NAME ERK-PT-001000-LTLCardinality-8
FORMULA_NAME ERK-PT-001000-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494698631312
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ ERK-PT-001000 @ 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: 22/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from ERK-PT-001000-LTLCardinality.task
lola: A ((G (X ((3 <= RP))) U F ((ERK <= MEKPP_ERK)))) : A (X ((RKIPP <= ERK))) : A ((F (G ((ERK <= RKIPP_RP))) U G (F ((3 <= Raf1Star_RKIP_ERKPP))))) : A ((2 <= ERKPP)) : A (F ((X ((2 <= RKIPP)) U X ((RKIPP <= ERK))))) : A (X (G (((RKIPP_RP <= MEKPP_ERK) U (ERKPP <= Raf1Star_RKIP))))) : A (((1 <= Raf1Star_RKIP) U X (G ((3 <= RKIPP))))) : A (X (F ((RP <= MEKPP)))) : A ((X (X ((3 <= MEKPP_ERK))) U F ((1 <= Raf1Star_RKIP)))) : A ((G (G ((Raf1Star_RKIP <= RKIPP_RP))) U X (G ((3 <= RKIPP_RP))))) : A ((((3 <= MEKPP) U (3 <= RKIPP_RP)) U G ((1 <= MEKPP)))) : A ((F ((Raf1Star <= MEKPP)) U (3 <= RP))) : A (G ((3 <= RKIPP_RP))) : A (X ((2 <= RKIP))) : A (X ((G ((2 <= RKIPP_RP)) U (RP <= RKIPP)))) : A (F (F (F (X ((2 <= RKIPP_RP))))))
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 ((3 <= RP))) U F ((ERK <= MEKPP_ERK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((3 <= RP))) U F ((ERK <= MEKPP_ERK))))
lola: processed formula: A ((G (X ((3 <= RP))) U F ((ERK <= MEKPP_ERK))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 31 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 (X ((RKIPP <= ERK)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((RKIPP <= ERK)))
lola: processed formula: A (X ((RKIPP <= ERK)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((ERK <= RKIPP_RP))) U G (F ((3 <= Raf1Star_RKIP_ERKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((ERK <= RKIPP_RP))) U G (F ((3 <= Raf1Star_RKIP_ERKPP)))))
lola: processed formula: A ((F (G ((ERK <= RKIPP_RP))) U G (F ((3 <= Raf1Star_RKIP_ERKPP)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= ERKPP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= ERKPP)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((2 <= RKIPP)) U X ((RKIPP <= ERK)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((2 <= RKIPP) U (RKIPP <= ERK)))))
lola: processed formula: A (F (X (((2 <= RKIPP) U (RKIPP <= ERK)))))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((RKIPP_RP <= MEKPP_ERK) U (ERKPP <= Raf1Star_RKIP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((RKIPP_RP <= MEKPP_ERK) U (ERKPP <= Raf1Star_RKIP)))))
lola: processed formula: A (X (G (((RKIPP_RP <= MEKPP_ERK) U (ERKPP <= Raf1Star_RKIP)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= Raf1Star_RKIP) U X (G ((3 <= RKIPP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= Raf1Star_RKIP) U X (G ((3 <= RKIPP)))))
lola: processed formula: A (((1 <= Raf1Star_RKIP) U X (G ((3 <= RKIPP)))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((RP <= MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((RP <= MEKPP))))
lola: processed formula: A (X (F ((RP <= MEKPP))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((3 <= MEKPP_ERK))) U F ((1 <= Raf1Star_RKIP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((3 <= MEKPP_ERK))) U F ((1 <= Raf1Star_RKIP))))
lola: processed formula: A ((X (X ((3 <= MEKPP_ERK))) U F ((1 <= Raf1Star_RKIP))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 31 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 ((G (G ((Raf1Star_RKIP <= RKIPP_RP))) U X (G ((3 <= RKIPP_RP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((Raf1Star_RKIP <= RKIPP_RP))) U X (G ((3 <= RKIPP_RP)))))
lola: processed formula: A ((G (G ((Raf1Star_RKIP <= RKIPP_RP))) U X (G ((3 <= RKIPP_RP)))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= MEKPP) U (3 <= RKIPP_RP)) U G ((1 <= MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= MEKPP) U (3 <= RKIPP_RP)) U G ((1 <= MEKPP))))
lola: processed formula: A ((((3 <= MEKPP) U (3 <= RKIPP_RP)) U G ((1 <= MEKPP))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 4716865 markings, 8117866 edges, 943373 markings/sec, 0 secs
lola: 9521110 markings, 16273833 edges, 960849 markings/sec, 5 secs
lola: 15219991 markings, 26464661 edges, 1139776 markings/sec, 10 secs
lola: 20751264 markings, 36826274 edges, 1106255 markings/sec, 15 secs
lola: 25768974 markings, 47726728 edges, 1003542 markings/sec, 20 secs
lola: 30196891 markings, 57643599 edges, 885583 markings/sec, 25 secs
lola: 34487684 markings, 65694871 edges, 858159 markings/sec, 30 secs
lola: 39334070 markings, 74788920 edges, 969277 markings/sec, 35 secs
lola: 44035702 markings, 83610863 edges, 940326 markings/sec, 40 secs
lola: 48741467 markings, 92436742 edges, 941153 markings/sec, 45 secs
lola: 53398632 markings, 101176618 edges, 931433 markings/sec, 50 secs
lola: 57944748 markings, 111184141 edges, 909223 markings/sec, 55 secs
lola: 62383623 markings, 121028374 edges, 887775 markings/sec, 60 secs
lola: 66930708 markings, 129608891 edges, 909417 markings/sec, 65 secs
lola: 71550072 markings, 138275967 edges, 923873 markings/sec, 70 secs
lola: 76075952 markings, 146765485 edges, 905176 markings/sec, 75 secs
lola: 80666615 markings, 155374892 edges, 918133 markings/sec, 80 secs
lola: 85086980 markings, 163667379 edges, 884073 markings/sec, 85 secs
lola: 89209284 markings, 171839286 edges, 824461 markings/sec, 90 secs
lola: 93584856 markings, 181542514 edges, 875114 markings/sec, 95 secs
lola: 97774954 markings, 190479193 edges, 838020 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 685 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((Raf1Star <= MEKPP)) U (3 <= RP)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((Raf1Star <= MEKPP)) U (3 <= RP)))
lola: processed formula: A ((F ((Raf1Star <= MEKPP)) U (3 <= RP)))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: subprocess 12 will run for 857 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= RKIPP_RP)))
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: lola: ========================================using 24 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 13 will run for 1142 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= RKIP)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= RKIP)))
lola: processed formula: A (X ((2 <= RKIP)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 14 will run for 1714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((2 <= RKIPP_RP)) U (RP <= RKIPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((2 <= RKIPP_RP)) U (RP <= RKIPP))))
lola: processed formula: A (X ((G ((2 <= RKIPP_RP)) U (RP <= RKIPP))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 15 will run for 3428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (X ((2 <= RKIPP_RP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= RKIPP_RP))))
lola: processed formula: A (F (X ((2 <= RKIPP_RP))))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: RESULT
lola:
SUMMARY: no yes no no yes no no no no no unknown yes no yes no no
FORMULA ERK-PT-001000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-001000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494698743510
--------------------
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="ERK-PT-001000"
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/ERK-PT-001000.tgz
mv ERK-PT-001000 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 ERK-PT-001000, 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 r028-blw3-149440264200365"
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 ;