About the Execution of LoLA for S_HypertorusGrid-PT-d4k3p2b08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
577.540 | 432556.00 | 433191.00 | 42.60 | TFFFFFFTTTFFTFFT | 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_HypertorusGrid-PT-d4k3p2b08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649800050
=====================================================================
--------------------
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 HypertorusGrid-PT-d4k3p2b08-LTLCardinality-0
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-1
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-10
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-11
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-12
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-13
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-14
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-15
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-2
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-3
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-4
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-5
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-6
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-7
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-8
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496350566159
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_HypertorusGrid-PT-d4k3p2b08: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_HypertorusGrid-PT-d4k3p2b08: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_HypertorusGrid-PT-d4k3p2b08 @ 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: 7209/65536 symbol table entries, 1791 collisions
lola: preprocessing...
lola: finding significant places
lola: 2025 places, 5184 transitions, 1295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5913 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: A ((po_d4_n1_3_2_1_1 <= pb_d1_n1_2_1_1_1)) : A (F ((pb_d3_n2_1_3_3_2 <= pil_d3_n1_3_3_1_2))) : A ((G (X ((3 <= pb_d1_n1_2_2_2_1))) U (pi_d4_n1_3_1_1_2 <= pi_d4_n1_3_3_1_3))) : A ((F (F ((pi_d3_n1_3_3_2_3 <= pil_d2_n1_3_3_1_1))) U X ((1 <= pb_d1_n1_3_1_2_2)))) : A (X ((G ((pb_d4_n1_3_1_1_1 <= pb_d3_n2_3_1_2_3)) U F ((1 <= pil_d4_n1_3_2_1_1))))) : A ((pb_d2_n1_3_1_2_2 <= po_d3_n1_2_1_1_3)) : A ((1 <= pb_d4_n1_2_2_3_3)) : A ((pb_d1_n2_1_2_1_1 <= po_d4_n1_1_1_2_3)) : A (X (G ((po_d4_n1_1_3_2_3 <= po_d3_n1_1_3_1_1)))) : A (F ((pb_d3_n1_1_1_1_3 <= pb_d4_n2_2_1_3_1))) : A (X (G (((1 <= pi_d4_n1_2_2_3_2) U (pb_d2_n1_2_3_2_3 <= po_d3_n1_2_2_2_1))))) : A ((((2 <= pbl_1_1_3_3) U (po_d2_n1_3_3_1_3 <= pil_d4_n1_2_1_3_3)) U G (F ((1 <= pb_d4_n1_2_1_3_2))))) : A (X (F (F (G ((1 <= pb_d4_n2_1_3_1_3)))))) : A (G (((2 <= pi_d4_n1_2_1_1_3) U (pb_d3_n1_2_3_1_3 <= pol_d4_n1_1_2_1_3)))) : A ((X (X ((3 <= pb_d3_n2_2_2_1_1))) U (3 <= pb_d3_n1_1_2_2_3))) : A ((pol_d3_n1_1_3_2_2 <= pb_d1_n1_2_3_1_2))
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 ((po_d4_n1_3_2_1_1 <= pb_d1_n1_2_1_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (po_d4_n1_3_2_1_1 <= pb_d1_n1_2_1_1_1)
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d3_n2_1_3_3_2 <= pil_d3_n1_3_3_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((pb_d3_n2_1_3_3_2 <= pil_d3_n1_3_3_1_2)))
lola: processed formula: A (F ((pb_d3_n2_1_3_3_2 <= pil_d3_n1_3_3_1_2)))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 1157 markings, 1156 edges, 231 markings/sec, 0 secs
lola: 1187 markings, 1186 edges, 6 markings/sec, 5 secs
lola: 1239 markings, 1238 edges, 10 markings/sec, 10 secs
lola: 1345 markings, 1344 edges, 21 markings/sec, 15 secs
lola: 1458 markings, 1457 edges, 23 markings/sec, 20 secs
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 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((3 <= pb_d1_n1_2_2_2_1))) U (pi_d4_n1_3_1_1_2 <= pi_d4_n1_3_3_1_3)))
lola: lola: ========================================
lola: ========================================
SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((3 <= pb_d1_n1_2_2_2_1))) U (pi_d4_n1_3_1_1_2 <= pi_d4_n1_3_3_1_3)))
lola: processed formula: A ((G (X ((3 <= pb_d1_n1_2_2_2_1))) U (pi_d4_n1_3_1_1_2 <= pi_d4_n1_3_3_1_3)))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((pi_d3_n1_3_3_2_3 <= pil_d2_n1_3_3_1_1))) U X ((1 <= pb_d1_n1_3_1_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((pi_d3_n1_3_3_2_3 <= pil_d2_n1_3_3_1_1)) U X ((1 <= pb_d1_n1_3_1_2_2))))
lola: processed formula: A ((F ((pi_d3_n1_3_3_2_3 <= pil_d2_n1_3_3_1_1)) U X ((1 <= pb_d1_n1_3_1_2_2))))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((pb_d4_n1_3_1_1_1 <= pb_d3_n2_3_1_2_3)) U F ((1 <= pil_d4_n1_3_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((pb_d4_n1_3_1_1_1 <= pb_d3_n2_3_1_2_3)) U F ((1 <= pil_d4_n1_3_2_1_1)))))
lola: processed formula: A (X ((G ((pb_d4_n1_3_1_1_1 <= pb_d3_n2_3_1_2_3)) U F ((1 <= pil_d4_n1_3_2_1_1)))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb_d2_n1_3_1_2_2 <= po_d3_n1_2_1_1_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb_d2_n1_3_1_2_2 <= po_d3_n1_2_1_1_3)
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= pb_d4_n1_2_2_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= pb_d4_n1_2_2_3_3)
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb_d1_n2_1_2_1_1 <= po_d4_n1_1_1_2_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb_d1_n2_1_2_1_1 <= po_d4_n1_1_1_2_3)
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((po_d4_n1_1_3_2_3 <= po_d3_n1_1_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((po_d4_n1_1_3_2_3 <= po_d3_n1_1_3_1_1))))
lola: processed formula: A (X (G ((po_d4_n1_1_3_2_3 <= po_d3_n1_1_3_1_1))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d3_n1_1_1_1_3 <= pb_d4_n2_2_1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((pb_d3_n1_1_1_1_3 <= pb_d4_n2_2_1_3_1)))
lola: processed formula: A (F ((pb_d3_n1_1_1_1_3 <= pb_d4_n2_2_1_3_1)))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 10 will run for 585 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((1 <= pi_d4_n1_2_2_3_2) U (pb_d2_n1_2_3_2_3 <= po_d3_n1_2_2_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((1 <= pi_d4_n1_2_2_3_2) U (pb_d2_n1_2_3_2_3 <= po_d3_n1_2_2_2_1)))))
lola: processed formula: A (X (G (((1 <= pi_d4_n1_2_2_3_2) U (pb_d2_n1_2_3_2_3 <= po_d3_n1_2_2_2_1)))))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 11 will run for 702 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= pbl_1_1_3_3) U (po_d2_n1_3_3_1_3 <= pil_d4_n1_2_1_3_3)) U G (F ((1 <= pb_d4_n1_2_1_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= pbl_1_1_3_3) U (po_d2_n1_3_3_1_3 <= pil_d4_n1_2_1_3_3)) U G (F ((1 <= pb_d4_n1_2_1_3_2)))))
lola: processed formula: A ((((2 <= pbl_1_1_3_3) U (po_d2_n1_3_3_1_3 <= pil_d4_n1_2_1_3_3)) U G (F ((1 <= pb_d4_n1_2_1_3_2)))))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 1308 markings, 1307 edges, 262 markings/sec, 0 secs
lola: 2997 markings, 3434 edges, 338 markings/sec, 5 secs
lola: 3446 markings, 4012 edges, 90 markings/sec, 10 secs
lola: 3843 markings, 4518 edges, 79 markings/sec, 15 secs
lola: 4119 markings, 4874 edges, 55 markings/sec, 20 secs
lola: 4342 markings, 5159 edges, 45 markings/sec, 25 secs
lola: 4537 markings, 5410 edges, 39 markings/sec, 30 secs
lola: 4898 markings, 5869 edges, 72 markings/sec, 35 secs
lola: 5342 markings, 6434 edges, 89 markings/sec, 40 secs
lola: 5861 markings, 7103 edges, 104 markings/sec, 45 secs
lola: 6498 markings, 7914 edges, 127 markings/sec, 50 secs
lola: 7267 markings, 8898 edges, 154 markings/sec, 55 secs
lola: 7999 markings, 9834 edges, 146 markings/sec, 60 secs
lola: 8718 markings, 10743 edges, 144 markings/sec, 65 secs
lola: 9528 markings, 11779 edges, 162 markings/sec, 70 secs
lola: 10307 markings, 12775 edges, 156 markings/sec, 75 secs
lola: 10843 markings, 13464 edges, 107 markings/sec, 80 secs
lola: 11293 markings, 14034 edges, 90 markings/sec, 85 secs
lola: 12064 markings, 15025 edges, 154 markings/sec, 90 secs
lola: 13006 markings, 16230 edges, 188 markings/sec, 95 secs
lola: 13900 markings, 17368 edges, 179 markings/sec, 100 secs
lola: 15054 markings, 18848 edges, 231 markings/sec, 105 secs
lola: 15599 markings, 19550 edges, 109 markings/sec, 110 secs
lola: 16317 markings, 20474 edges, 144 markings/sec, 115 secs
lola: 17065 markings, 21432 edges, 150 markings/sec, 120 secs
lola: 17851 markings, 22453 edges, 157 markings/sec, 125 secs
lola: 18577 markings, 23394 edges, 145 markings/sec, 130 secs
lola: 19341 markings, 24390 edges, 153 markings/sec, 135 secs
lola: 20191 markings, 25489 edges, 170 markings/sec, 140 secs
lola: 20711 markings, 26140 edges, 104 markings/sec, 145 secs
lola: 21222 markings, 26783 edges, 102 markings/sec, 150 secs
lola: 22029 markings, 27817 edges, 161 markings/sec, 155 secs
lola: 22745 markings, 28720 edges, 143 markings/sec, 160 secs
lola: 23431 markings, 29597 edges, 137 markings/sec, 165 secs
lola: 24171 markings, 30537 edges, 148 markings/sec, 170 secs
lola: 24897 markings, 31458 edges, 145 markings/sec, 175 secs
lola: 25481 markings, 32211 edges, 117 markings/sec, 180 secs
lola: 26141 markings, 33037 edges, 132 markings/sec, 185 secs
lola: 26836 markings, 33925 edges, 139 markings/sec, 190 secs
lola: 27518 markings, 34796 edges, 136 markings/sec, 195 secs
lola: 28246 markings, 35719 edges, 146 markings/sec, 200 secs
lola: 29025 markings, 36708 edges, 156 markings/sec, 205 secs
lola: 29847 markings, 37746 edges, 164 markings/sec, 210 secs
lola: 30718 markings, 38850 edges, 174 markings/sec, 215 secs
lola: 31610 markings, 39994 edges, 178 markings/sec, 220 secs
lola: 32505 markings, 41125 edges, 179 markings/sec, 225 secs
lola: 33427 markings, 42299 edges, 184 markings/sec, 230 secs
lola: 34376 markings, 43508 edges, 190 markings/sec, 235 secs
lola: 35313 markings, 44695 edges, 187 markings/sec, 240 secs
lola: 36244 markings, 45881 edges, 186 markings/sec, 245 secs
lola: 37170 markings, 47053 edges, 185 markings/sec, 250 secs
lola: 38092 markings, 48227 edges, 184 markings/sec, 255 secs
lola: 38963 markings, 49331 edges, 174 markings/sec, 260 secs
lola: 39799 markings, 50392 edges, 167 markings/sec, 265 secs
lola: 40634 markings, 51448 edges, 167 markings/sec, 270 secs
lola: 41500 markings, 52560 edges, 173 markings/sec, 275 secs
lola: 42308 markings, 53588 edges, 162 markings/sec, 280 secs
lola: 43130 markings, 54626 edges, 164 markings/sec, 285 secs
lola: 43966 markings, 55684 edges, 167 markings/sec, 290 secs
lola: 44803 markings, 56733 edges, 167 markings/sec, 295 secs
lola: 45674 markings, 57810 edges, 174 markings/sec, 300 secs
lola: 46660 markings, 59074 edges, 197 markings/sec, 305 secs
lola: 47642 markings, 60311 edges, 196 markings/sec, 310 secs
lola: 48645 markings, 61575 edges, 201 markings/sec, 315 secs
lola: 49625 markings, 62803 edges, 196 markings/sec, 320 secs
lola: 50652 markings, 64112 edges, 205 markings/sec, 325 secs
lola: 51644 markings, 65367 edges, 198 markings/sec, 330 secs
lola: 52599 markings, 66574 edges, 191 markings/sec, 335 secs
lola: 53463 markings, 67662 edges, 173 markings/sec, 340 secs
lola: 54479 markings, 68897 edges, 203 markings/sec, 345 secs
lola: 55917 markings, 70649 edges, 288 markings/sec, 350 secs
lola: 58688 markings, 74023 edges, 554 markings/sec, 355 secs
lola: 61808 markings, 77823 edges, 624 markings/sec, 360 secs
lola: 65201 markings, 81955 edges, 679 markings/sec, 365 secs
lola: 68291 markings, 85331 edges, 618 markings/sec, 370 secs
lola: 70862 markings, 87902 edges, 514 markings/sec, 375 secs
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 782 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G ((1 <= pb_d4_n2_1_3_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((1 <= pb_d4_n2_1_3_1_3)))))
lola: processed formula: A (X (F (G ((1 <= pb_d4_n2_1_3_1_3)))))
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 1043 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= pi_d4_n1_2_1_1_3) U (pb_d3_n1_2_3_1_3 <= pol_d4_n1_1_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((2 <= pi_d4_n1_2_1_1_3) U (pb_d3_n1_2_3_1_3 <= pol_d4_n1_1_2_1_3))))
lola: processed formula: A (G (((2 <= pi_d4_n1_2_1_1_3) U (pb_d3_n1_2_3_1_3 <= pol_d4_n1_1_2_1_3))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 1235 markings, 1234 edges, 247 markings/sec, 0 secs
lola: 1294 markings, 1293 edges, 12 markings/sec, 5 secs
lola: 1366 markings, 1365 edges, 14 markings/sec, 10 secs
lola: 1430 markings, 1429 edges, 13 markings/sec, 15 secs
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 1554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((3 <= pb_d3_n2_2_2_1_1))) U (3 <= pb_d3_n1_1_2_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((3 <= pb_d3_n2_2_2_1_1))) U (3 <= pb_d3_n1_1_2_2_3)))
lola: processed formula: A ((X (X ((3 <= pb_d3_n2_2_2_1_1))) U (3 <= pb_d3_n1_1_2_2_3)))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 3108 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pol_d3_n1_1_3_2_2 <= pb_d1_n1_2_3_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol_d3_n1_1_3_2_2 <= pb_d1_n1_2_3_1_2)
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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: RESULT
lola:
SUMMARY: yes no yes yes no no yes no no yes no no no no no yes
lola: ========================================
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496350998715
--------------------
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_HypertorusGrid-PT-d4k3p2b08"
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_HypertorusGrid-PT-d4k3p2b08.tgz
mv S_HypertorusGrid-PT-d4k3p2b08 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_HypertorusGrid-PT-d4k3p2b08, 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-149441649800050"
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 ;