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 GPPP-PT-C1000N0000001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264500590
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494726731222


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ GPPP-PT-C1000N0000001000 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: A (F (G ((1 <= S7P)))) : A ((2 <= _2PG)) : A ((((1 <= Xu5P) U (GAP <= b1)) U F ((DHAP <= _2PG)))) : A ((2 <= c1)) : A (F (F (((_2PG <= GSH) U (Xu5P <= Pi))))) : A (F (G (G (G ((1 <= R5P)))))) : A (F ((G ((3 <= a2)) U F ((3 <= _3PG))))) : A ((F (F ((2 <= NADPH))) U F (G ((Gluc <= NADplus))))) : A ((G ((GSH <= a1)) U X (G ((3 <= _1_3_BPG))))) : A ((start <= Xu5P)) : A ((S7P <= G6P)) : A ((((NADPplus <= _3PG) U (ATP <= Xu5P)) U F (X ((Pi <= F6P))))) : A (F (X (((NADH <= b2) U (G6P <= NADPplus))))) : A (F (G (F (G ((2 <= c1)))))) : A (F (G ((2 <= Xu5P)))) : A (X ((X ((3 <= E4P)) U X ((GSH <= NADH)))))
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 (G ((1 <= S7P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= S7P))))
lola: processed formula: A (F (G ((1 <= S7P))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 ((2 <= _2PG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= _2PG)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= Xu5P) U (GAP <= b1)) U F ((DHAP <= _2PG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= Xu5P) U (GAP <= b1)) U F ((DHAP <= _2PG))))
lola: processed formula: A ((((1 <= Xu5P) U (GAP <= b1)) U F ((DHAP <= _2PG))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= c1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= c1)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((_2PG <= GSH) U (Xu5P <= Pi)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((_2PG <= GSH) U (Xu5P <= Pi))))
lola: processed formula: A (F (((_2PG <= GSH) U (Xu5P <= Pi))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (G ((1 <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (G ((1 <= R5P))))))
lola: processed formula: A (F (G (G (G ((1 <= R5P))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((3 <= a2)) U F ((3 <= _3PG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((3 <= a2)) U F ((3 <= _3PG)))))
lola: processed formula: A (F ((G ((3 <= a2)) U F ((3 <= _3PG)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= NADPH))) U F (G ((Gluc <= NADplus)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= NADPH)) U F (G ((Gluc <= NADplus)))))
lola: processed formula: A ((F ((2 <= NADPH)) U F (G ((Gluc <= NADplus)))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 3479444 markings, 6390792 edges, 695889 markings/sec, 0 secs
lola: 6805794 markings, 12535345 edges, 665270 markings/sec, 5 secs
lola: 10072041 markings, 18571470 edges, 653249 markings/sec, 10 secs
lola: 13313318 markings, 24562502 edges, 648255 markings/sec, 15 secs
lola: 16521145 markings, 30491969 edges, 641565 markings/sec, 20 secs
lola: 19712314 markings, 36391253 edges, 638234 markings/sec, 25 secs
lola: 22883799 markings, 42254640 edges, 634297 markings/sec, 30 secs
lola: 26051990 markings, 48111887 edges, 633638 markings/sec, 35 secs
lola: 29195958 markings, 53924969 edges, 628794 markings/sec, 40 secs
lola: 32344988 markings, 59747146 edges, 629806 markings/sec, 45 secs
lola: 35471384 markings, 65528228 edges, 625279 markings/sec, 50 secs
lola: 38600458 markings, 71314237 edges, 625815 markings/sec, 55 secs
lola: 41730236 markings, 77101534 edges, 625956 markings/sec, 60 secs
lola: 44829437 markings, 82832044 edges, 619840 markings/sec, 65 secs
lola: 47913577 markings, 88535618 edges, 616828 markings/sec, 70 secs
lola: 51002425 markings, 94247641 edges, 617770 markings/sec, 75 secs
lola: 54095464 markings, 99967590 edges, 618608 markings/sec, 80 secs
lola: 57187018 markings, 105684527 edges, 618311 markings/sec, 85 secs
lola: 60278879 markings, 111402175 edges, 618372 markings/sec, 90 secs
lola: 63364924 markings, 117109002 edges, 617209 markings/sec, 95 secs
lola: 66419784 markings, 122758766 edges, 610972 markings/sec, 100 secs
lola: 69412903 markings, 128294309 edges, 598624 markings/sec, 105 secs
lola: 72339343 markings, 133706409 edges, 585288 markings/sec, 110 secs
lola: 75258768 markings, 139105449 edges, 583885 markings/sec, 115 secs
lola: 78169541 markings, 144488723 edges, 582155 markings/sec, 120 secs
lola: 81084260 markings, 149879154 edges, 582944 markings/sec, 125 secs
lola: 83990673 markings, 155254125 edges, 581283 markings/sec, 130 secs
lola: 86897621 markings, 160630130 edges, 581390 markings/sec, 135 secs
lola: 89802993 markings, 166003991 edges, 581074 markings/sec, 140 secs
lola: 92687590 markings, 171338637 edges, 576919 markings/sec, 145 secs
lola: 95579803 markings, 176687261 edges, 578443 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((GSH <= a1)) U X (G ((3 <= _1_3_BPG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((GSH <= a1)) U X (G ((3 <= _1_3_BPG)))))
lola: processed formula: A ((G ((GSH <= a1)) U X (G ((3 <= _1_3_BPG)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 1438201 markings, 9361354 edges, 287640 markings/sec, 0 secs
lola: 2781212 markings, 18655633 edges, 268602 markings/sec, 5 secs
lola: 4129477 markings, 27938481 edges, 269653 markings/sec, 10 secs
lola: 5491330 markings, 37313541 edges, 272371 markings/sec, 15 secs
lola: 6798346 markings, 46347383 edges, 261403 markings/sec, 20 secs
lola: 8139944 markings, 55606490 edges, 268320 markings/sec, 25 secs
lola: 9489240 markings, 64885580 edges, 269859 markings/sec, 30 secs
lola: 10836126 markings, 74177102 edges, 269377 markings/sec, 35 secs
lola: 12180260 markings, 83475617 edges, 268827 markings/sec, 40 secs
lola: 13513700 markings, 92656502 edges, 266688 markings/sec, 45 secs
lola: 14814368 markings, 101613797 edges, 260134 markings/sec, 50 secs
lola: 16102564 markings, 110522657 edges, 257639 markings/sec, 55 secs
lola: 17401022 markings, 119445451 edges, 259692 markings/sec, 60 secs
lola: 18694688 markings, 128399191 edges, 258733 markings/sec, 65 secs
lola: 20006055 markings, 137415637 edges, 262273 markings/sec, 70 secs
lola: 21311120 markings, 146427000 edges, 261013 markings/sec, 75 secs
lola: 22623596 markings, 155490345 edges, 262495 markings/sec, 80 secs
lola: 23971491 markings, 164766067 edges, 269579 markings/sec, 85 secs
lola: 25281784 markings, 173826033 edges, 262059 markings/sec, 90 secs
lola: 26601407 markings, 182922777 edges, 263925 markings/sec, 95 secs
lola: 27937539 markings, 192115306 edges, 267226 markings/sec, 100 secs
lola: 29247559 markings, 201183250 edges, 262004 markings/sec, 105 secs
lola: 30583379 markings, 210385372 edges, 267164 markings/sec, 110 secs
lola: 31897754 markings, 219425229 edges, 262875 markings/sec, 115 secs
lola: 33208176 markings, 228497406 edges, 262084 markings/sec, 120 secs
lola: 34532309 markings, 237605113 edges, 264827 markings/sec, 125 secs
lola: 35809171 markings, 246421436 edges, 255372 markings/sec, 130 secs
lola: 37150749 markings, 255682728 edges, 268316 markings/sec, 135 secs
lola: 38493676 markings, 264918270 edges, 268585 markings/sec, 140 secs
lola: 39839937 markings, 274206675 edges, 269252 markings/sec, 145 secs
lola: 41167527 markings, 283388171 edges, 265518 markings/sec, 150 secs
lola: 42509343 markings, 292623642 edges, 268363 markings/sec, 155 secs
lola: 43844588 markings, 301818094 edges, 267049 markings/sec, 160 secs
lola: 45140935 markings, 310788949 edges, 259269 markings/sec, 165 secs
lola: 46492393 markings, 320094170 edges, 270292 markings/sec, 170 secs
lola: 47821766 markings, 329248815 edges, 265875 markings/sec, 175 secs
lola: 49136381 markings, 338349991 edges, 262923 markings/sec, 180 secs
lola: 50468891 markings, 347519517 edges, 266502 markings/sec, 185 secs
lola: 51781355 markings, 356564992 edges, 262493 markings/sec, 190 secs
lola: 53092569 markings, 365632558 edges, 262243 markings/sec, 195 secs
lola: 54403117 markings, 374642520 edges, 262110 markings/sec, 200 secs
lola: 55730560 markings, 383801425 edges, 265489 markings/sec, 205 secs
lola: 57059680 markings, 392987894 edges, 265824 markings/sec, 210 secs
lola: 58389117 markings, 402131116 edges, 265887 markings/sec, 215 secs
lola: 59692245 markings, 411144823 edges, 260626 markings/sec, 220 secs
lola: 61009051 markings, 420215673 edges, 263361 markings/sec, 225 secs
lola: 62321555 markings, 429250674 edges, 262501 markings/sec, 230 secs
lola: 63604744 markings, 438127611 edges, 256638 markings/sec, 235 secs
lola: 64949772 markings, 447377236 edges, 269006 markings/sec, 240 secs
lola: 66260004 markings, 456416736 edges, 262046 markings/sec, 245 secs
lola: 67551868 markings, 465341805 edges, 258373 markings/sec, 250 secs
lola: 68845963 markings, 474254536 edges, 258819 markings/sec, 255 secs
lola: 70125097 markings, 483094403 edges, 255827 markings/sec, 260 secs
lola: 71395685 markings, 491832605 edges, 254118 markings/sec, 265 secs
lola: 72649254 markings, 500490279 edges, 250714 markings/sec, 270 secs
lola: 73926046 markings, 509293313 edges, 255358 markings/sec, 275 secs
lola: 75207611 markings, 518133155 edges, 256313 markings/sec, 280 secs
lola: 76479414 markings, 526909173 edges, 254361 markings/sec, 285 secs
lola: 77765162 markings, 535769680 edges, 257150 markings/sec, 290 secs
lola: 79010171 markings, 544379187 edges, 249002 markings/sec, 295 secs
lola: 80287521 markings, 553156579 edges, 255470 markings/sec, 300 secs
lola: 81520221 markings, 561683698 edges, 246540 markings/sec, 305 secs
lola: 82808506 markings, 570538838 edges, 257657 markings/sec, 310 secs
lola: 84078511 markings, 579327454 edges, 254001 markings/sec, 315 secs
lola: 85333802 markings, 587957810 edges, 251058 markings/sec, 320 secs
lola: 86628565 markings, 596914715 edges, 258953 markings/sec, 325 secs
lola: 87928119 markings, 605847175 edges, 259911 markings/sec, 330 secs
lola: 89212200 markings, 614736661 edges, 256816 markings/sec, 335 secs
lola: 90504436 markings, 623617917 edges, 258447 markings/sec, 340 secs
lola: 91807660 markings, 632638943 edges, 260645 markings/sec, 345 secs
lola: 93135596 markings, 641776826 edges, 265587 markings/sec, 350 secs
lola: 94462185 markings, 650913683 edges, 265318 markings/sec, 355 secs
lola: 95770595 markings, 659965728 edges, 261682 markings/sec, 360 secs
lola: 97107516 markings, 669169819 edges, 267384 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((start <= Xu5P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (start <= Xu5P)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-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: subprocess 10 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((S7P <= G6P))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking initial satisfaction
lola: processed formula: (S7P <= G6P)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-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 11 will run for 601 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((NADPplus <= _3PG) U (ATP <= Xu5P)) U F (X ((Pi <= F6P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((NADPplus <= _3PG) U (ATP <= Xu5P)) U F (X ((Pi <= F6P)))))
lola: processed formula: A ((((NADPplus <= _3PG) U (ATP <= Xu5P)) U F (X ((Pi <= F6P)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 12 will run for 751 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((NADH <= b2) U (G6P <= NADPplus)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((NADH <= b2) U (G6P <= NADPplus)))))
lola: processed formula: A (F (X (((NADH <= b2) U (G6P <= NADPplus)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 13 will run for 1002 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (G ((2 <= c1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= c1))))
lola: processed formula: A (F (G ((2 <= c1))))
lola: processed formula length: 21
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 14 will run for 1503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= Xu5P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= Xu5P))))
lola: processed formula: A (F (G ((2 <= Xu5P))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 15 will run for 3007 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= E4P)) U X ((GSH <= NADH)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((3 <= E4P) U (GSH <= NADH)))))
lola: processed formula: A (X (X (((3 <= E4P) U (GSH <= NADH)))))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: no no yes yes yes no no unknown unknown no yes no yes no no yes
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494727265068

--------------------
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="GPPP-PT-C1000N0000001000"
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/GPPP-PT-C1000N0000001000.tgz
mv GPPP-PT-C1000N0000001000 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 GPPP-PT-C1000N0000001000, 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 r028-blw3-149440264500590"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;