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-C0001N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264400525
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494720011149


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ GPPP-PT-C0001N0000000100 @ 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, 20 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-C0001N0000000100-CTLCardinality.task
lola: E (F (A (X (((3 <= Lac) AND (1 <= b2)))))) : A (G (((R5P + 1 <= _1_3_BPG) OR (PEP + 1 <= Pi) OR (b2 + 1 <= ATP) OR (ATP <= 0)))) : A (G (E (F (((c1 <= FBP) AND (3 <= _1_3_BPG)))))) : NOT((E (F ((3 <= _1_3_BPG))) OR E (X ((NADPH + 1 <= Lac))))) : (((1 <= Ru5P) OR (1 <= a1) OR (_2PG <= 2)) AND E (F (A (F ((3 <= R5P)))))) : (E (F ((3 <= PEP))) OR (Xu5P + 1 <= Lac)) : (((3 <= _2PG) AND (3 <= Pyr)) OR E (F (((1 <= start) AND (1 <= a2) AND (2 <= Lac))))) : E (G ((A (G ((3 <= GSSG))) OR A (X ((3 <= GSH)))))) : A (X (((b2 <= GSH) AND A (G (TRUE))))) : A (G (E (((b1 <= GSSG) U (NADplus <= FBP))))) : A (G (E (G ((Lac <= 2))))) : (E (G ((((DHAP <= start) OR (GSSG <= start)) AND (R5P <= S7P)))) OR (A (G ((Gluc <= ATP))) AND A (F ((NADPH <= c2))))) : E (G (NOT(E (F ((2 <= _2PG)))))) : A (F (E (((S7P <= Ru5P) U (3 <= start))))) : E (((((2 <= S7P) OR (2 <= a1)) AND ((_2PG <= b2) OR (2 <= GSSG))) U ((3 <= c2) AND (1 <= b1) AND (ATP <= 2)))) : A (G ((((1 <= S7P) OR (c2 <= GSH) OR (a1 + 1 <= NADplus)) OR E (F ((2 <= Gluc))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((3 <= Lac) AND (1 <= b2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((3 <= Lac) AND (1 <= b2))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1579925 markings, 8825348 edges, 3096150801660248064 markings/sec, 0 secs
lola: 2843190 markings, 16361579 edges, 252653 markings/sec, 5 secs
lola: 3953247 markings, 22954851 edges, 222011 markings/sec, 10 secs
lola: 5131859 markings, 29882217 edges, 235722 markings/sec, 15 secs
lola: 6477820 markings, 37860040 edges, 269192 markings/sec, 20 secs
lola: 7811591 markings, 45687802 edges, 266754 markings/sec, 25 secs
lola: 8988544 markings, 52688152 edges, 235391 markings/sec, 30 secs
lola: 10270965 markings, 60237076 edges, 256484 markings/sec, 35 secs
lola: 11492305 markings, 67396581 edges, 244268 markings/sec, 40 secs
lola: 12783366 markings, 74948045 edges, 258212 markings/sec, 45 secs
lola: 14028808 markings, 82208606 edges, 249088 markings/sec, 50 secs
lola: 15187251 markings, 89087971 edges, 231689 markings/sec, 55 secs
lola: 16348026 markings, 95925001 edges, 232155 markings/sec, 60 secs
lola: 17582855 markings, 103202156 edges, 246966 markings/sec, 65 secs
lola: 18427812 markings, 108380082 edges, 168991 markings/sec, 70 secs
lola: 19298961 markings, 113732423 edges, 174230 markings/sec, 75 secs
lola: 20186364 markings, 119187301 edges, 177481 markings/sec, 80 secs
lola: 21066403 markings, 124602325 edges, 176008 markings/sec, 85 secs
lola: 21968092 markings, 130150712 edges, 180338 markings/sec, 90 secs
lola: 22839288 markings, 135510731 edges, 174239 markings/sec, 95 secs
lola: 23768680 markings, 141149177 edges, 185878 markings/sec, 100 secs
lola: 24701147 markings, 146532126 edges, 186493 markings/sec, 105 secs
lola: 25688513 markings, 152248285 edges, 197473 markings/sec, 110 secs
lola: 26679370 markings, 158256589 edges, 198171 markings/sec, 115 secs
lola: 27880215 markings, 165355461 edges, 240169 markings/sec, 120 secs
lola: 29126373 markings, 172674497 edges, 249232 markings/sec, 125 secs
lola: 30303795 markings, 179596986 edges, 235484 markings/sec, 130 secs
lola: 31483199 markings, 186511400 edges, 235881 markings/sec, 135 secs
lola: 32688460 markings, 193581069 edges, 241052 markings/sec, 140 secs
lola: 33893130 markings, 200562996 edges, 240934 markings/sec, 145 secs
lola: 35087012 markings, 207443912 edges, 238776 markings/sec, 150 secs
lola: 36304856 markings, 214053409 edges, 243569 markings/sec, 155 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((R5P + 1 <= _1_3_BPG) OR (PEP + 1 <= Pi) OR (b2 + 1 <= ATP) OR (ATP <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: ========================================
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000100-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000100-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((c1 <= FBP) AND (3 <= _1_3_BPG))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((c1 <= FBP) AND (3 <= _1_3_BPG))))))
lola: processed formula length: 63
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F ((3 <= _1_3_BPG))) OR E (X ((NADPH + 1 <= Lac)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_1_3_BPG <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000100-CTLCardinality-3.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= Ru5P) OR (1 <= a1) OR (_2PG <= 2)) AND E (F (A (F ((3 <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= Ru5P) OR (1 <= a1) OR (_2PG <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= Ru5P) OR (1 <= a1) OR (_2PG <= 2))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: processed formula with 3 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 5 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((3 <= R5P)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (3 <= R5P)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= PEP))) OR (Xu5P + 1 <= Lac))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= PEP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= _2PG) AND (3 <= Pyr)) OR E (F (((1 <= start) AND (1 <= a2) AND (2 <= Lac)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= _2PG) AND (3 <= Pyr))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= _2PG) AND (3 <= Pyr))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: processed formula with 2 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 7 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= start) AND (1 <= a2) AND (2 <= Lac))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000100-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000100-CTLCardinality-7.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((3 <= GSSG))) OR A (X ((3 <= GSH))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (E(TRUE U (GSSG <= 2)) AND NOT(AX((3 <= GSH))))))
lola: processed formula length: 62
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((b2 <= GSH) AND A (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((b2 <= GSH))
lola: processed formula length: 15
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 482 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((b1 <= GSSG) U (NADplus <= FBP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((b1 <= GSSG) U (NADplus <= FBP)))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2996704 markings, 7874878 edges, 3109226743693574144 markings/sec, 0 secs
lola: 5519780 markings, 14714489 edges, 504615 markings/sec, 5 secs
lola: 8187109 markings, 21681181 edges, 533466 markings/sec, 10 secs
lola: 10559263 markings, 28278813 edges, 474431 markings/sec, 15 secs
lola: 13058358 markings, 35031027 edges, 499819 markings/sec, 20 secs
lola: 15469193 markings, 41457732 edges, 482167 markings/sec, 25 secs
lola: 17692961 markings, 47748894 edges, 444754 markings/sec, 30 secs
lola: 20146479 markings, 54412362 edges, 490704 markings/sec, 35 secs
lola: 22396311 markings, 60492258 edges, 449966 markings/sec, 40 secs
lola: 24680954 markings, 66719029 edges, 456929 markings/sec, 45 secs
lola: 26923347 markings, 72693464 edges, 448479 markings/sec, 50 secs
lola: 29206096 markings, 78991749 edges, 456550 markings/sec, 55 secs
lola: 31416281 markings, 84860528 edges, 442037 markings/sec, 60 secs
lola: 33881560 markings, 91623641 edges, 493056 markings/sec, 65 secs
lola: 36151070 markings, 97672761 edges, 453902 markings/sec, 70 secs
lola: 38330864 markings, 103660974 edges, 435959 markings/sec, 75 secs
lola: 40711246 markings, 110079844 edges, 476076 markings/sec, 80 secs
lola: 43047675 markings, 116423239 edges, 467286 markings/sec, 85 secs
lola: 45307826 markings, 122565725 edges, 452030 markings/sec, 90 secs
lola: 47141765 markings, 127903839 edges, 366788 markings/sec, 95 secs
lola: 48456338 markings, 132263600 edges, 262915 markings/sec, 100 secs
lola: 50645938 markings, 138315115 edges, 437920 markings/sec, 105 secs
lola: 52717952 markings, 144087953 edges, 414403 markings/sec, 110 secs
lola: 54853968 markings, 149955819 edges, 427203 markings/sec, 115 secs
lola: 57003539 markings, 155875943 edges, 429914 markings/sec, 120 secs
lola: 58403520 markings, 160628091 edges, 279996 markings/sec, 125 secs
lola: 58783307 markings, 162286564 edges, 75957 markings/sec, 130 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((Lac <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (3 <= Lac))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((((DHAP <= start) OR (GSSG <= start)) AND (R5P <= S7P)))) OR (A (G ((Gluc <= ATP))) AND A (F ((NADPH <= c2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((DHAP <= start) OR (GSSG <= start)) AND (R5P <= S7P))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((start + 1 <= DHAP) AND (start + 1 <= GSSG)) OR (S7P + 1 <= R5P))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Gluc <= ATP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000100-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000100-CTLCardinality-12.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NADPH <= c2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NADPH <= c2))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (F ((2 <= _2PG))))))
lola: ========================================
lola: lola: SUBTASK
========================================
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (2 <= _2PG))))
lola: processed formula length: 36
lola: 7 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((S7P <= Ru5P) U (3 <= start)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((S7P <= Ru5P) U (3 <= start)))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((2 <= S7P) OR (2 <= a1)) AND ((_2PG <= b2) OR (2 <= GSSG))) U ((3 <= c2) AND (1 <= b1) AND (ATP <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((2 <= S7P) OR (2 <= a1)) AND ((_2PG <= b2) OR (2 <= GSSG))) U ((3 <= c2) AND (1 <= b1) AND (ATP <= 2)))
lola: processed formula length: 109
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= S7P) OR (c2 <= GSH) OR (a1 + 1 <= NADplus)) OR E (F ((2 <= Gluc))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((S7P <= 0) AND (GSH + 1 <= c2) AND (NADplus <= a1)) AND NOT(E(TRUE U (2 <= Gluc))))))
lola: processed formula length: 100
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2677982 markings, 6450929 edges, 3542916460886097920 markings/sec, 0 secs
lola: 5207188 markings, 12749076 edges, 505841 markings/sec, 5 secs
lola: 7733891 markings, 19040928 edges, 505341 markings/sec, 10 secs
lola: 9982043 markings, 24825567 edges, 449630 markings/sec, 15 secs
lola: 12306263 markings, 30532349 edges, 464844 markings/sec, 20 secs
lola: 14511910 markings, 36184198 edges, 441129 markings/sec, 25 secs
lola: 16978001 markings, 42308459 edges, 493218 markings/sec, 30 secs
lola: 19300223 markings, 48135262 edges, 464444 markings/sec, 35 secs
lola: 21627486 markings, 53899914 edges, 465453 markings/sec, 40 secs
lola: 23905796 markings, 59628490 edges, 455662 markings/sec, 45 secs
lola: 26119035 markings, 65191958 edges, 442648 markings/sec, 50 secs
lola: 28354222 markings, 70703832 edges, 447037 markings/sec, 55 secs
lola: 30576122 markings, 76363198 edges, 444380 markings/sec, 60 secs
lola: 32669605 markings, 81605344 edges, 418697 markings/sec, 65 secs
lola: 34956583 markings, 87359615 edges, 457396 markings/sec, 70 secs
lola: 37139568 markings, 92802937 edges, 436597 markings/sec, 75 secs
lola: 39335672 markings, 98322993 edges, 439221 markings/sec, 80 secs
lola: 41568803 markings, 103879224 edges, 446626 markings/sec, 85 secs
lola: 43742068 markings, 109322144 edges, 434653 markings/sec, 90 secs
lola: 45976656 markings, 114984242 edges, 446918 markings/sec, 95 secs
lola: 48080822 markings, 120283494 edges, 420833 markings/sec, 100 secs
lola: 50167296 markings, 125529690 edges, 417295 markings/sec, 105 secs
lola: 51440865 markings, 129341603 edges, 254714 markings/sec, 110 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: yes yes no no no yes no no yes no no yes no no no yes
lola: ========================================
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494720427193

--------------------
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-C0001N0000000100"
export BK_EXAMINATION="CTLCardinality"
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-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 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-C0001N0000000100, examination is CTLCardinality"
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-149440264400525"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;