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

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

=== Now, execution of the tool begins

BK_START 1496398394369


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C1000N0000000010: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_GPPP-PT-C1000N0000000010 @ 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-C1000N0000000010-CTLCardinality.task
lola: A (X (E (F ((1 <= Pyr))))) : NOT(A (G ((S7P <= c1)))) : (E (G ((GAP <= _1_3_BPG))) AND (E (((1 <= E4P) U (c2 <= _2PG))) OR (((GAP <= GSSG) AND (c1 <= start) AND (c1 + 1 <= Lac)) AND E (X ((Gluc <= FBP)))))) : A (G (((2 <= DHAP) OR (((G6P <= ADP) OR (R5P <= Gluc)) AND ((2 <= NADplus) OR (GSH <= NADH)))))) : E ((((c1 <= 0) OR (_2PG <= 2)) U ((F6P + 1 <= Pyr) AND (a2 + 1 <= DHAP)))) : E (((1 <= DHAP) U E (G ((3 <= b1))))) : (((((3 <= Pyr)) OR (c1 <= DHAP)) OR A (G ((3 <= NADPplus)))) OR (A (((c1 <= DHAP) U (3 <= PEP))) AND (Ru5P <= GSH))) : ((((1 <= a1) AND ((a1 <= _1_3_BPG) OR (2 <= DHAP) OR (3 <= G6P) OR (1 <= b2))) OR A (G ((Pyr <= 1)))) OR (1 <= NADH)) : E (F ((((2 <= a2) OR (Ru5P <= GSSG)) AND (2 <= a2) AND (NADPplus <= b1) AND (PEP <= 1)))) : E ((((_3PG <= ATP) OR (3 <= a2)) U A (G ((3 <= GSSG))))) : E (F (((3 <= F6P) AND ((GSSG <= NADH) OR (3 <= _2PG) OR (1 <= G6P) OR (GSH <= b1))))) : E (F ((A (X ((2 <= Lac))) AND E (X ((1 <= b1)))))) : E (G (A (((3 <= a1) U (b2 <= _1_3_BPG))))) : A (F ((A (G ((GAP <= NADPplus))) AND A (G ((2 <= NADPplus)))))) : A (X (NOT(E (G ((DHAP <= E4P)))))) : A (G (A (F (((a2 <= ADP) AND (1 <= ADP))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((1 <= Pyr)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (1 <= Pyr)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((S7P <= c1))))
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-C1000N0000000010-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3243959 markings, 9074895 edges, 648792 markings/sec, 0 secs
lola: sara is running 5 secs || 5970789 markings, 16634464 edges, 545366 markings/sec, 5 secs
lola: sara is running 10 secs || 8596273 markings, 23899282 edges, 525097 markings/sec, 10 secs
lola: sara is running 15 secs || 11285626 markings, 31343020 edges, 537871 markings/sec, 15 secs
lola: sara is running 20 secs || 13959917 markings, 38815726 edges, 534858 markings/sec, 20 secs
lola: sara is running 25 secs || 16629602 markings, 46660155 edges, 533937 markings/sec, 25 secs
lola: sara is running 30 secs || 19203963 markings, 54501053 edges, 514872 markings/sec, 30 secs
lola: sara is running 35 secs || 21547056 markings, 62051410 edges, 468619 markings/sec, 35 secs
lola: sara is running 40 secs || 23804076 markings, 69429614 edges, 451404 markings/sec, 40 secs
lola: sara is running 45 secs || 26034384 markings, 76745936 edges, 446062 markings/sec, 45 secs
lola: sara is running 50 secs || 28290038 markings, 84161488 edges, 451131 markings/sec, 50 secs
lola: sara is running 55 secs || 30572346 markings, 91660307 edges, 456462 markings/sec, 55 secs
lola: sara is running 60 secs || 33007064 markings, 99455580 edges, 486944 markings/sec, 60 secs
lola: sara is running 65 secs || 35440904 markings, 107358959 edges, 486768 markings/sec, 65 secs
lola: sara is running 70 secs || 37673605 markings, 115161793 edges, 446540 markings/sec, 70 secs
lola: sara is running 75 secs || 40145214 markings, 123297764 edges, 494322 markings/sec, 75 secs
lola: sara is running 80 secs || 42357741 markings, 130820619 edges, 442505 markings/sec, 80 secs
lola: sara is running 85 secs || 44444298 markings, 137669879 edges, 417311 markings/sec, 85 secs
lola: sara is running 90 secs || 46695770 markings, 145351197 edges, 450294 markings/sec, 90 secs
lola: sara is running 95 secs || 48799804 markings, 152586849 edges, 420807 markings/sec, 95 secs
lola: sara is running 100 secs || 50914789 markings, 159887404 edges, 422997 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((GAP <= _1_3_BPG))) AND (E (((1 <= E4P) U (c2 <= _2PG))) OR (((GAP <= GSSG) AND (c1 <= start) AND (c1 + 1 <= Lac)) AND E (X ((Gluc <= FBP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((GAP <= _1_3_BPG)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (_1_3_BPG + 1 <= GAP)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: 3351965 markings, 7145802 edges, 670393 markings/sec, 0 secs
lola: 6306414 markings, 14249235 edges, 590890 markings/sec, 5 secs
lola: 8136302 markings, 20179351 edges, 365978 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= DHAP) OR (((G6P <= ADP) OR (R5P <= Gluc)) AND ((2 <= NADplus) OR (GSH <= NADH))))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2725892 markings, 8486164 edges, 545178 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((c1 <= 0) OR (_2PG <= 2)) U ((F6P + 1 <= Pyr) AND (a2 + 1 <= DHAP))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((c1 <= 0) OR (_2PG <= 2)) U ((F6P + 1 <= Pyr) AND (a2 + 1 <= DHAP)))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: 1570916 markings, 9164208 edges, 314183 markings/sec, 0 secs
lola: 2950555 markings, 17824804 edges, 275928 markings/sec, 5 secs
lola: 4258476 markings, 26260516 edges, 261584 markings/sec, 10 secs
lola: 5618890 markings, 35163544 edges, 272083 markings/sec, 15 secs
lola: 6920545 markings, 43676587 edges, 260331 markings/sec, 20 secs
lola: 8153649 markings, 52217707 edges, 246621 markings/sec, 25 secs
lola: 9380909 markings, 59978045 edges, 245452 markings/sec, 30 secs
lola: 10680420 markings, 68099200 edges, 259902 markings/sec, 35 secs
lola: 11866053 markings, 76011295 edges, 237127 markings/sec, 40 secs
lola: 13128227 markings, 84553722 edges, 252435 markings/sec, 45 secs
lola: 14378864 markings, 92680777 edges, 250127 markings/sec, 50 secs
lola: 15584823 markings, 100706378 edges, 241192 markings/sec, 55 secs
lola: 16812666 markings, 109122833 edges, 245569 markings/sec, 60 secs
lola: 18003596 markings, 116815481 edges, 238186 markings/sec, 65 secs
lola: 19201555 markings, 124788285 edges, 239592 markings/sec, 70 secs
lola: 20454975 markings, 133391968 edges, 250684 markings/sec, 75 secs
lola: 21697661 markings, 141469308 edges, 248537 markings/sec, 80 secs
lola: 22901888 markings, 149437528 edges, 240845 markings/sec, 85 secs
lola: 24109578 markings, 157715989 edges, 241538 markings/sec, 90 secs
lola: 25275688 markings, 165249971 edges, 233222 markings/sec, 95 secs
lola: 26447200 markings, 173025699 edges, 234302 markings/sec, 100 secs
lola: 27644310 markings, 181228848 edges, 239422 markings/sec, 105 secs
lola: 28853823 markings, 189045024 edges, 241903 markings/sec, 110 secs
lola: 30023690 markings, 196874860 edges, 233973 markings/sec, 115 secs
lola: 31250007 markings, 205217438 edges, 245263 markings/sec, 120 secs
lola: 32471947 markings, 213130855 edges, 244388 markings/sec, 125 secs
lola: 33662880 markings, 221087158 edges, 238187 markings/sec, 130 secs
lola: 34909568 markings, 229598378 edges, 249338 markings/sec, 135 secs
lola: 36126207 markings, 237477129 edges, 243328 markings/sec, 140 secs
lola: 37283875 markings, 245195197 edges, 231534 markings/sec, 145 secs
lola: 38488109 markings, 253396355 edges, 240847 markings/sec, 150 secs
lola: 39689497 markings, 261199386 edges, 240278 markings/sec, 155 secs
lola: 40822453 markings, 268808899 edges, 226591 markings/sec, 160 secs
lola: 42033317 markings, 276928026 edges, 242173 markings/sec, 165 secs
lola: 43223334 markings, 284701775 edges, 238003 markings/sec, 170 secs
lola: 44314614 markings, 292179186 edges, 218256 markings/sec, 175 secs
lola: 45545163 markings, 300244628 edges, 246110 markings/sec, 180 secs
lola: 46727668 markings, 308014666 edges, 236501 markings/sec, 185 secs
lola: 47824003 markings, 315581136 edges, 219267 markings/sec, 190 secs
lola: 49023969 markings, 323429949 edges, 239993 markings/sec, 195 secs
lola: 50195812 markings, 331104719 edges, 234369 markings/sec, 200 secs
lola: 51303301 markings, 338757245 edges, 221498 markings/sec, 205 secs
lola: 52495133 markings, 346501101 edges, 238366 markings/sec, 210 secs
lola: 53644954 markings, 354103086 edges, 229964 markings/sec, 215 secs
lola: 54768041 markings, 361755387 edges, 224617 markings/sec, 220 secs
lola: 55950440 markings, 369479028 edges, 236480 markings/sec, 225 secs
lola: 57034030 markings, 376831916 edges, 216718 markings/sec, 230 secs
lola: 58220020 markings, 384628045 edges, 237198 markings/sec, 235 secs
lola: 59383661 markings, 392282990 edges, 232728 markings/sec, 240 secs
lola: 60506950 markings, 400020398 edges, 224658 markings/sec, 245 secs
lola: 61694484 markings, 407774417 edges, 237507 markings/sec, 250 secs
lola: 62861183 markings, 415415561 edges, 233340 markings/sec, 255 secs
lola: 64015807 markings, 423408468 edges, 230925 markings/sec, 260 secs
lola: 65217073 markings, 431184608 edges, 240253 markings/sec, 265 secs
lola: 66360606 markings, 438776270 edges, 228707 markings/sec, 270 secs
lola: 67549206 markings, 446929498 edges, 237720 markings/sec, 275 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 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= DHAP) U E (G ((3 <= b1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= DHAP) U NOT(A(TRUE U (b1 <= 2))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((3 <= Pyr)) OR (c1 <= DHAP)) OR A (G ((3 <= NADPplus)))) OR (A (((c1 <= DHAP) U (3 <= PEP))) AND (Ru5P <= GSH)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= Pyr)) OR (c1 <= DHAP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= Pyr)) OR (c1 <= DHAP))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= NADPplus)))
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: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((c1 <= DHAP) U (3 <= PEP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((c1 <= DHAP) U (3 <= PEP))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= a1) AND ((a1 <= _1_3_BPG) OR (2 <= DHAP) OR (3 <= G6P) OR (1 <= b2))) OR A (G ((Pyr <= 1)))) OR (1 <= NADH))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= a1) AND ((a1 <= _1_3_BPG) OR (2 <= DHAP) OR (3 <= G6P) OR (1 <= b2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= a1) AND ((a1 <= _1_3_BPG) OR (2 <= DHAP) OR (3 <= G6P) OR (1 <= b2)))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-CTLCardinality.task
lola: processed formula with 5 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 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Pyr <= 1)))
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-C1000N0000000010-CTLCardinality-8.sara
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= NADH)
lola: ========================================
lola: lola: SUBTASK
lola: lola: ========================================
state equation: calling and running sarachecking initial satisfaction

lola: processed formula: (1 <= NADH)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= a2) OR (Ru5P <= GSSG)) AND (2 <= a2) AND (NADPplus <= b1) AND (PEP <= 1))))
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 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-CTLCardinality-8.sara
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: sara: try reading problem file GPPP-PT-C1000N0000000010-CTLCardinality-8.sara.
========================================
lola: ...considering subproblem: E ((((_3PG <= ATP) OR (3 <= a2)) U A (G ((3 <= GSSG)))))
lola: ========================================
lola: SUBTASK
lola: state equation: calling and running sara
lola: checking CTL
lola: processed formula: E(((_3PG <= ATP) OR (3 <= a2)) U NOT(E(TRUE U (GSSG <= 2))))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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).
sara: try reading problem file GPPP-PT-C1000N0000000010-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: ========================================
subprocess 10 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= F6P) AND ((GSSG <= NADH) OR (3 <= _2PG) OR (1 <= G6P) OR (GSH <= b1)))))
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 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-CTLCardinality-10.sara
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ...considering subproblem: E (F ((A (X ((2 <= Lac))) AND E (X ((1 <= b1))))))
lola: lola: ========================================
state equation: calling and running sara========================================

lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX((2 <= Lac)) AND EX((1 <= b1))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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).
sara: try reading problem file GPPP-PT-C1000N0000000010-CTLCardinality-10.sara.
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 780 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((3 <= a1) U (b2 <= _1_3_BPG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((3 <= a1) U (b2 <= _1_3_BPG)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 13 will run for 1041 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((GAP <= NADPplus))) AND A (G ((2 <= NADPplus))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (NADPplus + 1 <= GAP))) AND NOT(E(TRUE U (NADPplus <= 1)))))
lola: processed formula length: 83
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: 1507137 markings, 8588737 edges, 1941044430010056704 markings/sec, 0 secs
lola: 2795828 markings, 16501374 edges, 257738 markings/sec, 5 secs
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 1554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((DHAP <= E4P))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (E4P + 1 <= DHAP)))
lola: processed formula length: 31
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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 15 will run for 3109 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((a2 <= ADP) AND (1 <= ADP))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((a2 <= ADP) AND (1 <= ADP))))))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: 1415762 markings, 8915316 edges, 283152 markings/sec, 0 secs
lola: 2624362 markings, 16961300 edges, 241720 markings/sec, 5 secs
lola: 3733043 markings, 25125996 edges, 221736 markings/sec, 10 secs
lola: 4851777 markings, 33749547 edges, 223747 markings/sec, 15 secs
lola: 5891978 markings, 42296602 edges, 208040 markings/sec, 20 secs
lola: 7025167 markings, 50696043 edges, 226638 markings/sec, 25 secs
lola: 8090701 markings, 58573486 edges, 213107 markings/sec, 30 secs
lola: 9060998 markings, 66589247 edges, 194059 markings/sec, 35 secs
lola: 10064046 markings, 74455322 edges, 200610 markings/sec, 40 secs
lola: 11150344 markings, 82629147 edges, 217260 markings/sec, 45 secs
lola: 12180939 markings, 90426314 edges, 206119 markings/sec, 50 secs
lola: 13243096 markings, 98636823 edges, 212431 markings/sec, 55 secs
lola: 14309523 markings, 106702155 edges, 213285 markings/sec, 60 secs
lola: 15300797 markings, 114660473 edges, 198255 markings/sec, 65 secs
lola: 16388936 markings, 122812562 edges, 217628 markings/sec, 70 secs
lola: 17381949 markings, 130797813 edges, 198603 markings/sec, 75 secs
lola: 18467965 markings, 138984699 edges, 217203 markings/sec, 80 secs
lola: 19503405 markings, 146792397 edges, 207088 markings/sec, 85 secs
lola: 20570733 markings, 155071383 edges, 213466 markings/sec, 90 secs
lola: 21646342 markings, 163200579 edges, 215122 markings/sec, 95 secs
lola: 22640976 markings, 171218457 edges, 198927 markings/sec, 100 secs
lola: 23721436 markings, 179315621 edges, 216092 markings/sec, 105 secs
lola: 24723958 markings, 187285121 edges, 200504 markings/sec, 110 secs
lola: 25784563 markings, 195325945 edges, 212121 markings/sec, 115 secs
lola: 26797058 markings, 202994445 edges, 202499 markings/sec, 120 secs
lola: 27848476 markings, 211121508 edges, 210284 markings/sec, 125 secs
lola: 28899140 markings, 219075582 edges, 210133 markings/sec, 130 secs
lola: 29895291 markings, 227026803 edges, 199230 markings/sec, 135 secs
lola: 30970285 markings, 235074205 edges, 214999 markings/sec, 140 secs
lola: 31961138 markings, 243118766 edges, 198171 markings/sec, 145 secs
lola: 33041074 markings, 251212655 edges, 215987 markings/sec, 150 secs
lola: 34061803 markings, 258985760 edges, 204146 markings/sec, 155 secs
lola: 35128361 markings, 267197683 edges, 213312 markings/sec, 160 secs
lola: 36188403 markings, 275227198 edges, 212008 markings/sec, 165 secs
lola: 37182117 markings, 283126841 edges, 198743 markings/sec, 170 secs
lola: 38252372 markings, 291149718 edges, 214051 markings/sec, 175 secs
lola: 39235328 markings, 299141603 edges, 196591 markings/sec, 180 secs
lola: 40304814 markings, 307101573 edges, 213897 markings/sec, 185 secs
lola: 41303979 markings, 314844041 edges, 199833 markings/sec, 190 secs
lola: 42374995 markings, 323022025 edges, 214203 markings/sec, 195 secs
lola: 43423508 markings, 330936323 edges, 209703 markings/sec, 200 secs
lola: 44421040 markings, 338811721 edges, 199506 markings/sec, 205 secs
lola: 45479304 markings, 346772108 edges, 211653 markings/sec, 210 secs
lola: 46474806 markings, 354862975 edges, 199100 markings/sec, 215 secs
lola: 47530779 markings, 362735585 edges, 211195 markings/sec, 220 secs
lola: 48515628 markings, 370466177 edges, 196970 markings/sec, 225 secs
lola: 49595464 markings, 378652090 edges, 215967 markings/sec, 230 secs
lola: 50627889 markings, 386452843 edges, 206485 markings/sec, 235 secs
lola: 51613922 markings, 394145490 edges, 197207 markings/sec, 240 secs
lola: 52639329 markings, 401924706 edges, 205081 markings/sec, 245 secs
lola: 53644877 markings, 409923821 edges, 201110 markings/sec, 250 secs
lola: 54689846 markings, 417726447 edges, 208994 markings/sec, 255 secs
lola: 55633583 markings, 425408517 edges, 188747 markings/sec, 260 secs
lola: 56721685 markings, 433518328 edges, 217620 markings/sec, 265 secs
lola: 57728132 markings, 441337489 edges, 201289 markings/sec, 270 secs
lola: 58762689 markings, 449237843 edges, 206911 markings/sec, 275 secs
lola: 59785459 markings, 456974754 edges, 204554 markings/sec, 280 secs
lola: 60820946 markings, 465083152 edges, 207097 markings/sec, 285 secs
lola: 61868382 markings, 472976758 edges, 209487 markings/sec, 290 secs
lola: 62840718 markings, 480807541 edges, 194467 markings/sec, 295 secs
lola: 63920754 markings, 488899983 edges, 216007 markings/sec, 300 secs
lola: 64930246 markings, 496926063 edges, 201898 markings/sec, 305 secs
lola: 65991950 markings, 504974270 edges, 212341 markings/sec, 310 secs
lola: 67011282 markings, 512676410 edges, 203866 markings/sec, 315 secs
lola: 68051316 markings, 520738383 edges, 208007 markings/sec, 320 secs
lola: 69086427 markings, 528590303 edges, 207022 markings/sec, 325 secs
lola: 70069337 markings, 536394601 edges, 196582 markings/sec, 330 secs
lola: 71129959 markings, 544329946 edges, 212124 markings/sec, 335 secs
lola: 72108626 markings, 552297629 edges, 195733 markings/sec, 340 secs
lola: 73169529 markings, 560189890 edges, 212181 markings/sec, 345 secs
lola: 74139780 markings, 567775646 edges, 194050 markings/sec, 350 secs
lola: 75215859 markings, 575243169 edges, 215216 markings/sec, 355 secs
lola: 76263850 markings, 582864550 edges, 209598 markings/sec, 360 secs
lola: 77150793 markings, 590218447 edges, 177389 markings/sec, 365 secs
lola: 78127108 markings, 597610274 edges, 195263 markings/sec, 370 secs
lola: 79093973 markings, 605156494 edges, 193373 markings/sec, 375 secs
lola: 79975269 markings, 612361966 edges, 176259 markings/sec, 380 secs
lola: 80928528 markings, 619799277 edges, 190652 markings/sec, 385 secs
lola: 81827016 markings, 627202692 edges, 179698 markings/sec, 390 secs
lola: 82720456 markings, 634477965 edges, 178688 markings/sec, 395 secs
lola: 83645467 markings, 641929472 edges, 185002 markings/sec, 400 secs
lola: 84543224 markings, 649254751 edges, 179551 markings/sec, 405 secs
lola: 85448550 markings, 656643960 edges, 181065 markings/sec, 410 secs
lola: 86383478 markings, 664195790 edges, 186986 markings/sec, 415 secs
lola: 87242786 markings, 671291788 edges, 171862 markings/sec, 420 secs
lola: 88144173 markings, 678590102 edges, 180277 markings/sec, 425 secs
lola: 89039026 markings, 685791289 edges, 178971 markings/sec, 430 secs
lola: 89901833 markings, 692936662 edges, 172561 markings/sec, 435 secs
lola: 90818168 markings, 700331994 edges, 183267 markings/sec, 440 secs
lola: 91696868 markings, 707472509 edges, 175740 markings/sec, 445 secs
lola: 92594351 markings, 714833726 edges, 179497 markings/sec, 450 secs
lola: 93495570 markings, 722100868 edges, 180244 markings/sec, 455 secs
lola: 94394136 markings, 729385351 edges, 179713 markings/sec, 460 secs
lola: 95284185 markings, 736714051 edges, 178010 markings/sec, 465 secs
lola: 96182255 markings, 743943247 edges, 179614 markings/sec, 470 secs
lola: 97057381 markings, 751163322 edges, 175025 markings/sec, 475 secs
lola: 97941418 markings, 758306571 edges, 176807 markings/sec, 480 secs
lola: 98843686 markings, 765582571 edges, 180454 markings/sec, 485 secs
lola: 99702193 markings, 772709394 edges, 171701 markings/sec, 490 secs
lola: 100596799 markings, 779905446 edges, 178921 markings/sec, 495 secs
lola: 101478966 markings, 787107543 edges, 176433 markings/sec, 500 secs
lola: 102347564 markings, 794212363 edges, 173720 markings/sec, 505 secs
lola: 103253001 markings, 801485309 edges, 181087 markings/sec, 510 secs
lola: 104120924 markings, 808604395 edges, 173585 markings/sec, 515 secs
lola: 104997740 markings, 815730625 edges, 175363 markings/sec, 520 secs
lola: 105880632 markings, 822895101 edges, 176578 markings/sec, 525 secs
lola: 106728349 markings, 829871239 edges, 169543 markings/sec, 530 secs
lola: 107629286 markings, 837117673 edges, 180187 markings/sec, 535 secs
lola: 108493974 markings, 844184137 edges, 172938 markings/sec, 540 secs
lola: 109369823 markings, 851300652 edges, 175170 markings/sec, 545 secs
lola: 110262557 markings, 858548367 edges, 178547 markings/sec, 550 secs
lola: 111120266 markings, 865602412 edges, 171542 markings/sec, 555 secs
lola: 112035566 markings, 872982329 edges, 183060 markings/sec, 560 secs
lola: 112756405 markings, 878941781 edges, 144168 markings/sec, 565 secs
lola: 113660270 markings, 886201008 edges, 180773 markings/sec, 570 secs
lola: 114549527 markings, 893493123 edges, 177851 markings/sec, 575 secs
lola: 115423164 markings, 900621922 edges, 174727 markings/sec, 580 secs
lola: 116337440 markings, 907973132 edges, 182855 markings/sec, 585 secs
lola: 117221938 markings, 915207336 edges, 176900 markings/sec, 590 secs
lola: 118128197 markings, 922321573 edges, 181252 markings/sec, 595 secs
lola: 119039097 markings, 928970262 edges, 182180 markings/sec, 600 secs
lola: 120020641 markings, 936430369 edges, 196309 markings/sec, 605 secs
lola: 120886642 markings, 943462374 edges, 173200 markings/sec, 610 secs
lola: 121726938 markings, 950443479 edges, 168059 markings/sec, 615 secs
lola: 122639725 markings, 957768250 edges, 182557 markings/sec, 620 secs
lola: 123619850 markings, 965316439 edges, 196025 markings/sec, 625 secs
lola: 124482452 markings, 972343251 edges, 172520 markings/sec, 630 secs
lola: 125347221 markings, 979481297 edges, 172954 markings/sec, 635 secs
lola: 126188237 markings, 986577126 edges, 168203 markings/sec, 640 secs
lola: 127149425 markings, 994021735 edges, 192238 markings/sec, 645 secs
lola: 127987940 markings, 1001013576 edges, 167703 markings/sec, 650 secs
lola: 128846965 markings, 1008177973 edges, 171805 markings/sec, 655 secs
lola: 129727423 markings, 1015445660 edges, 176092 markings/sec, 660 secs
lola: 130444246 markings, 1021339908 edges, 143365 markings/sec, 665 secs
lola: 131305286 markings, 1028457811 edges, 172208 markings/sec, 670 secs
lola: 132190609 markings, 1035819326 edges, 177065 markings/sec, 675 secs
lola: 133054693 markings, 1043043942 edges, 172817 markings/sec, 680 secs
lola: 133899343 markings, 1050104196 edges, 168930 markings/sec, 685 secs
lola: 134765251 markings, 1057276048 edges, 173182 markings/sec, 690 secs
lola: 135640097 markings, 1064494651 edges, 174969 markings/sec, 695 secs
lola: 136073256 markings, 1068090314 edges, 86632 markings/sec, 700 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no yes unknown no no no yes yes yes yes no no no unknown
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496399532506

--------------------
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-C1000N0000000010"
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-C1000N0000000010.tgz
mv S_GPPP-PT-C1000N0000000010 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-C1000N0000000010, 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-149441612600570"
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 ;