About the Execution of LoLA for S_DNAwalker-PT-13ringRLLarge
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8223.040 | 321425.00 | 321624.00 | 155.00 | FFTFTFFFTFT?FFFF | 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_DNAwalker-PT-13ringRLLarge, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612100113
=====================================================================
--------------------
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 DNAwalker-PT-13ringRLLarge-LTLCardinality-0
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-1
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-15
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-2
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-3
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-4
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-5
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-6
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-7
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-8
FORMULA_NAME DNAwalker-PT-13ringRLLarge-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496343676252
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DNAwalker-PT-13ringRLLarge: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_DNAwalker-PT-13ringRLLarge: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_DNAwalker-PT-13ringRLLarge @ 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: 345/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 312 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 197 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: A ((F ((2 <= B4)) U ((3 <= B16) U (2 <= A8)))) : A (X ((F ((1 <= A1)) U G ((2 <= A21))))) : A ((1 <= A6)) : A ((G (F ((A13 <= B17))) U F ((3 <= A12)))) : A ((F (X ((3 <= A4))) U (B15 <= A26))) : A (G ((X ((B15 <= A24)) U X ((B18 <= A19))))) : A (F (G (F (X ((A11 <= A16)))))) : A ((X (G ((1 <= A11))) U ((3 <= B15) U (2 <= A22)))) : A (X (G (G (F ((A10 <= A6)))))) : A (G (X ((A27 <= A2)))) : A (X (((2 <= A16) U F ((B15 <= A21))))) : A (G ((A19 <= B17))) : A ((X ((A16 <= A2)) U ((A9 <= A10) U (1 <= A6)))) : A (X (X (F (F ((2 <= A4)))))) : A ((3 <= A14)) : A (X (X ((1 <= A27))))
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 ((2 <= B4)) U ((3 <= B16) U (2 <= A8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= B4)) U ((3 <= B16) U (2 <= A8))))
lola: processed formula: A ((F ((2 <= B4)) U ((3 <= B16) U (2 <= A8))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((1 <= A1)) U G ((2 <= A21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((1 <= A1)) U G ((2 <= A21)))))
lola: processed formula: A (X ((F ((1 <= A1)) U G ((2 <= A21)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= A6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= A6)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((A13 <= B17))) U F ((3 <= A12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((A13 <= B17))) U F ((3 <= A12))))
lola: processed formula: A ((G (F ((A13 <= B17))) U F ((3 <= A12))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((3 <= A4))) U (B15 <= A26)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X ((3 <= A4))) U (B15 <= A26)))
lola: processed formula: A ((F (X ((3 <= A4))) U (B15 <= A26)))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 (G ((X ((B15 <= A24)) U X ((B18 <= A19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((B15 <= A24) U (B18 <= A19)))))
lola: processed formula: A (G (X (((B15 <= A24) U (B18 <= A19)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 1317312 markings, 5018787 edges, 263462 markings/sec, 0 secs
lola: 2517925 markings, 9933271 edges, 240123 markings/sec, 5 secs
lola: 3622877 markings, 14777611 edges, 220990 markings/sec, 10 secs
lola: 4788477 markings, 19141599 edges, 233120 markings/sec, 15 secs
lola: 5846307 markings, 23565921 edges, 211566 markings/sec, 20 secs
lola: 6840079 markings, 27734633 edges, 198754 markings/sec, 25 secs
lola: 7881859 markings, 32191382 edges, 208356 markings/sec, 30 secs
lola: 8875742 markings, 36046132 edges, 198777 markings/sec, 35 secs
lola: 9901433 markings, 40306101 edges, 205138 markings/sec, 40 secs
lola: 10849439 markings, 44394336 edges, 189601 markings/sec, 45 secs
lola: 11885091 markings, 48677921 edges, 207130 markings/sec, 50 secs
lola: 12847541 markings, 52614709 edges, 192490 markings/sec, 55 secs
lola: 13787845 markings, 56737743 edges, 188061 markings/sec, 60 secs
lola: 14715861 markings, 60996061 edges, 185603 markings/sec, 65 secs
lola: 15786190 markings, 65231882 edges, 214066 markings/sec, 70 secs
lola: 16770455 markings, 69029639 edges, 196853 markings/sec, 75 secs
lola: 17781891 markings, 73192091 edges, 202287 markings/sec, 80 secs
lola: 18694911 markings, 77183256 edges, 182604 markings/sec, 85 secs
lola: 19715509 markings, 81246347 edges, 204120 markings/sec, 90 secs
lola: 20624549 markings, 84941265 edges, 181808 markings/sec, 95 secs
lola: 21560827 markings, 88903938 edges, 187256 markings/sec, 100 secs
lola: 22429245 markings, 92675423 edges, 173684 markings/sec, 105 secs
lola: 23272069 markings, 96700971 edges, 168565 markings/sec, 110 secs
lola: 24297419 markings, 100596210 edges, 205070 markings/sec, 115 secs
lola: 25194647 markings, 104419403 edges, 179446 markings/sec, 120 secs
lola: 26150537 markings, 108396821 edges, 191178 markings/sec, 125 secs
lola: 26998852 markings, 112361072 edges, 169663 markings/sec, 130 secs
lola: 27967897 markings, 116321185 edges, 193809 markings/sec, 135 secs
lola: 28830220 markings, 120062151 edges, 172465 markings/sec, 140 secs
lola: 29651592 markings, 123879227 edges, 164274 markings/sec, 145 secs
lola: 30626819 markings, 128117140 edges, 195045 markings/sec, 150 secs
lola: 31648255 markings, 132754312 edges, 204287 markings/sec, 155 secs
lola: 32658041 markings, 137488465 edges, 201957 markings/sec, 160 secs
lola: 33581154 markings, 141947310 edges, 184623 markings/sec, 165 secs
lola: 34482102 markings, 146238703 edges, 180190 markings/sec, 170 secs
lola: 35310864 markings, 150638805 edges, 165752 markings/sec, 175 secs
lola: 36110975 markings, 155254459 edges, 160022 markings/sec, 180 secs
lola: 36882371 markings, 159499220 edges, 154279 markings/sec, 185 secs
lola: 37605758 markings, 163669866 edges, 144677 markings/sec, 190 secs
lola: 38348741 markings, 167927352 edges, 148597 markings/sec, 195 secs
lola: 39068021 markings, 172006179 edges, 143856 markings/sec, 200 secs
lola: 39781489 markings, 176162616 edges, 142694 markings/sec, 205 secs
lola: 40444517 markings, 180042153 edges, 132606 markings/sec, 210 secs
lola: 41136711 markings, 184211307 edges, 138439 markings/sec, 215 secs
lola: 41846311 markings, 188093208 edges, 141920 markings/sec, 220 secs
lola: 42535281 markings, 192022792 edges, 137794 markings/sec, 225 secs
lola: 43247707 markings, 196092461 edges, 142485 markings/sec, 230 secs
lola: 43907548 markings, 199906186 edges, 131968 markings/sec, 235 secs
lola: 44544385 markings, 203794705 edges, 127367 markings/sec, 240 secs
lola: 45236275 markings, 207701467 edges, 138378 markings/sec, 245 secs
lola: 45904802 markings, 211590415 edges, 133705 markings/sec, 250 secs
lola: 46551705 markings, 215523011 edges, 129381 markings/sec, 255 secs
lola: 47184541 markings, 219273115 edges, 126567 markings/sec, 260 secs
lola: 47850059 markings, 223354179 edges, 133104 markings/sec, 265 secs
lola: 48642994 markings, 228315363 edges, 158587 markings/sec, 270 secs
lola: 49366943 markings, 232849653 edges, 144790 markings/sec, 275 secs
lola: 50117271 markings, 237154360 edges, 150066 markings/sec, 280 secs
lola: 50935489 markings, 241738578 edges, 163644 markings/sec, 285 secs
lola: 51709146 markings, 245884144 edges, 154731 markings/sec, 290 secs
lola: 52443151 markings, 250080058 edges, 146801 markings/sec, 295 secs
lola: 53189711 markings, 254177377 edges, 149312 markings/sec, 300 secs
lola: 53906279 markings, 258207169 edges, 143314 markings/sec, 305 secs
lola: 54636312 markings, 262326159 edges, 146007 markings/sec, 310 secs
lola: 55325634 markings, 266333073 edges, 137864 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (X ((A11 <= A16))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X ((A11 <= A16)))))
lola: processed formula: A (G (F (X ((A11 <= A16)))))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= A11))) U ((3 <= B15) U (2 <= A22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((1 <= A11))) U ((3 <= B15) U (2 <= A22))))
lola: processed formula: A ((X (G ((1 <= A11))) U ((3 <= B15) U (2 <= A22))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (F ((A10 <= A6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (G (F ((A10 <= A6))))))
lola: processed formula: A (X (G (G (F ((A10 <= A6))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((A27 <= A2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((A27 <= A2))))
lola: processed formula: A (G (X ((A27 <= A2))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= A16) U F ((B15 <= A21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((2 <= A16) U F ((B15 <= A21)))))
lola: processed formula: A (X (((2 <= A16) U F ((B15 <= A21)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A19 <= B17)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((A16 <= A2)) U ((A9 <= A10) U (1 <= A6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((A16 <= A2)) U ((A9 <= A10) U (1 <= A6))))
lola: processed formula: A ((X ((A16 <= A2)) U ((A9 <= A10) U (1 <= A6))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 13 will run for 1073 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (F ((2 <= A4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((2 <= A4)))))
lola: processed formula: A (X (X (F ((2 <= A4)))))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= A14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= A14)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-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 3219 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((1 <= A27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((1 <= A27))))
lola: processed formula: A (X (X ((1 <= A27))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: RESULT
lola:
SUMMARY: no no yes no yes unknown no no no no yes no yes no no no
lola: ========================================
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496343997677
--------------------
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_DNAwalker-PT-13ringRLLarge"
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_DNAwalker-PT-13ringRLLarge.tgz
mv S_DNAwalker-PT-13ringRLLarge 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_DNAwalker-PT-13ringRLLarge, 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 r108-blw3-149441612100113"
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 ;