About the Execution of LoLA for S_GPPP-PT-C0100N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11654.940 | 1000924.00 | 1336154.00 | 450.10 | FTFTTFFFTF??TF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_GPPP-PT-C0100N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612500534
=====================================================================
--------------------
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-C0100N0000000100-CTLCardinality-0
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-1
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-15
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-2
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-3
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-4
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-5
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-6
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-7
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-8
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496394036242
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_GPPP-PT-C0100N0000000100: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_GPPP-PT-C0100N0000000100: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_GPPP-PT-C0100N0000000100 @ 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-C0100N0000000100-CTLCardinality.task
lola: A (F (((1 <= DHAP) AND ((NADH <= FBP) OR (3 <= _3PG) OR (c2 <= DHAP))))) : ((((_3PG <= 2) OR (_3PG + 1 <= Pyr) OR (3 <= c2)) AND A (X (((R5P <= NADPplus) OR (FBP <= Xu5P))))) AND E (F (A (X ((Pi <= G6P)))))) : ((1 <= PEP) OR (A (X ((a1 <= NADplus))) AND (A (G (TRUE)) AND (GAP <= b1)))) : ((((2 <= FBP) AND (3 <= S7P) AND (GSSG + 1 <= NADplus) AND (Pyr <= _2PG) AND (2 <= NADH) AND (Xu5P + 1 <= GSSG)) OR A (G ((Xu5P <= 2)))) OR (A (X ((S7P <= Pyr))) AND ((Ru5P + 1 <= ADP) AND (3 <= a1)))) : A ((A (G ((Pi <= GAP))) U A (G ((_2PG <= NADplus))))) : NOT(NOT((E (X ((2 <= FBP))) OR A (G ((Lac <= c1)))))) : (NOT((((NADPplus <= DHAP) AND (1 <= F6P) AND ((_3PG <= FBP) OR (3 <= a1))) AND E (G ((2 <= PEP))))) AND E (X (E (F ((3 <= FBP)))))) : NOT(E (((Lac <= b2) U ((3 <= _3PG) AND (Lac <= NADplus))))) : E (F (A (G (((3 <= a2) OR (GAP <= ATP)))))) : NOT(A (G (((E4P <= 1) OR (Pi <= 2))))) : A (G (NOT(A (X ((GSSG <= Ru5P)))))) : E (G (E (F ((c1 + 1 <= Xu5P))))) : E (F ((NADPplus <= Lac))) : ((A (G (((1 <= Gluc) OR (_2PG <= ATP)))) AND ()) OR ((3 <= DHAP) AND (_1_3_BPG <= GSSG) AND (GAP + 1 <= _2PG) AND (ATP <= c2) AND ((2 <= c1) OR (2 <= start) OR (a1 <= 2) OR (((3 <= b1) OR (3 <= start)) AND (_3PG <= 2))))) : (A (G (E (G ((3 <= ATP))))) AND (A (X (((b2 <= GSSG)))) OR (E (F ((2 <= Pyr))) AND E (F ((3 <= FBP)))))) : E (F ((3 <= start)))
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 (((1 <= DHAP) AND ((NADH <= FBP) OR (3 <= _3PG) OR (c2 <= DHAP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((1 <= DHAP) AND ((NADH <= FBP) OR (3 <= _3PG) OR (c2 <= DHAP))))
lola: processed formula length: 76
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((_3PG <= 2) OR (_3PG + 1 <= Pyr) OR (3 <= c2)) AND A (X (((R5P <= NADPplus) OR (FBP <= Xu5P))))) AND E (F (A (X ((Pi <= G6P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((_3PG <= 2) OR (_3PG + 1 <= Pyr) OR (3 <= c2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((_3PG <= 2) OR (_3PG + 1 <= Pyr) OR (3 <= c2))
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((R5P <= NADPplus) OR (FBP <= Xu5P))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((R5P <= NADPplus) OR (FBP <= Xu5P)))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((Pi <= G6P)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((Pi <= G6P)))
lola: processed formula length: 25
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= PEP) OR (A (X ((a1 <= NADplus))) AND (A (G (TRUE)) AND (GAP <= b1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= PEP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= PEP)
lola: processed formula length: 10
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((a1 <= NADplus)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((a1 <= NADplus))
lola: processed formula length: 19
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (GAP <= b1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (GAP <= b1)
lola: processed formula length: 11
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((2 <= FBP) AND (3 <= S7P) AND (GSSG + 1 <= NADplus) AND (Pyr <= _2PG) AND (2 <= NADH) AND (Xu5P + 1 <= GSSG)) OR A (G ((Xu5P <= 2)))) OR (A (X ((S7P <= Pyr))) AND ((Ru5P + 1 <= ADP) AND (3 <= a1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= FBP) AND (3 <= S7P) AND (GSSG + 1 <= NADplus) AND (Pyr <= _2PG) AND (2 <= NADH) AND (Xu5P + 1 <= GSSG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= FBP) AND (3 <= S7P) AND (GSSG + 1 <= NADplus) AND (Pyr <= _2PG) AND (2 <= NADH) AND (Xu5P + 1 <= GSSG))
lola: processed formula length: 110
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: processed formula with 6 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Xu5P <= 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 84 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-C0100N0000000100-CTLCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((S7P <= Pyr)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((S7P <= Pyr))
lola: processed formula length: 16
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Ru5P + 1 <= ADP) AND (3 <= a1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Ru5P + 1 <= ADP) AND (3 <= a1))
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((Pi <= GAP))) U A (G ((_2PG <= NADplus)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (GAP + 1 <= Pi))) U NOT(E(TRUE U (NADplus + 1 <= _2PG))))
lola: processed formula length: 72
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1213555 markings, 7903148 edges, 2750339551317721088 markings/sec, 0 secs
lola: 2380907 markings, 15780157 edges, 233470 markings/sec, 5 secs
lola: 3577079 markings, 23852273 edges, 239234 markings/sec, 10 secs
lola: 4741572 markings, 31689370 edges, 232899 markings/sec, 15 secs
lola: 5871750 markings, 39307452 edges, 226036 markings/sec, 20 secs
lola: 7016473 markings, 47014185 edges, 228945 markings/sec, 25 secs
lola: 8193024 markings, 54906095 edges, 235310 markings/sec, 30 secs
lola: 9322924 markings, 62522825 edges, 225980 markings/sec, 35 secs
lola: 10464049 markings, 70207607 edges, 228225 markings/sec, 40 secs
lola: 11604739 markings, 77888422 edges, 228138 markings/sec, 45 secs
lola: 12745095 markings, 85570338 edges, 228071 markings/sec, 50 secs
lola: 13941100 markings, 93626340 edges, 239201 markings/sec, 55 secs
lola: 15075455 markings, 101268382 edges, 226871 markings/sec, 60 secs
lola: 16228973 markings, 109040223 edges, 230704 markings/sec, 65 secs
lola: 17426659 markings, 117122625 edges, 239537 markings/sec, 70 secs
lola: 18585019 markings, 124933886 edges, 231672 markings/sec, 75 secs
lola: 19736137 markings, 132696078 edges, 230224 markings/sec, 80 secs
lola: 20890249 markings, 140478872 edges, 230822 markings/sec, 85 secs
lola: 22044644 markings, 148258138 edges, 230879 markings/sec, 90 secs
lola: 23200233 markings, 156041262 edges, 231118 markings/sec, 95 secs
lola: 24346672 markings, 163762672 edges, 229288 markings/sec, 100 secs
lola: 25498334 markings, 171517018 edges, 230332 markings/sec, 105 secs
lola: 26608189 markings, 179001185 edges, 221971 markings/sec, 110 secs
lola: 27738100 markings, 186613292 edges, 225982 markings/sec, 115 secs
lola: 28872571 markings, 194254046 edges, 226894 markings/sec, 120 secs
lola: 30004929 markings, 201878319 edges, 226472 markings/sec, 125 secs
lola: 31137417 markings, 209507253 edges, 226498 markings/sec, 130 secs
lola: 32347840 markings, 217641438 edges, 242085 markings/sec, 135 secs
lola: 33482083 markings, 225287028 edges, 226849 markings/sec, 140 secs
lola: 34653568 markings, 233152201 edges, 234297 markings/sec, 145 secs
lola: 35752318 markings, 240585378 edges, 219750 markings/sec, 150 secs
lola: 36891403 markings, 248257155 edges, 227817 markings/sec, 155 secs
lola: 38027944 markings, 255914609 edges, 227308 markings/sec, 160 secs
lola: 39173829 markings, 263623784 edges, 229177 markings/sec, 165 secs
lola: 40320864 markings, 271337724 edges, 229407 markings/sec, 170 secs
lola: 41483766 markings, 279159393 edges, 232580 markings/sec, 175 secs
lola: 42647926 markings, 287002927 edges, 232832 markings/sec, 180 secs
lola: 43814492 markings, 294864665 edges, 233313 markings/sec, 185 secs
lola: 44956564 markings, 302560574 edges, 228414 markings/sec, 190 secs
lola: 46101132 markings, 310272624 edges, 228914 markings/sec, 195 secs
lola: 47239819 markings, 317942490 edges, 227737 markings/sec, 200 secs
lola: 48406323 markings, 325803220 edges, 233301 markings/sec, 205 secs
lola: 49540588 markings, 333445921 edges, 226853 markings/sec, 210 secs
lola: 50673688 markings, 341079711 edges, 226620 markings/sec, 215 secs
lola: 51818359 markings, 348788154 edges, 228934 markings/sec, 220 secs
lola: 52988064 markings, 356682718 edges, 233941 markings/sec, 225 secs
lola: 54142857 markings, 364466576 edges, 230959 markings/sec, 230 secs
lola: 55298589 markings, 372264785 edges, 231146 markings/sec, 235 secs
lola: 56456565 markings, 380240146 edges, 231595 markings/sec, 240 secs
lola: 57500287 markings, 387918484 edges, 208744 markings/sec, 245 secs
lola: 58493382 markings, 395209299 edges, 198619 markings/sec, 250 secs
lola: 59491832 markings, 402587604 edges, 199690 markings/sec, 255 secs
lola: 60502499 markings, 410013315 edges, 202133 markings/sec, 260 secs
lola: 61500804 markings, 417343551 edges, 199661 markings/sec, 265 secs
lola: 62489482 markings, 424649733 edges, 197736 markings/sec, 270 secs
lola: 63484016 markings, 431950006 edges, 198907 markings/sec, 275 secs
lola: 64471182 markings, 439222768 edges, 197433 markings/sec, 280 secs
lola: 65408995 markings, 446108197 edges, 187563 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (X ((2 <= FBP))) OR A (G ((Lac <= c1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= FBP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= FBP))
lola: processed formula length: 14
lola: 15 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Lac <= c1)))
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 84 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-C0100N0000000100-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2890451 markings, 8850123 edges, 578090 markings/sec, 0 secs
lola: sara is running 5 secs || 5516670 markings, 16938003 edges, 525244 markings/sec, 5 secs
lola: sara is running 10 secs || 8210503 markings, 25261622 edges, 538767 markings/sec, 10 secs
lola: sara is running 15 secs || 10662009 markings, 32857204 edges, 490301 markings/sec, 15 secs
lola: sara is running 20 secs || 13253017 markings, 40829965 edges, 518202 markings/sec, 20 secs
lola: sara is running 25 secs || 15763411 markings, 48580080 edges, 502079 markings/sec, 25 secs
lola: sara is running 30 secs || 18374885 markings, 56667610 edges, 522295 markings/sec, 30 secs
lola: sara is running 35 secs || 20977680 markings, 64718494 edges, 520559 markings/sec, 35 secs
lola: sara is running 40 secs || 23694891 markings, 73178923 edges, 543442 markings/sec, 40 secs
lola: sara is running 45 secs || 26493245 markings, 81884148 edges, 559671 markings/sec, 45 secs
lola: sara is running 50 secs || 28935003 markings, 89480873 edges, 488352 markings/sec, 50 secs
lola: sara is running 55 secs || 31628422 markings, 97858848 edges, 538684 markings/sec, 55 secs
lola: sara is running 60 secs || 34351576 markings, 106329777 edges, 544631 markings/sec, 60 secs
lola: sara is running 65 secs || 36966555 markings, 114463625 edges, 522996 markings/sec, 65 secs
lola: sara is running 70 secs || 39665943 markings, 122860491 edges, 539878 markings/sec, 70 secs
lola: sara is running 75 secs || 42341536 markings, 131183536 edges, 535119 markings/sec, 75 secs
lola: sara is running 80 secs || 44990662 markings, 139423532 edges, 529825 markings/sec, 80 secs
lola: sara is running 85 secs || 47366587 markings, 146814869 edges, 475185 markings/sec, 85 secs
lola: sara is running 90 secs || 49840033 markings, 154508579 edges, 494689 markings/sec, 90 secs
lola: sara is running 95 secs || 52176497 markings, 161775144 edges, 467293 markings/sec, 95 secs
lola: sara is running 100 secs || 54515515 markings, 169050466 edges, 467804 markings/sec, 100 secs
lola: sara is running 105 secs || 56939575 markings, 176590669 edges, 484812 markings/sec, 105 secs
lola: sara is running 110 secs || 59393746 markings, 184223738 edges, 490834 markings/sec, 110 secs
lola: sara is running 115 secs || 61746934 markings, 191542549 edges, 470638 markings/sec, 115 secs
lola: sara is running 120 secs || 64036394 markings, 198663483 edges, 457892 markings/sec, 120 secs
lola: sara is running 125 secs || 66360058 markings, 205890816 edges, 464733 markings/sec, 125 secs
lola: sara is running 130 secs || 68796730 markings, 213469366 edges, 487334 markings/sec, 130 secs
lola: sara is running 135 secs || 71243464 markings, 221079406 edges, 489347 markings/sec, 135 secs
lola: sara is running 140 secs || 73643277 markings, 228542625 edges, 479963 markings/sec, 140 secs
lola: sara is running 145 secs || 75992147 markings, 235847503 edges, 469774 markings/sec, 145 secs
lola: sara is running 150 secs || 78424779 markings, 243413550 edges, 486526 markings/sec, 150 secs
lola: sara is running 155 secs || 80726013 markings, 250570478 edges, 460247 markings/sec, 155 secs
lola: sara is running 160 secs || 83094902 markings, 257938441 edges, 473778 markings/sec, 160 secs
lola: sara is running 165 secs || 85424656 markings, 265182984 edges, 465951 markings/sec, 165 secs
lola: sara is running 170 secs || 87694111 markings, 272539883 edges, 453891 markings/sec, 170 secs
lola: sara is running 175 secs || 90025380 markings, 280426229 edges, 466254 markings/sec, 175 secs
lola: sara is running 180 secs || 92109153 markings, 287522128 edges, 416755 markings/sec, 180 secs
lola: sara is running 185 secs || 94044876 markings, 294103009 edges, 387145 markings/sec, 185 secs
lola: sara is running 190 secs || 96140436 markings, 301226651 edges, 419112 markings/sec, 190 secs
lola: sara is running 195 secs || 98547109 markings, 309407210 edges, 481335 markings/sec, 195 secs
lola: sara is running 200 secs || 100934192 markings, 317519993 edges, 477417 markings/sec, 200 secs
lola: sara is running 205 secs || 103195825 markings, 325256309 edges, 452327 markings/sec, 205 secs
lola: sara is running 210 secs || 105371898 markings, 332850440 edges, 435215 markings/sec, 210 secs
lola: sara is running 215 secs || 107507633 markings, 340336791 edges, 427147 markings/sec, 215 secs
lola: sara is running 220 secs || 109658092 markings, 347884454 edges, 430092 markings/sec, 220 secs
lola: sara is running 225 secs || 111686495 markings, 355008653 edges, 405681 markings/sec, 225 secs
lola: sara is running 230 secs || 113679261 markings, 362011678 edges, 398553 markings/sec, 230 secs
lola: sara is running 235 secs || 115609807 markings, 368867273 edges, 386109 markings/sec, 235 secs
lola: sara is running 240 secs || 117394272 markings, 375171675 edges, 356893 markings/sec, 240 secs
lola: sara is running 245 secs || 119273739 markings, 381812932 edges, 375893 markings/sec, 245 secs
lola: sara is running 250 secs || 121038724 markings, 388048454 edges, 352997 markings/sec, 250 secs
lola: sara is running 255 secs || 122791795 markings, 394241917 edges, 350614 markings/sec, 255 secs
lola: sara is running 260 secs || 124607722 markings, 400658497 edges, 363185 markings/sec, 260 secs
lola: sara is running 265 secs || 126473922 markings, 407251239 edges, 373240 markings/sec, 265 secs
lola: sara is running 270 secs || 128242421 markings, 413499369 edges, 353700 markings/sec, 270 secs
lola: sara is running 275 secs || 130075704 markings, 419976234 edges, 366657 markings/sec, 275 secs
lola: sara is running 280 secs || 131898317 markings, 426415227 edges, 364523 markings/sec, 280 secs
lola: sara is running 285 secs || 133670985 markings, 432678428 edges, 354534 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((NADPplus <= DHAP) AND (1 <= F6P) AND ((_3PG <= FBP) OR (3 <= a1))) AND E (G ((2 <= PEP))))) AND E (X (E (F ((3 <= FBP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((DHAP + 1 <= NADPplus) OR (F6P <= 0) OR ((FBP + 1 <= _3PG) AND (a1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((DHAP + 1 <= NADPplus) OR (F6P <= 0) OR ((FBP + 1 <= _3PG) AND (a1 <= 2)))
lola: processed formula length: 77
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: processed formula with 4 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 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= FBP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (3 <= FBP)))
lola: processed formula length: 24
lola: 7 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 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: ========================================
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((Lac <= b2) U ((3 <= _3PG) AND (Lac <= NADplus)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((Lac <= b2) U ((3 <= _3PG) AND (Lac <= NADplus))))
lola: processed formula length: 56
lola: 7 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((3 <= a2) OR (GAP <= ATP))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((a2 <= 2) AND (ATP + 1 <= GAP)))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 1174461 markings, 7586051 edges, 3689348869717491712 markings/sec, 0 secs
lola: 2261212 markings, 14887829 edges, 217350 markings/sec, 5 secs
lola: 3305115 markings, 21949602 edges, 208781 markings/sec, 10 secs
lola: 4348574 markings, 28921770 edges, 208692 markings/sec, 15 secs
lola: 5409577 markings, 36068166 edges, 212201 markings/sec, 20 secs
lola: 6447685 markings, 43084312 edges, 207622 markings/sec, 25 secs
lola: 7474658 markings, 49945139 edges, 205395 markings/sec, 30 secs
lola: 8467781 markings, 56651223 edges, 198625 markings/sec, 35 secs
lola: 9538530 markings, 63857185 edges, 214150 markings/sec, 40 secs
lola: 10655846 markings, 71348488 edges, 223463 markings/sec, 45 secs
lola: 11731864 markings, 78579540 edges, 215204 markings/sec, 50 secs
lola: 12768913 markings, 85556100 edges, 207410 markings/sec, 55 secs
lola: 13846668 markings, 92842471 edges, 215551 markings/sec, 60 secs
lola: 14953539 markings, 100281421 edges, 221374 markings/sec, 65 secs
lola: 16053414 markings, 107642246 edges, 219975 markings/sec, 70 secs
lola: 17067149 markings, 114459241 edges, 202747 markings/sec, 75 secs
lola: 18092399 markings, 121387574 edges, 205050 markings/sec, 80 secs
lola: 19167202 markings, 128569993 edges, 214961 markings/sec, 85 secs
lola: 20216614 markings, 135630615 edges, 209882 markings/sec, 90 secs
lola: 21220664 markings, 142424011 edges, 200810 markings/sec, 95 secs
lola: 22260834 markings, 149376402 edges, 208034 markings/sec, 100 secs
lola: 23285463 markings, 156273923 edges, 204926 markings/sec, 105 secs
lola: 24362978 markings, 163554635 edges, 215503 markings/sec, 110 secs
lola: 25389956 markings, 170417819 edges, 205396 markings/sec, 115 secs
lola: 26383975 markings, 177130935 edges, 198804 markings/sec, 120 secs
lola: 27372115 markings, 183752901 edges, 197628 markings/sec, 125 secs
lola: 28358742 markings, 190421106 edges, 197325 markings/sec, 130 secs
lola: 29370033 markings, 197183744 edges, 202258 markings/sec, 135 secs
lola: 30334649 markings, 203710913 edges, 192923 markings/sec, 140 secs
lola: 31321545 markings, 210312001 edges, 197379 markings/sec, 145 secs
lola: 32294011 markings, 216880866 edges, 194493 markings/sec, 150 secs
lola: 33294386 markings, 223575987 edges, 200075 markings/sec, 155 secs
lola: 34248098 markings, 229985923 edges, 190742 markings/sec, 160 secs
lola: 35216627 markings, 236512145 edges, 193706 markings/sec, 165 secs
lola: 36234495 markings, 243340808 edges, 203574 markings/sec, 170 secs
lola: 37310578 markings, 250580007 edges, 215217 markings/sec, 175 secs
lola: 38414545 markings, 258006033 edges, 220793 markings/sec, 180 secs
lola: 39518848 markings, 265428819 edges, 220861 markings/sec, 185 secs
lola: 40658544 markings, 273093238 edges, 227939 markings/sec, 190 secs
lola: 41718036 markings, 280264725 edges, 211898 markings/sec, 195 secs
lola: 42808227 markings, 287573951 edges, 218038 markings/sec, 200 secs
lola: 43909606 markings, 294951155 edges, 220276 markings/sec, 205 secs
lola: 44974329 markings, 302119942 edges, 212945 markings/sec, 210 secs
lola: 46006137 markings, 309083193 edges, 206362 markings/sec, 215 secs
lola: 47117610 markings, 316571515 edges, 222295 markings/sec, 220 secs
lola: 48205912 markings, 323865853 edges, 217660 markings/sec, 225 secs
lola: 49251548 markings, 330878566 edges, 209127 markings/sec, 230 secs
lola: 50330840 markings, 338136112 edges, 215858 markings/sec, 235 secs
lola: 51390901 markings, 345306090 edges, 212012 markings/sec, 240 secs
lola: 52460223 markings, 352463935 edges, 213864 markings/sec, 245 secs
lola: 53530934 markings, 359658863 edges, 214142 markings/sec, 250 secs
lola: 54611966 markings, 366931549 edges, 216206 markings/sec, 255 secs
lola: 55660488 markings, 374013789 edges, 209704 markings/sec, 260 secs
lola: 56630860 markings, 380819397 edges, 194074 markings/sec, 265 secs
lola: 57525743 markings, 387411319 edges, 178977 markings/sec, 270 secs
lola: 58425218 markings, 394039929 edges, 179895 markings/sec, 275 secs
lola: 59333035 markings, 400736615 edges, 181563 markings/sec, 280 secs
lola: 60230283 markings, 407347783 edges, 179450 markings/sec, 285 secs
lola: 61127166 markings, 413955281 edges, 179377 markings/sec, 290 secs
lola: 62037351 markings, 420672240 edges, 182037 markings/sec, 295 secs
lola: 62922764 markings, 427184212 edges, 177083 markings/sec, 300 secs
lola: 63796060 markings, 433626413 edges, 174659 markings/sec, 305 secs
lola: 64662813 markings, 440015743 edges, 173351 markings/sec, 310 secs
lola: 65548096 markings, 446543913 edges, 177057 markings/sec, 315 secs
lola: 66472915 markings, 453360721 edges, 184964 markings/sec, 320 secs
lola: 67389830 markings, 460118000 edges, 183383 markings/sec, 325 secs
lola: 68281279 markings, 466687883 edges, 178290 markings/sec, 330 secs
lola: 69129897 markings, 472961762 edges, 169724 markings/sec, 335 secs
lola: 69996647 markings, 479342207 edges, 173350 markings/sec, 340 secs
lola: 70882518 markings, 485856323 edges, 177174 markings/sec, 345 secs
lola: 71797529 markings, 492615126 edges, 183002 markings/sec, 350 secs
lola: 72687612 markings, 499165743 edges, 178017 markings/sec, 355 secs
lola: 73560967 markings, 505602713 edges, 174671 markings/sec, 360 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((E4P <= 1) OR (Pi <= 2)))))
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 84 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((GSSG <= Ru5P))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((Ru5P + 1 <= GSSG)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 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 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((c1 + 1 <= Xu5P)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (c1 + 1 <= Xu5P)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 644 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NADPplus <= 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 84 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-C0100N0000000100-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((1 <= Gluc) OR (_2PG <= ATP)))) AND ()) OR ((3 <= DHAP) AND (_1_3_BPG <= GSSG) AND (GAP + 1 <= _2PG) AND (ATP <= c2) AND ((2 <= c1) OR (2 <= start) OR (a1 <= 2) OR (((3 <= b1) OR (3 <= start)) AND (_3PG <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Gluc) OR (_2PG <= 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 84 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= DHAP) AND (_1_3_BPG <= GSSG) AND (GAP + 1 <= _2PG) AND (ATP <= c2) AND ((2 <= c1) OR (2 <= start) OR (a1 <= 2) OR (((3 <= b1) OR (3 <= start)) AND (_3PG <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= DHAP) AND (_1_3_BPG <= GSSG) AND (GAP + 1 <= _2PG) AND (ATP <= c2) AND ((2 <= c1) OR (2 <= start) OR (a1 <= 2) OR (((3 <= b1) OR (3 <= start)) AND (_3PG <= 2))))
lola: processed formula length: 172
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: processed formula with 10 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (G ((3 <= ATP))))) AND (A (X (((b2 <= GSSG)))) OR (E (F ((2 <= Pyr))) AND E (F ((3 <= FBP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((3 <= ATP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (ATP <= 2))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: subprocess 15 will run for 2578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= start)))
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 84 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-C0100N0000000100-CTLCardinality-15.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4091479 markings, 7348417 edges, 818296 markings/sec, 0 secs
lola: sara is running 5 secs || 7930253 markings, 14272759 edges, 767755 markings/sec, 5 secs
lola: sara is running 10 secs || 11648667 markings, 20978136 edges, 743683 markings/sec, 10 secs
lola: sara is running 15 secs || 15385802 markings, 27699008 edges, 747427 markings/sec, 15 secs
lola: sara is running 20 secs || 19019051 markings, 34305744 edges, 726650 markings/sec, 20 secs
lola: sara is running 25 secs || 22629000 markings, 40839022 edges, 721990 markings/sec, 25 secs
lola: sara is running 30 secs || 26243317 markings, 47380352 edges, 722863 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no unknown unknown yes no unknown no no yes yes no no no
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496395037166
--------------------
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-C0100N0000000100"
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/S_GPPP-PT-C0100N0000000100.tgz
mv S_GPPP-PT-C0100N0000000100 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-C0100N0000000100, 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 r108-blw3-149441612500534"
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 '
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 ;