Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_GPPP-PT-C1000N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600581
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496399549378


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C1000N0000000100: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_GPPP-PT-C1000N0000000100 @ 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-C1000N0000000100-LTLCardinality.task
lola: A (X (F ((1 <= GSH)))) : A ((X ((_3PG <= GAP)) U ((1 <= G6P) U (1 <= Pi)))) : A (G (X (G (F ((_2PG <= NADH)))))) : A (F (F (F (X ((2 <= c2)))))) : A ((X (G ((GAP <= _2PG))) U G ((Xu5P <= _1_3_BPG)))) : A ((G ((3 <= GAP)) U ((1 <= b2) U (R5P <= PEP)))) : A (X (X ((1 <= DHAP)))) : A (F (X (X (F ((NADH <= _1_3_BPG)))))) : A (G (F ((F6P <= FBP)))) : A (F (F ((2 <= Gluc)))) : A (F (G (((S7P <= b1) U (1 <= b2))))) : A (F (((1 <= Xu5P) U X ((1 <= a2))))) : A (G (((1 <= Pi) U X ((DHAP <= R5P))))) : A ((3 <= Xu5P)) : A ((X (F ((a1 <= b2))) U X (X ((1 <= b1))))) : A ((NADH <= GSSG))
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 (F ((1 <= GSH))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= GSH))))
lola: processed formula: A (X (F ((1 <= GSH))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((_3PG <= GAP)) U ((1 <= G6P) U (1 <= Pi))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((_3PG <= GAP)) U ((1 <= G6P) U (1 <= Pi))))
lola: processed formula: A ((X ((_3PG <= GAP)) U ((1 <= G6P) U (1 <= Pi))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (F ((_2PG <= NADH))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (F ((_2PG <= NADH))))))
lola: processed formula: A (G (X (G (F ((_2PG <= NADH))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 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: 1530192 markings, 9193544 edges, 306038 markings/sec, 0 secs
lola: 2846619 markings, 17807544 edges, 263285 markings/sec, 5 secs
lola: 4084354 markings, 26123310 edges, 247547 markings/sec, 10 secs
lola: 5265542 markings, 34146320 edges, 236238 markings/sec, 15 secs
lola: 6435723 markings, 42164323 edges, 234036 markings/sec, 20 secs
lola: 7554181 markings, 50017172 edges, 223692 markings/sec, 25 secs
lola: 8722227 markings, 58145235 edges, 233609 markings/sec, 30 secs
lola: 9816537 markings, 65448017 edges, 218862 markings/sec, 35 secs
lola: 10866205 markings, 72108034 edges, 209934 markings/sec, 40 secs
lola: 11913682 markings, 79532464 edges, 209495 markings/sec, 45 secs
lola: 12986361 markings, 86895009 edges, 214536 markings/sec, 50 secs
lola: 14056648 markings, 94613167 edges, 214057 markings/sec, 55 secs
lola: 15090837 markings, 101630589 edges, 206838 markings/sec, 60 secs
lola: 16127739 markings, 109153470 edges, 207380 markings/sec, 65 secs
lola: 17203320 markings, 116433211 edges, 215116 markings/sec, 70 secs
lola: 18235074 markings, 123868928 edges, 206351 markings/sec, 75 secs
lola: 19372506 markings, 131657075 edges, 227486 markings/sec, 80 secs
lola: 20397698 markings, 138872493 edges, 205038 markings/sec, 85 secs
lola: 21513031 markings, 146738848 edges, 223067 markings/sec, 90 secs
lola: 22574649 markings, 154024704 edges, 212324 markings/sec, 95 secs
lola: 23634365 markings, 161666137 edges, 211943 markings/sec, 100 secs
lola: 24754241 markings, 169288945 edges, 223975 markings/sec, 105 secs
lola: 25768202 markings, 176648795 edges, 202792 markings/sec, 110 secs
lola: 26904455 markings, 184413898 edges, 227251 markings/sec, 115 secs
lola: 27920122 markings, 191682732 edges, 203133 markings/sec, 120 secs
lola: 29125228 markings, 200020715 edges, 241021 markings/sec, 125 secs
lola: 30265599 markings, 207877211 edges, 228074 markings/sec, 130 secs
lola: 31325494 markings, 215521976 edges, 211979 markings/sec, 135 secs
lola: 32394981 markings, 222773416 edges, 213897 markings/sec, 140 secs
lola: 33433079 markings, 230308567 edges, 207620 markings/sec, 145 secs
lola: 34540177 markings, 237848591 edges, 221420 markings/sec, 150 secs
lola: 35559833 markings, 245178175 edges, 203931 markings/sec, 155 secs
lola: 36761309 markings, 253450899 edges, 240295 markings/sec, 160 secs
lola: 37884646 markings, 261217993 edges, 224667 markings/sec, 165 secs
lola: 38934667 markings, 268748616 edges, 210004 markings/sec, 170 secs
lola: 39987273 markings, 275945787 edges, 210521 markings/sec, 175 secs
lola: 41070205 markings, 283778263 edges, 216586 markings/sec, 180 secs
lola: 42169379 markings, 291236450 edges, 219835 markings/sec, 185 secs
lola: 43188036 markings, 298574584 edges, 203731 markings/sec, 190 secs
lola: 44334372 markings, 306424062 edges, 229267 markings/sec, 195 secs
lola: 45317420 markings, 313353059 edges, 196610 markings/sec, 200 secs
lola: 46370311 markings, 320739967 edges, 210578 markings/sec, 205 secs
lola: 47367378 markings, 327637106 edges, 199413 markings/sec, 210 secs
lola: 48459983 markings, 335404000 edges, 218521 markings/sec, 215 secs
lola: 49519293 markings, 342664589 edges, 211862 markings/sec, 220 secs
lola: 50517450 markings, 349897253 edges, 199631 markings/sec, 225 secs
lola: 51588559 markings, 357158632 edges, 214222 markings/sec, 230 secs
lola: 52612667 markings, 364589591 edges, 204822 markings/sec, 235 secs
lola: 53679119 markings, 371820160 edges, 213290 markings/sec, 240 secs
lola: 54658054 markings, 378877511 edges, 195787 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (X ((2 <= c2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= c2))))
lola: processed formula: A (F (X ((2 <= c2))))
lola: processed formula length: 21
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-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 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((GAP <= _2PG))) U G ((Xu5P <= _1_3_BPG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((GAP <= _2PG))) U G ((Xu5P <= _1_3_BPG))))
lola: processed formula: A ((X (G ((GAP <= _2PG))) U G ((Xu5P <= _1_3_BPG))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 6 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: 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 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((3 <= GAP)) U ((1 <= b2) U (R5P <= PEP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((3 <= GAP)) U ((1 <= b2) U (R5P <= PEP))))
lola: processed formula: A ((G ((3 <= GAP)) U ((1 <= b2) U (R5P <= PEP))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 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 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((1 <= DHAP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((1 <= DHAP))))
lola: processed formula: A (X (X ((1 <= DHAP))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-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: 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 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (F ((NADH <= _1_3_BPG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (F ((NADH <= _1_3_BPG))))))
lola: processed formula: A (F (X (X (F ((NADH <= _1_3_BPG))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 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 8 will run for 411 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((F6P <= FBP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((F6P <= FBP))))
lola: processed formula: A (G (F ((F6P <= FBP))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-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 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((2 <= Gluc))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((2 <= Gluc)))
lola: processed formula: A (F ((2 <= Gluc)))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-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 10 will run for 548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((S7P <= b1) U (1 <= b2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((S7P <= b1) U (1 <= b2)))))
lola: processed formula: A (F (G (((S7P <= b1) U (1 <= b2)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 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: 4199460 markings, 5600708 edges, 839892 markings/sec, 0 secs
lola: 8332720 markings, 11145044 edges, 826652 markings/sec, 5 secs
lola: 12478615 markings, 16704690 edges, 829179 markings/sec, 10 secs
lola: 16888167 markings, 22618837 edges, 881910 markings/sec, 15 secs
lola: 21441222 markings, 28725232 edges, 910611 markings/sec, 20 secs
lola: 26044768 markings, 34899342 edges, 920709 markings/sec, 25 secs
lola: 30794495 markings, 41270163 edges, 949945 markings/sec, 30 secs
lola: 35479095 markings, 47564672 edges, 936920 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= Xu5P) U X ((1 <= a2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((1 <= Xu5P) U X ((1 <= a2)))))
lola: processed formula: A (F (((1 <= Xu5P) U X ((1 <= a2)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-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 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Pi) U X ((DHAP <= R5P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((1 <= Pi) U X ((DHAP <= R5P)))))
lola: processed formula: A (G (((1 <= Pi) U X ((DHAP <= R5P)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-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: 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 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= Xu5P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Xu5P)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((a1 <= b2))) U X (X ((1 <= b1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((a1 <= b2)) U X ((1 <= b1)))))
lola: processed formula: A (X ((F ((a1 <= b2)) U X ((1 <= b1)))))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: subprocess 15 will run for 3244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NADH <= GSSG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NADH <= GSSG)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000100-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: RESULT
lola:
SUMMARY: no yes unknown no no yes no yes no yes yes no no no yes yes
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496399845580

--------------------
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_GPPP-PT-C1000N0000000100"
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_GPPP-PT-C1000N0000000100.tgz
mv S_GPPP-PT-C1000N0000000100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_GPPP-PT-C1000N0000000100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r108-blw3-149441612600581"
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 ;