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_CircularTrains-PT-384, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074700626
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496356710595


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


checking for too many tokens
===========================================================================================
S_CircularTrains-PT-384: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_CircularTrains-PT-384 @ 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: 1152/65536 symbol table entries, 116 collisions
lola: preprocessing...
lola: finding significant places
lola: 768 places, 384 transitions, 383 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 768 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-384-LTLCardinality.task
lola: A (F ((Section_196 <= Section_250))) : A (F ((Section_275 <= Section_335))) : A ((X (X ((3 <= F83))) U X (X ((3 <= F52))))) : A (F ((G ((Section_75 <= F320)) U X ((2 <= Section_125))))) : A ((X (G ((1 <= Section_154))) U ((2 <= Section_245) U (F294 <= Section_223)))) : A ((1 <= Section_105)) : A ((3 <= F273)) : A (X (G (F (G ((F341 <= Section_303)))))) : A ((((Section_227 <= Section_25) U (Section_193 <= Section_52)) U (2 <= F12))) : A (X (F ((F46 <= F66)))) : A (G (G (F (F ((Section_363 <= F207)))))) : A (G ((X ((Section_314 <= Section_62)) U G ((Section_66 <= Section_210))))) : A (X ((X ((Section_126 <= F157)) U (1 <= Section_215)))) : A ((F352 <= Section_146)) : A ((2 <= Section_107)) : A (F ((Section_329 <= Section_259)))
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 (F ((Section_196 <= Section_250)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((Section_196 <= Section_250)))
lola: processed formula: A (F ((Section_196 <= Section_250)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Section_275 <= Section_335)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((Section_275 <= Section_335)))
lola: processed formula: A (F ((Section_275 <= Section_335)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((3 <= F83))) U X (X ((3 <= F52)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((3 <= F83) U (3 <= F52)))))
lola: processed formula: A (X (X (((3 <= F83) U (3 <= F52)))))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((Section_75 <= F320)) U X ((2 <= Section_125)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((Section_75 <= F320)) U X ((2 <= Section_125)))))
lola: processed formula: A (F ((G ((Section_75 <= F320)) U X ((2 <= Section_125)))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= Section_154))) U ((2 <= Section_245) U (F294 <= Section_223))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((1 <= Section_154))) U ((2 <= Section_245) U (F294 <= Section_223))))
lola: processed formula: A ((X (G ((1 <= Section_154))) U ((2 <= Section_245) U (F294 <= Section_223))))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= Section_105))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Section_105)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= F273))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= F273)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (G ((F341 <= Section_303))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((F341 <= Section_303)))))
lola: processed formula: A (X (F (G ((F341 <= Section_303)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 526047 markings, 846191 edges, 105209 markings/sec, 0 secs
lola: 1009906 markings, 1661168 edges, 96772 markings/sec, 5 secs
lola: 1482395 markings, 2465714 edges, 94498 markings/sec, 10 secs
lola: 1944720 markings, 3263729 edges, 92465 markings/sec, 15 secs
lola: 2399706 markings, 4054424 edges, 90997 markings/sec, 20 secs
lola: 2852931 markings, 4836163 edges, 90645 markings/sec, 25 secs
lola: 3304245 markings, 5612289 edges, 90263 markings/sec, 30 secs
lola: 3744805 markings, 6382827 edges, 88112 markings/sec, 35 secs
lola: 4181156 markings, 7149567 edges, 87270 markings/sec, 40 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 8 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((Section_227 <= Section_25) U (Section_193 <= Section_52)) U (2 <= F12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Section_227 <= Section_25) U (Section_193 <= Section_52)) U (2 <= F12)))
lola: processed formula: A ((((Section_227 <= Section_25) U (Section_193 <= Section_52)) U (2 <= F12)))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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 499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((F46 <= F66))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((F46 <= F66))))
lola: processed formula: A (X (F ((F46 <= F66))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: 799773 markings, 1304835 edges, 159955 markings/sec, 0 secs
lola: 1456863 markings, 2391184 edges, 131418 markings/sec, 5 secs
lola: 2090655 markings, 3560191 edges, 126758 markings/sec, 10 secs
lola: 2693964 markings, 4760251 edges, 120662 markings/sec, 15 secs
lola: 3224250 markings, 5812505 edges, 106057 markings/sec, 20 secs
lola: 3846611 markings, 7038186 edges, 124472 markings/sec, 25 secs
lola: 4437261 markings, 8212729 edges, 118130 markings/sec, 30 secs
lola: 4953628 markings, 9235433 edges, 103273 markings/sec, 35 secs
lola: 5662657 markings, 10635645 edges, 141806 markings/sec, 40 secs
lola: 6282047 markings, 11866207 edges, 123878 markings/sec, 45 secs
lola: 6842998 markings, 12968323 edges, 112190 markings/sec, 50 secs
lola: 7465781 markings, 14207006 edges, 124557 markings/sec, 55 secs
lola: 8009276 markings, 15285298 edges, 108699 markings/sec, 60 secs
lola: 8663994 markings, 16575888 edges, 130944 markings/sec, 65 secs
lola: 9283407 markings, 17807009 edges, 123883 markings/sec, 70 secs
lola: 9864619 markings, 18949189 edges, 116242 markings/sec, 75 secs
lola: 10549047 markings, 20310446 edges, 136886 markings/sec, 80 secs
lola: 11057908 markings, 21319458 edges, 101772 markings/sec, 85 secs
lola: 11723606 markings, 22632299 edges, 133140 markings/sec, 90 secs
lola: 12329168 markings, 23835389 edges, 121112 markings/sec, 95 secs
lola: 12952069 markings, 25061369 edges, 124580 markings/sec, 100 secs
lola: 13595442 markings, 26340469 edges, 128675 markings/sec, 105 secs
lola: 14155650 markings, 27440815 edges, 112042 markings/sec, 110 secs
lola: 14829123 markings, 28780399 edges, 134695 markings/sec, 115 secs
lola: 15393598 markings, 29898670 edges, 112895 markings/sec, 120 secs
lola: 16086704 markings, 31267564 edges, 138621 markings/sec, 125 secs
lola: 16668690 markings, 32422727 edges, 116397 markings/sec, 130 secs
lola: 17317674 markings, 33702122 edges, 129797 markings/sec, 135 secs
lola: 17918806 markings, 34896103 edges, 120226 markings/sec, 140 secs
lola: 18528090 markings, 36095527 edges, 121857 markings/sec, 145 secs
lola: 19101490 markings, 37235218 edges, 114680 markings/sec, 150 secs
lola: 19659013 markings, 38331037 edges, 111505 markings/sec, 155 secs
lola: 20250351 markings, 39506644 edges, 118268 markings/sec, 160 secs
lola: 20749777 markings, 40488756 edges, 99885 markings/sec, 165 secs
lola: 21441702 markings, 41862701 edges, 138385 markings/sec, 170 secs
lola: 21992930 markings, 42954828 edges, 110246 markings/sec, 175 secs
lola: 22674069 markings, 44300279 edges, 136228 markings/sec, 180 secs
lola: 23220635 markings, 45383081 edges, 109313 markings/sec, 185 secs
lola: 23890872 markings, 46706834 edges, 134047 markings/sec, 190 secs
lola: 24421920 markings, 47757953 edges, 106210 markings/sec, 195 secs
lola: 25093216 markings, 49084752 edges, 134259 markings/sec, 200 secs
lola: 25638215 markings, 50156463 edges, 109000 markings/sec, 205 secs
lola: 26271976 markings, 51415919 edges, 126752 markings/sec, 210 secs
lola: 26812295 markings, 52477561 edges, 108064 markings/sec, 215 secs
lola: 27452289 markings, 53750044 edges, 127999 markings/sec, 220 secs
lola: 28012978 markings, 54852797 edges, 112138 markings/sec, 225 secs
lola: 28635521 markings, 56090147 edges, 124509 markings/sec, 230 secs
lola: 29208854 markings, 57218384 edges, 114667 markings/sec, 235 secs
lola: 29816953 markings, 58426372 edges, 121620 markings/sec, 240 secs
lola: 30423905 markings, 59622043 edges, 121390 markings/sec, 245 secs
lola: 30975268 markings, 60716306 edges, 110273 markings/sec, 250 secs
lola: 31593151 markings, 61934628 edges, 123577 markings/sec, 255 secs
lola: 32152925 markings, 63036897 edges, 111955 markings/sec, 260 secs
lola: 32794589 markings, 64310945 edges, 128333 markings/sec, 265 secs
lola: 33354765 markings, 65413476 edges, 112035 markings/sec, 270 secs
lola: 33953579 markings, 66602310 edges, 119763 markings/sec, 275 secs
lola: 34565516 markings, 67808789 edges, 122387 markings/sec, 280 secs
lola: 35092921 markings, 68845694 edges, 105481 markings/sec, 285 secs
lola: 35698048 markings, 70048178 edges, 121025 markings/sec, 290 secs
lola: 36256345 markings, 71147539 edges, 111659 markings/sec, 295 secs
lola: 36802198 markings, 72230466 edges, 109171 markings/sec, 300 secs
lola: 37397142 markings, 73403869 edges, 118989 markings/sec, 305 secs
lola: 37887716 markings, 74368363 edges, 98115 markings/sec, 310 secs
lola: 38446003 markings, 75477078 edges, 111657 markings/sec, 315 secs
lola: 38987779 markings, 76544099 edges, 108355 markings/sec, 320 secs
lola: 39476816 markings, 77512642 edges, 97807 markings/sec, 325 secs
lola: 40057066 markings, 78658274 edges, 116050 markings/sec, 330 secs
lola: 40633517 markings, 79794118 edges, 115290 markings/sec, 335 secs
lola: 41183916 markings, 80877744 edges, 110080 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (F ((Section_363 <= F207))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (F ((Section_363 <= F207)))))
lola: processed formula: A (G (G (F ((Section_363 <= F207)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((Section_314 <= Section_62)) U G ((Section_66 <= Section_210)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((Section_314 <= Section_62)) U G ((Section_66 <= Section_210)))))
lola: processed formula: A (G ((X ((Section_314 <= Section_62)) U G ((Section_66 <= Section_210)))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 28 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 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((Section_126 <= F157)) U (1 <= Section_215))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((Section_126 <= F157)) U (1 <= Section_215))))
lola: processed formula: A (X ((X ((Section_126 <= F157)) U (1 <= Section_215))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F352 <= Section_146))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (F352 <= Section_146)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-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 1572 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= Section_107))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Section_107)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-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 15 will run for 3145 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Section_329 <= Section_259)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((Section_329 <= Section_259)))
lola: processed formula: A (F ((Section_329 <= Section_259)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: RESULT
lola:
SUMMARY: yes yes no no yes yes no no no unknown yes no no no no yes
FORMULA CircularTrains-PT-384-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496357105190

--------------------
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_CircularTrains-PT-384"
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_CircularTrains-PT-384.tgz
mv S_CircularTrains-PT-384 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_CircularTrains-PT-384, 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 r088-csrt-149441074700626"
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 ;