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_PermAdmissibility-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650200428
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496389357035


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PermAdmissibility-PT-10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_PermAdmissibility-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_PermAdmissibility-PT-10 @ 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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-10-LTLCardinality.task
lola: A (((c8 <= c18) U (aux6_0 + aux6_1 + aux6_4 + aux6_5 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))) : A (F (G (G (X ((3 <= c18)))))) : A (F ((X ((1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) U G ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= in3_4 + in3_5))))) : A (F ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7))) : A (X (F (X ((c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5))))) : A (F (F ((3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))) : A (G (F (((2 <= in1_0 + in1_1) U (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7))))) : A (X ((1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5))) : A (G (F ((3 <= c13)))) : A ((c19 <= c18)) : A ((c20 <= c8)) : A (F (F (G (X ((3 <= c5)))))) : A (X (((c12 <= c8) U G ((2 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))) : A ((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)) : A (G (F ((c12 <= c8)))) : A (F ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
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 (((c8 <= c18) U (aux6_0 + aux6_1 + aux6_4 + aux6_5 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((c8 <= c18) U (aux6_0 + aux6_1 + aux6_4 + aux6_5 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula: A (((c8 <= c18) U (aux6_0 + aux6_1 + aux6_4 + aux6_5 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (X ((3 <= c18))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (X ((3 <= c18))))))
lola: processed formula: A (F (G (G (X ((3 <= c18))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) U G ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= in3_4 + in3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) U G ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= in3_4 + in3_5)))))
lola: processed formula: A (F ((X ((1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) U G ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= in3_4 + in3_5)))))
lola: processed formula length: 193
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))
lola: processed formula: A (F ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))
lola: processed formula length: 168
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 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 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: processed formula: A (X (F (X ((c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 (F (F ((3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula: A (F ((3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((2 <= in1_0 + in1_1) U (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((2 <= in1_0 + in1_1) U (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7)))))
lola: processed formula: A (G (F (((2 <= in1_0 + in1_1) U (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7)))))
lola: processed formula length: 125
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))
lola: processed formula: A (X ((1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 (G (F ((3 <= c13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= c13))))
lola: processed formula: A (G (F ((3 <= c13))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((c19 <= c18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c19 <= c18)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((c20 <= c8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c20 <= c8)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((3 <= c5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((3 <= c5)))))
lola: processed formula: A (F (G (X ((3 <= c5)))))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((c12 <= c8) U G ((2 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((c12 <= c8) U G ((2 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))
lola: processed formula: A (X (((c12 <= c8) U G ((2 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))
lola: processed formula length: 104
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((c12 <= c8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((c12 <= c8))))
lola: processed formula: A (G (F ((c12 <= c8))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 910344 markings, 1832089 edges, 182069 markings/sec, 0 secs
lola: 1696925 markings, 3452080 edges, 157316 markings/sec, 5 secs
lola: 2501274 markings, 5236056 edges, 160870 markings/sec, 10 secs
lola: 3331735 markings, 7064435 edges, 166092 markings/sec, 15 secs
lola: 4201341 markings, 8905672 edges, 173921 markings/sec, 20 secs
lola: 5054186 markings, 10574525 edges, 170569 markings/sec, 25 secs
lola: 5838045 markings, 12229698 edges, 156772 markings/sec, 30 secs
lola: 6661989 markings, 14043902 edges, 164789 markings/sec, 35 secs
lola: 7408891 markings, 15660776 edges, 149380 markings/sec, 40 secs
lola: 8201117 markings, 17353429 edges, 158445 markings/sec, 45 secs
lola: 9043483 markings, 19175857 edges, 168473 markings/sec, 50 secs
lola: 9949407 markings, 21103680 edges, 181185 markings/sec, 55 secs
lola: 10772443 markings, 22918023 edges, 164607 markings/sec, 60 secs
lola: 11648506 markings, 24769002 edges, 175213 markings/sec, 65 secs
lola: 12495142 markings, 26508626 edges, 169327 markings/sec, 70 secs
lola: 13241306 markings, 28149521 edges, 149233 markings/sec, 75 secs
lola: 13940142 markings, 29732095 edges, 139767 markings/sec, 80 secs
lola: 14654205 markings, 31454320 edges, 142813 markings/sec, 85 secs
lola: 15310294 markings, 32970620 edges, 131218 markings/sec, 90 secs
lola: 15966676 markings, 34499055 edges, 131276 markings/sec, 95 secs
lola: 16701805 markings, 36252281 edges, 147026 markings/sec, 100 secs
lola: 17548531 markings, 38181005 edges, 169345 markings/sec, 105 secs
lola: 18302525 markings, 39968312 edges, 150799 markings/sec, 110 secs
lola: 19127931 markings, 41905280 edges, 165081 markings/sec, 115 secs
lola: 19907659 markings, 43557366 edges, 155946 markings/sec, 120 secs
lola: 20699660 markings, 45312506 edges, 158400 markings/sec, 125 secs
lola: 21574463 markings, 46982650 edges, 174961 markings/sec, 130 secs
lola: 22392983 markings, 48691811 edges, 163704 markings/sec, 135 secs
lola: 23147057 markings, 50353635 edges, 150815 markings/sec, 140 secs
lola: 23921588 markings, 52108932 edges, 154906 markings/sec, 145 secs
lola: 24789401 markings, 53883317 edges, 173563 markings/sec, 150 secs
lola: 25560599 markings, 55702472 edges, 154240 markings/sec, 155 secs
lola: 26319846 markings, 57473080 edges, 151849 markings/sec, 160 secs
lola: 27074315 markings, 59342271 edges, 150894 markings/sec, 165 secs
lola: 27888758 markings, 61046602 edges, 162889 markings/sec, 170 secs
lola: 28656858 markings, 62768852 edges, 153620 markings/sec, 175 secs
lola: 29363699 markings, 64329204 edges, 141368 markings/sec, 180 secs
lola: 30109387 markings, 66134485 edges, 149138 markings/sec, 185 secs
lola: 30914640 markings, 68122749 edges, 161051 markings/sec, 190 secs
lola: 31707117 markings, 69710648 edges, 158495 markings/sec, 195 secs
lola: 32461040 markings, 71490146 edges, 150785 markings/sec, 200 secs
lola: 33200187 markings, 73186535 edges, 147829 markings/sec, 205 secs
lola: 33946293 markings, 74978868 edges, 149221 markings/sec, 210 secs
lola: 34793133 markings, 76788914 edges, 169368 markings/sec, 215 secs
lola: 35550224 markings, 78420931 edges, 151418 markings/sec, 220 secs
lola: 36260922 markings, 80023671 edges, 142140 markings/sec, 225 secs
lola: 36943140 markings, 81750943 edges, 136444 markings/sec, 230 secs
lola: 37674249 markings, 83429100 edges, 146222 markings/sec, 235 secs
lola: 38306537 markings, 85096164 edges, 126458 markings/sec, 240 secs
lola: 38958094 markings, 86821513 edges, 130311 markings/sec, 245 secs
lola: 39599536 markings, 88479171 edges, 128288 markings/sec, 250 secs
lola: 40329481 markings, 90140043 edges, 145989 markings/sec, 255 secs
lola: 40979288 markings, 91745963 edges, 129961 markings/sec, 260 secs
lola: 41659537 markings, 93497667 edges, 136050 markings/sec, 265 secs
lola: 42390749 markings, 95188906 edges, 146242 markings/sec, 270 secs
lola: 43059891 markings, 96949562 edges, 133828 markings/sec, 275 secs
lola: 43718172 markings, 98755610 edges, 131656 markings/sec, 280 secs
lola: 44316775 markings, 100462047 edges, 119721 markings/sec, 285 secs
lola: 44985058 markings, 102232394 edges, 133657 markings/sec, 290 secs
lola: 45642747 markings, 103735109 edges, 131538 markings/sec, 295 secs
lola: 46287260 markings, 105315925 edges, 128903 markings/sec, 300 secs
lola: 46896191 markings, 106975225 edges, 121786 markings/sec, 305 secs
lola: 47536119 markings, 108839957 edges, 127986 markings/sec, 310 secs
lola: 48202055 markings, 110467611 edges, 133187 markings/sec, 315 secs
lola: 48827621 markings, 112128579 edges, 125113 markings/sec, 320 secs
lola: 49509274 markings, 113863956 edges, 136331 markings/sec, 325 secs
lola: 50107975 markings, 115737468 edges, 119740 markings/sec, 330 secs
lola: 50829337 markings, 117684410 edges, 144272 markings/sec, 335 secs
lola: 51585181 markings, 119539742 edges, 151169 markings/sec, 340 secs
lola: 52290648 markings, 121307576 edges, 141093 markings/sec, 345 secs
lola: 52976970 markings, 123087797 edges, 137264 markings/sec, 350 secs
lola: 53749978 markings, 124690372 edges, 154602 markings/sec, 355 secs
lola: 54500233 markings, 126295043 edges, 150051 markings/sec, 360 secs
lola: 55144385 markings, 127850585 edges, 128830 markings/sec, 365 secs
lola: 55827491 markings, 129490379 edges, 136621 markings/sec, 370 secs
lola: 56515263 markings, 131183767 edges, 137554 markings/sec, 375 secs
lola: 57116248 markings, 132853743 edges, 120197 markings/sec, 380 secs
lola: 57786188 markings, 134586431 edges, 133988 markings/sec, 385 secs
lola: 58443742 markings, 136183004 edges, 131511 markings/sec, 390 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3141 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: processed formula: A (F ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: processed formula length: 116
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 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: yes no no yes yes no no no no yes yes no no no unknown yes
lola: ========================================
FORMULA PermAdmissibility-COL-10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496389756548

--------------------
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_PermAdmissibility-PT-10"
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_PermAdmissibility-PT-10.tgz
mv S_PermAdmissibility-PT-10 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_PermAdmissibility-PT-10, 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 r118-blw7-149441650200428"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;