About the Execution of LoLA for S_DES-PT-10a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5714.990 | 506061.00 | 508574.00 | 72.70 | TFFFFFFTTFFFFFT? | 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-3253
Executing tool lola
Input is S_DES-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700248
=====================================================================
--------------------
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 DES-PT-10a-LTLCardinality-0
FORMULA_NAME DES-PT-10a-LTLCardinality-1
FORMULA_NAME DES-PT-10a-LTLCardinality-10
FORMULA_NAME DES-PT-10a-LTLCardinality-11
FORMULA_NAME DES-PT-10a-LTLCardinality-12
FORMULA_NAME DES-PT-10a-LTLCardinality-13
FORMULA_NAME DES-PT-10a-LTLCardinality-14
FORMULA_NAME DES-PT-10a-LTLCardinality-15
FORMULA_NAME DES-PT-10a-LTLCardinality-2
FORMULA_NAME DES-PT-10a-LTLCardinality-3
FORMULA_NAME DES-PT-10a-LTLCardinality-4
FORMULA_NAME DES-PT-10a-LTLCardinality-5
FORMULA_NAME DES-PT-10a-LTLCardinality-6
FORMULA_NAME DES-PT-10a-LTLCardinality-7
FORMULA_NAME DES-PT-10a-LTLCardinality-8
FORMULA_NAME DES-PT-10a-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496451043411
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DES-PT-10a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_DES-PT-10a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_DES-PT-10a @ 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: 267/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 155 places, 112 transitions, 96 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-10a-LTLCardinality.task
lola: A (F (((2 <= p147) U F ((p55 <= p115))))) : A (F ((X ((p119 <= p23)) U F ((3 <= p41))))) : A ((X ((p36 <= p18)) U F (X ((p99 <= p82))))) : A (X ((G ((3 <= p61)) U F ((2 <= p11))))) : A ((G (G ((p26 <= p15))) U G ((p113 <= p49)))) : A (G (X ((2 <= p152)))) : A ((((1 <= p92) U (p20 <= p97)) U F (G ((3 <= p74))))) : A (F (G (G (F ((p70 <= p64)))))) : A (((3 <= p82) U ((p69 <= p130) U (p125 <= p89)))) : A (G (F (G (X ((p67 <= p72)))))) : A (G ((X ((p90 <= p114)) U X ((p98 <= p46))))) : A ((1 <= p94)) : A ((((3 <= p52) U (p147 <= p50)) U F (G ((1 <= p25))))) : A (G ((p97 <= p100))) : A (X ((X ((p8 <= p148)) U F ((2 <= p128))))) : A ((((3 <= p143) U (1 <= p151)) U X ((p89 <= p147))))
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 <= p147) U F ((p55 <= p115)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= p147) U F ((p55 <= p115)))))
lola: processed formula: A (F (((2 <= p147) U F ((p55 <= p115)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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 ((X ((p119 <= p23)) U F ((3 <= p41)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((p119 <= p23)) U F ((3 <= p41)))))
lola: processed formula: A (F ((X ((p119 <= p23)) U F ((3 <= p41)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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 ((p36 <= p18)) U F (X ((p99 <= p82)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((p36 <= p18)) U F (X ((p99 <= p82)))))
lola: processed formula: A ((X ((p36 <= p18)) U F (X ((p99 <= p82)))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((3 <= p61)) U F ((2 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((3 <= p61)) U F ((2 <= p11)))))
lola: processed formula: A (X ((G ((3 <= p61)) U F ((2 <= p11)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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 ((G (G ((p26 <= p15))) U G ((p113 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((p26 <= p15))) U G ((p113 <= p49))))
lola: processed formula: A ((G (G ((p26 <= p15))) U G ((p113 <= p49))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((2 <= p152))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((2 <= p152))))
lola: processed formula: A (G (X ((2 <= p152))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p92) U (p20 <= p97)) U F (G ((3 <= p74)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p92) U (p20 <= p97)) U F (G ((3 <= p74)))))
lola: processed formula: A ((((1 <= p92) U (p20 <= p97)) U F (G ((3 <= p74)))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (F ((p70 <= p64))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (F ((p70 <= p64))))))
lola: processed formula: A (F (G (G (F ((p70 <= p64))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p82) U ((p69 <= p130) U (p125 <= p89))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= p82) U ((p69 <= p130) U (p125 <= p89))))
lola: processed formula: A (((3 <= p82) U ((p69 <= p130) U (p125 <= p89))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((p67 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((p67 <= p72)))))
lola: processed formula: A (F (G (X ((p67 <= p72)))))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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: 558052 markings, 4089100 edges, 111610 markings/sec, 0 secs
lola: 1076692 markings, 7870365 edges, 103728 markings/sec, 5 secs
lola: 1552366 markings, 11560297 edges, 95135 markings/sec, 10 secs
lola: 2007089 markings, 15368454 edges, 90945 markings/sec, 15 secs
lola: 2433768 markings, 19155993 edges, 85336 markings/sec, 20 secs
lola: 2877980 markings, 22767704 edges, 88842 markings/sec, 25 secs
lola: 3434004 markings, 26574446 edges, 111205 markings/sec, 30 secs
lola: 3962839 markings, 30267912 edges, 105767 markings/sec, 35 secs
lola: 4521182 markings, 34068075 edges, 111669 markings/sec, 40 secs
lola: 4981367 markings, 37642740 edges, 92037 markings/sec, 45 secs
lola: 5348319 markings, 41250586 edges, 73390 markings/sec, 50 secs
lola: 5717283 markings, 44761374 edges, 73793 markings/sec, 55 secs
lola: 6064627 markings, 48154262 edges, 69469 markings/sec, 60 secs
lola: 6439867 markings, 51632540 edges, 75048 markings/sec, 65 secs
lola: 6798115 markings, 55102645 edges, 71650 markings/sec, 70 secs
lola: 7099008 markings, 58446874 edges, 60179 markings/sec, 75 secs
lola: 7440468 markings, 61879421 edges, 68292 markings/sec, 80 secs
lola: 7748010 markings, 65235515 edges, 61508 markings/sec, 85 secs
lola: 8055326 markings, 68429562 edges, 61463 markings/sec, 90 secs
lola: 8407107 markings, 71712089 edges, 70356 markings/sec, 95 secs
lola: 8725819 markings, 74861026 edges, 63742 markings/sec, 100 secs
lola: 9033029 markings, 77967339 edges, 61442 markings/sec, 105 secs
lola: 9355022 markings, 81023493 edges, 64399 markings/sec, 110 secs
lola: 9816012 markings, 84647465 edges, 92198 markings/sec, 115 secs
lola: 10250992 markings, 88257126 edges, 86996 markings/sec, 120 secs
lola: 10636142 markings, 91774480 edges, 77030 markings/sec, 125 secs
lola: 11000734 markings, 95087138 edges, 72918 markings/sec, 130 secs
lola: 11341439 markings, 98256179 edges, 68141 markings/sec, 135 secs
lola: 11675523 markings, 101358002 edges, 66817 markings/sec, 140 secs
lola: 12005267 markings, 104565504 edges, 65949 markings/sec, 145 secs
lola: 12524390 markings, 108462093 edges, 103825 markings/sec, 150 secs
lola: 12952164 markings, 112028680 edges, 85555 markings/sec, 155 secs
lola: 13395671 markings, 115291253 edges, 88701 markings/sec, 160 secs
lola: 13834025 markings, 118392186 edges, 87671 markings/sec, 165 secs
lola: 14208196 markings, 121484928 edges, 74834 markings/sec, 170 secs
lola: 14674339 markings, 124887680 edges, 93229 markings/sec, 175 secs
lola: 15131088 markings, 128224619 edges, 91350 markings/sec, 180 secs
lola: 15519589 markings, 131579891 edges, 77700 markings/sec, 185 secs
lola: 15916610 markings, 134765728 edges, 79404 markings/sec, 190 secs
lola: 16269126 markings, 138155485 edges, 70503 markings/sec, 195 secs
lola: 16588471 markings, 141471450 edges, 63869 markings/sec, 200 secs
lola: 16912621 markings, 144677919 edges, 64830 markings/sec, 205 secs
lola: 17263508 markings, 147630050 edges, 70177 markings/sec, 210 secs
lola: 17597849 markings, 150507932 edges, 66868 markings/sec, 215 secs
lola: 17990009 markings, 153281664 edges, 78432 markings/sec, 220 secs
lola: 18353715 markings, 156308140 edges, 72741 markings/sec, 225 secs
lola: 18664225 markings, 159433283 edges, 62102 markings/sec, 230 secs
lola: 18994433 markings, 162525410 edges, 66042 markings/sec, 235 secs
lola: 19308010 markings, 165506536 edges, 62715 markings/sec, 240 secs
lola: 19569640 markings, 168527422 edges, 52326 markings/sec, 245 secs
lola: 19919700 markings, 171361050 edges, 70012 markings/sec, 250 secs
lola: 20222568 markings, 174343458 edges, 60574 markings/sec, 255 secs
lola: 20473652 markings, 177316023 edges, 50217 markings/sec, 260 secs
lola: 20773029 markings, 180215109 edges, 59875 markings/sec, 265 secs
lola: 21037857 markings, 183113423 edges, 52966 markings/sec, 270 secs
lola: 21324279 markings, 185955545 edges, 57284 markings/sec, 275 secs
lola: 21630741 markings, 188892487 edges, 61292 markings/sec, 280 secs
lola: 21922121 markings, 191800083 edges, 58276 markings/sec, 285 secs
lola: 22302413 markings, 195074972 edges, 76058 markings/sec, 290 secs
lola: 22693489 markings, 198622546 edges, 78215 markings/sec, 295 secs
lola: 23090181 markings, 202247178 edges, 79338 markings/sec, 300 secs
lola: 23439502 markings, 205748836 edges, 69864 markings/sec, 305 secs
lola: 23759878 markings, 209194963 edges, 64075 markings/sec, 310 secs
lola: 24095717 markings, 212673784 edges, 67168 markings/sec, 315 secs
lola: 24401232 markings, 216022994 edges, 61103 markings/sec, 320 secs
lola: 24699412 markings, 219335611 edges, 59636 markings/sec, 325 secs
lola: 25006472 markings, 222722696 edges, 61412 markings/sec, 330 secs
lola: 25332943 markings, 226421241 edges, 65294 markings/sec, 335 secs
lola: 25671722 markings, 229902906 edges, 67756 markings/sec, 340 secs
lola: 26024252 markings, 233276946 edges, 70506 markings/sec, 345 secs
lola: 26378703 markings, 236736549 edges, 70890 markings/sec, 350 secs
lola: 26679344 markings, 240093873 edges, 60128 markings/sec, 355 secs
lola: 27009356 markings, 243620143 edges, 66002 markings/sec, 360 secs
lola: 27411246 markings, 247036309 edges, 80378 markings/sec, 365 secs
lola: 27797932 markings, 250502703 edges, 77337 markings/sec, 370 secs
lola: 28149148 markings, 253941339 edges, 70243 markings/sec, 375 secs
lola: 28470691 markings, 257312416 edges, 64309 markings/sec, 380 secs
lola: 28780512 markings, 260717154 edges, 61964 markings/sec, 385 secs
lola: 29079341 markings, 264100666 edges, 59766 markings/sec, 390 secs
lola: 29383474 markings, 267185117 edges, 60827 markings/sec, 395 secs
lola: 29696009 markings, 270195695 edges, 62507 markings/sec, 400 secs
lola: 29972616 markings, 273179341 edges, 55321 markings/sec, 405 secs
lola: 30228210 markings, 276196697 edges, 51119 markings/sec, 410 secs
lola: 30498075 markings, 279220417 edges, 53973 markings/sec, 415 secs
lola: 30721725 markings, 282356816 edges, 44730 markings/sec, 420 secs
lola: 31078899 markings, 285670445 edges, 71435 markings/sec, 425 secs
lola: 31375524 markings, 289015657 edges, 59325 markings/sec, 430 secs
lola: 31692626 markings, 292134839 edges, 63420 markings/sec, 435 secs
lola: 31958625 markings, 295245737 edges, 53200 markings/sec, 440 secs
lola: 32264406 markings, 298498497 edges, 61156 markings/sec, 445 secs
lola: 32554254 markings, 301673782 edges, 57970 markings/sec, 450 secs
lola: 32831231 markings, 304834104 edges, 55395 markings/sec, 455 secs
lola: 33151537 markings, 307932544 edges, 64061 markings/sec, 460 secs
lola: 33590365 markings, 311148657 edges, 87766 markings/sec, 465 secs
lola: 33965861 markings, 314488583 edges, 75099 markings/sec, 470 secs
lola: 34272050 markings, 317799194 edges, 61238 markings/sec, 475 secs
lola: 34619951 markings, 321123566 edges, 69580 markings/sec, 480 secs
lola: 34930436 markings, 324432790 edges, 62097 markings/sec, 485 secs
lola: 35278914 markings, 327123086 edges, 69696 markings/sec, 490 secs
lola: 35622568 markings, 330091860 edges, 68731 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((p90 <= p114)) U X ((p98 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((p90 <= p114) U (p98 <= p46)))))
lola: processed formula: A (G (X (((p90 <= p114) U (p98 <= p46)))))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p94))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p94)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-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 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p52) U (p147 <= p50)) U F (G ((1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= p52) U (p147 <= p50)) U F (G ((1 <= p25)))))
lola: processed formula: A ((((3 <= p52) U (p147 <= p50)) U F (G ((1 <= p25)))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p97 <= p100)))
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 12 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 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((p8 <= p148)) U F ((2 <= p128)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((p8 <= p148)) U F ((2 <= p128)))))
lola: processed formula: A (X ((X ((p8 <= p148)) U F ((2 <= p128)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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 3034 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p143) U (1 <= p151)) U X ((p89 <= p147))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= p143) U (1 <= p151)) U X ((p89 <= p147))))
lola: processed formula: A ((((3 <= p143) U (1 <= p151)) U X ((p89 <= p147))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 155 places; total mentions: 0
lola: closed formula file DES-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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: RESULT
lola:
SUMMARY: yes no yes no no no no no yes unknown no no no no no yes
FORMULA DES-PT-10a-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10a-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496451549472
--------------------
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_DES-PT-10a"
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_DES-PT-10a.tgz
mv S_DES-PT-10a execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DES-PT-10a, 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 r098-ebro-149488455700248"
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 ;