About the Execution of LoLA for HypertorusGrid-PT-d3k3p2b06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5282.820 | 295515.00 | 295940.00 | 45.00 | FFFTTFFFFT?FFTFF | 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 HypertorusGrid-PT-d3k3p2b06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500041
=====================================================================
--------------------
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-d3k3p2b06-LTLCardinality-0
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-1
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-10
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-11
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-12
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-13
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-14
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-15
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-2
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-3
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-4
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-5
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-6
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-7
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-8
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494616199153
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ HypertorusGrid-PT-d3k3p2b06 @ 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: 1485/65536 symbol table entries, 20 collisions
lola: preprocessing...
lola: finding significant places
lola: 513 places, 972 transitions, 323 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1161 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: A (X (G (F (G ((1 <= pb_d3_n1_1_1_3)))))) : A (F (X ((2 <= pb_d3_n1_2_2_3)))) : A (X (G (((pb_d2_n2_1_3_2 <= pol_d2_n1_1_2_2) U (pb_d2_n1_1_1_2 <= pol_d3_n1_3_2_3))))) : A (X ((1 <= pb_d3_n2_1_3_1))) : A (F (((2 <= pb_d1_n2_2_3_2) U G ((pol_d2_n1_1_1_2 <= pil_d1_n1_1_3_2))))) : A (G ((G ((pbl_2_2_2 <= pol_d3_n1_3_1_3)) U F ((pb_d1_n2_3_2_3 <= pb_d3_n2_3_1_2))))) : A (X (X ((1 <= po_d3_n1_3_2_3)))) : A (F (F (F (F ((1 <= pol_d3_n1_1_1_3)))))) : A ((X (F ((pbl_2_2_1 <= pi_d1_n1_1_3_2))) U ((2 <= pol_d3_n1_2_3_3) U (3 <= pi_d3_n1_2_1_3)))) : A (F (F (X (F ((2 <= po_d1_n1_2_3_2)))))) : A ((X (X ((pb_d2_n1_1_2_3 <= pb_d1_n1_1_2_3))) U (pb_d1_n1_2_3_3 <= pol_d3_n1_1_2_2))) : A ((pb_d2_n2_3_2_1 <= pb_d3_n2_1_2_1)) : A ((F (F ((2 <= pb_d2_n2_1_1_3))) U (3 <= pbl_2_3_2))) : A (X (F (F (X ((3 <= pil_d1_n1_1_2_3)))))) : A (X (((3 <= pi_d2_n1_2_3_2) U (pbl_1_1_1 <= pb_d2_n2_3_3_2)))) : A (G (X ((2 <= po_d3_n1_1_2_3))))
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 (X (G (F (G ((1 <= pb_d3_n1_1_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_d3_n1_1_1_3)))))
lola: processed formula: A (X (F (G ((1 <= pb_d3_n1_1_1_3)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= pb_d3_n1_2_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= pb_d3_n1_2_2_3))))
lola: processed formula: A (F (X ((2 <= pb_d3_n1_2_2_3))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((pb_d2_n2_1_3_2 <= pol_d2_n1_1_2_2) U (pb_d2_n1_1_1_2 <= pol_d3_n1_3_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((pb_d2_n2_1_3_2 <= pol_d2_n1_1_2_2) U (pb_d2_n1_1_1_2 <= pol_d3_n1_3_2_3)))))
lola: processed formula: A (X (G (((pb_d2_n2_1_3_2 <= pol_d2_n1_1_2_2) U (pb_d2_n1_1_1_2 <= pol_d3_n1_3_2_3)))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 (X ((1 <= pb_d3_n2_1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= pb_d3_n2_1_3_1)))
lola: processed formula: A (X ((1 <= pb_d3_n2_1_3_1)))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= pb_d1_n2_2_3_2) U G ((pol_d2_n1_1_1_2 <= pil_d1_n1_1_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= pb_d1_n2_2_3_2) U G ((pol_d2_n1_1_1_2 <= pil_d1_n1_1_3_2)))))
lola: processed formula: A (F (((2 <= pb_d1_n2_2_3_2) U G ((pol_d2_n1_1_1_2 <= pil_d1_n1_1_3_2)))))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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: 96215 markings, 120661 edges, 19243 markings/sec, 0 secs
lola: 186603 markings, 233580 edges, 18078 markings/sec, 5 secs
lola: 352605 markings, 440856 edges, 33200 markings/sec, 10 secs
lola: 536611 markings, 676383 edges, 36801 markings/sec, 15 secs
lola: 721660 markings, 917862 edges, 37010 markings/sec, 20 secs
lola: 909848 markings, 1163449 edges, 37638 markings/sec, 25 secs
lola: 1077952 markings, 1382823 edges, 33621 markings/sec, 30 secs
lola: 1223374 markings, 1572594 edges, 29084 markings/sec, 35 secs
lola: 1325221 markings, 1705506 edges, 20369 markings/sec, 40 secs
lola: 1423958 markings, 1834337 edges, 19747 markings/sec, 45 secs
lola: 1517441 markings, 1956314 edges, 18697 markings/sec, 50 secs
lola: 1627526 markings, 2099963 edges, 22017 markings/sec, 55 secs
lola: 1773524 markings, 2290463 edges, 29200 markings/sec, 60 secs
lola: 1926523 markings, 2490102 edges, 30600 markings/sec, 65 secs
lola: 2084350 markings, 2696089 edges, 31565 markings/sec, 70 secs
lola: 2244367 markings, 2904961 edges, 32003 markings/sec, 75 secs
lola: 2423059 markings, 3138177 edges, 35738 markings/sec, 80 secs
lola: 2605894 markings, 3376785 edges, 36567 markings/sec, 85 secs
lola: 2786463 markings, 3612452 edges, 36114 markings/sec, 90 secs
lola: 2953505 markings, 3830463 edges, 33408 markings/sec, 95 secs
lola: 3121212 markings, 4049341 edges, 33541 markings/sec, 100 secs
lola: 3290605 markings, 4270428 edges, 33879 markings/sec, 105 secs
lola: 3458983 markings, 4490190 edges, 33676 markings/sec, 110 secs
lola: 3626947 markings, 4709408 edges, 33593 markings/sec, 115 secs
lola: 3794719 markings, 4928369 edges, 33554 markings/sec, 120 secs
lola: 3960851 markings, 5145202 edges, 33226 markings/sec, 125 secs
lola: 4126689 markings, 5361659 edges, 33168 markings/sec, 130 secs
lola: 4293344 markings, 5579152 edges, 33331 markings/sec, 135 secs
lola: 4453863 markings, 5788647 edges, 32104 markings/sec, 140 secs
lola: 4623527 markings, 6010076 edges, 33933 markings/sec, 145 secs
lola: 4791571 markings, 6229411 edges, 33609 markings/sec, 150 secs
lola: 4938544 markings, 6421219 edges, 29395 markings/sec, 155 secs
lola: 5078794 markings, 6604258 edges, 28050 markings/sec, 160 secs
lola: 5224503 markings, 6794420 edges, 29142 markings/sec, 165 secs
lola: 5374295 markings, 6989914 edges, 29958 markings/sec, 170 secs
lola: 5523966 markings, 7185244 edges, 29934 markings/sec, 175 secs
lola: 5675716 markings, 7383307 edges, 30350 markings/sec, 180 secs
lola: 5822259 markings, 7574572 edges, 29309 markings/sec, 185 secs
lola: 5968713 markings, 7765728 edges, 29291 markings/sec, 190 secs
lola: 6115779 markings, 7957666 edges, 29413 markings/sec, 195 secs
lola: 6264830 markings, 8152214 edges, 29810 markings/sec, 200 secs
lola: 6417095 markings, 8350951 edges, 30453 markings/sec, 205 secs
lola: 6569224 markings, 8549511 edges, 30426 markings/sec, 210 secs
lola: 6722077 markings, 8749005 edges, 30571 markings/sec, 215 secs
lola: 6874234 markings, 8947609 edges, 30431 markings/sec, 220 secs
lola: 7026383 markings, 9146197 edges, 30430 markings/sec, 225 secs
lola: 7178445 markings, 9344666 edges, 30412 markings/sec, 230 secs
lola: 7331384 markings, 9544273 edges, 30588 markings/sec, 235 secs
lola: 7483464 markings, 9742776 edges, 30416 markings/sec, 240 secs
lola: 7635482 markings, 9941197 edges, 30404 markings/sec, 245 secs
lola: 7787792 markings, 10139982 edges, 30462 markings/sec, 250 secs
lola: 7940970 markings, 10339910 edges, 30636 markings/sec, 255 secs
lola: 8095064 markings, 10541011 edges, 30819 markings/sec, 260 secs
lola: 8248907 markings, 10741774 edges, 30769 markings/sec, 265 secs
lola: 8408148 markings, 10949478 edges, 31848 markings/sec, 270 secs
lola: 8592965 markings, 11190830 edges, 36963 markings/sec, 275 secs
lola: 8716985 markings, 11352788 edges, 24804 markings/sec, 280 secs
lola: 8798638 markings, 11459420 edges, 16331 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((pbl_2_2_2 <= pol_d3_n1_3_1_3)) U F ((pb_d1_n2_3_2_3 <= pb_d3_n2_3_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((pbl_2_2_2 <= pol_d3_n1_3_1_3)) U F ((pb_d1_n2_3_2_3 <= pb_d3_n2_3_1_2)))))
lola: processed formula: A (G ((G ((pbl_2_2_2 <= pol_d3_n1_3_1_3)) U F ((pb_d1_n2_3_2_3 <= pb_d3_n2_3_1_2)))))
lola: processed formula length: 85
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((1 <= po_d3_n1_3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((1 <= po_d3_n1_3_2_3))))
lola: processed formula: A (X (X ((1 <= po_d3_n1_3_2_3))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (F ((1 <= pol_d3_n1_1_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= pol_d3_n1_1_1_3)))
lola: processed formula: A (F ((1 <= pol_d3_n1_1_1_3)))
lola: processed formula length: 30
lola: 3 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((pbl_2_2_1 <= pi_d1_n1_1_3_2))) U ((2 <= pol_d3_n1_2_3_3) U (3 <= pi_d3_n1_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((pbl_2_2_1 <= pi_d1_n1_1_3_2))) U ((2 <= pol_d3_n1_2_3_3) U (3 <= pi_d3_n1_2_1_3))))
lola: processed formula: A ((X (F ((pbl_2_2_1 <= pi_d1_n1_1_3_2))) U ((2 <= pol_d3_n1_2_3_3) U (3 <= pi_d3_n1_2_1_3))))
lola: processed formula length: 94
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (F ((2 <= po_d1_n1_2_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((2 <= po_d1_n1_2_3_2)))))
lola: processed formula: A (F (X (F ((2 <= po_d1_n1_2_3_2)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((pb_d2_n1_1_2_3 <= pb_d1_n1_1_2_3))) U (pb_d1_n1_2_3_3 <= pol_d3_n1_1_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((pb_d2_n1_1_2_3 <= pb_d1_n1_1_2_3))) U (pb_d1_n1_2_3_3 <= pol_d3_n1_1_2_2)))
lola: processed formula: A ((X (X ((pb_d2_n1_1_2_3 <= pb_d1_n1_1_2_3))) U (pb_d1_n1_2_3_3 <= pol_d3_n1_1_2_2)))
lola: processed formula length: 86
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb_d2_n2_3_2_1 <= pb_d3_n2_1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb_d2_n2_3_2_1 <= pb_d3_n2_1_2_1)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 12 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= pb_d2_n2_1_1_3))) U (3 <= pbl_2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= pb_d2_n2_1_1_3)) U (3 <= pbl_2_3_2)))
lola: processed formula: A ((F ((2 <= pb_d2_n2_1_1_3)) U (3 <= pbl_2_3_2)))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (X ((3 <= pil_d1_n1_1_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((3 <= pil_d1_n1_1_2_3)))))
lola: processed formula: A (X (F (X ((3 <= pil_d1_n1_1_2_3)))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= pi_d2_n1_2_3_2) U (pbl_1_1_1 <= pb_d2_n2_3_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((3 <= pi_d2_n1_2_3_2) U (pbl_1_1_1 <= pb_d2_n2_3_3_2))))
lola: processed formula: A (X (((3 <= pi_d2_n1_2_3_2) U (pbl_1_1_1 <= pb_d2_n2_3_3_2))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 15 will run for 3245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((2 <= po_d3_n1_1_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((2 <= po_d3_n1_1_2_3))))
lola: processed formula: A (G (X ((2 <= po_d3_n1_1_2_3))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes unknown no no yes no no no yes yes no no no
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494616494668
--------------------
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="HypertorusGrid-PT-d3k3p2b06"
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/HypertorusGrid-PT-d3k3p2b06.tgz
mv HypertorusGrid-PT-d3k3p2b06 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 HypertorusGrid-PT-d3k3p2b06, 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 r038-blw7-149440484500041"
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 ;