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)
...............
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GPPP-PT-C0100N0000000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998300304
=====================================================================

--------------------
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-C0100N0000000010-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526724170897

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0100N0000000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0100N0000000010 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ GPPP-PT-C0100N0000000010 @ 3569 seconds
lola: LoLA will run for 3569 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: Size of bit vector: 1056
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-C0100N0000000010-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= start)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= S7P)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= E4P)
lola: LP says that atomic proposition is always false: (2 <= E4P)
lola: NOT(E ((((FBP <= GSH)) U ((2 <= PEP) AND (2 <= DHAP))))) : NOT(((((GSH <= _2PG) OR (b1 <= _2PG)) OR E (F ((a2 <= FBP)))) AND (E (F ((1 <= _2PG))) OR (3 <= a2)))) : (E ((TRUE U ((1 <= a2) AND (b2 <= DHAP)))) OR E (G (()))) : NOT((A (G ((2 <= ATP))) OR ((ADP <= DHAP) AND (NADPplus <= S7P)))) : ((E (((2 <= Lac) U (Lac <= a1))) OR E (X ((2 <= a2)))) AND A (X (A (G ((start <= _1_3_BPG)))))) : (A (X (((Ru5P + 1 <= _2PG) OR (PEP + 1 <= Gluc)))) AND E ((((NADH <= S7P) OR (2 <= b2)) U ((3 <= Pyr))))) : (E (X ((3 <= Pi))) AND E ((((Lac <= _1_3_BPG) AND (NADPH <= Lac)) U (GSSG + 1 <= GSH)))) : NOT((NOT(E (G ((b2 <= E4P)))) AND (((Ru5P <= 2) OR ((1 <= c2) AND (GSH <= a2))) AND ((NADPH <= 1) OR (NADPH + 1 <= DHAP))))) : E (F (E (G (((1 <= E4P) AND (2 <= NADH)))))) : E (F ((2 <= _2PG))) : E (F ((((GSSG + 1 <= NADH) AND (2 <= ADP)) AND E (F ((Ru5P <= PEP)))))) : E ((E (F ((_3PG <= a1))) U (ATP <= Lac))) : (A (F (A (X ((2 <= PEP))))) OR E (((3 <= ATP) U FALSE))) : (E (G (((NADPH <= 1) AND (DHAP <= 0)))) AND NOT(A (((Pyr <= G6P) U FALSE)))) : (E (F (A (G ((2 <= c1))))) AND (G6P <= GAP)) : NOT(A (X (A (G ((a2 <= Gluc))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (((2 <= Lac) U (Lac <= a1))) OR E (X ((2 <= a2)))) AND A (X (A (G ((start <= _1_3_BPG))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= Lac) U (Lac <= a1)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((2 <= Lac) U (Lac <= a1)))
lola: processed formula length: 30
lola: 51 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((start <= _1_3_BPG)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (_1_3_BPG + 1 <= start)
lola: processed formula length: 23
lola: 50 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: 3312612 markings, 9459798 edges, 662522 markings/sec, 0 secs
lola: 6588966 markings, 19031085 edges, 655271 markings/sec, 5 secs
lola: 9466119 markings, 27960880 edges, 575431 markings/sec, 10 secs
lola: 12414332 markings, 37122985 edges, 589643 markings/sec, 15 secs
lola: 15084522 markings, 45638166 edges, 534038 markings/sec, 20 secs
lola: 17810567 markings, 54117114 edges, 545209 markings/sec, 25 secs
lola: 20666094 markings, 63040025 edges, 571105 markings/sec, 30 secs
lola: 23228647 markings, 71373413 edges, 512511 markings/sec, 35 secs
lola: 25916500 markings, 79722644 edges, 537571 markings/sec, 40 secs
lola: 28713704 markings, 88532738 edges, 559441 markings/sec, 45 secs
lola: 31264430 markings, 96824750 edges, 510145 markings/sec, 50 secs
lola: 33823936 markings, 105005787 edges, 511901 markings/sec, 55 secs
lola: 36479919 markings, 113271948 edges, 531197 markings/sec, 60 secs
lola: 38651983 markings, 121150130 edges, 434413 markings/sec, 65 secs
lola: 41382939 markings, 129449284 edges, 546191 markings/sec, 70 secs
lola: 43988977 markings, 137456542 edges, 521208 markings/sec, 75 secs
lola: 46430457 markings, 145408118 edges, 488296 markings/sec, 80 secs
lola: 49279937 markings, 153844056 edges, 569896 markings/sec, 85 secs
lola: 51772091 markings, 162026423 edges, 498431 markings/sec, 90 secs
lola: 53988557 markings, 169559861 edges, 443293 markings/sec, 95 secs
lola: 56706252 markings, 177764731 edges, 543539 markings/sec, 100 secs
lola: 59377139 markings, 185940856 edges, 534177 markings/sec, 105 secs
lola: 61843991 markings, 193882318 edges, 493370 markings/sec, 110 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is invariant from successors.
lola: 64268319 markings, 201589469 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 203 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((Ru5P + 1 <= _2PG) OR (PEP + 1 <= Gluc)))) AND E ((((NADH <= S7P) OR (2 <= b2)) U ((3 <= Pyr)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 203 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((NADH <= S7P) OR (2 <= b2)) U ((3 <= Pyr))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((NADH <= S7P) OR (2 <= b2)) U ((3 <= Pyr))))
lola: processed formula length: 50
lola: 51 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= Pyr))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 511 markings, 616 edges
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-CTLCardinality-0.sara
lola: ========================================
lola: subprocess 2 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((Ru5P + 1 <= _2PG) OR (PEP + 1 <= Gluc))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((Ru5P + 1 <= _2PG) OR (PEP + 1 <= Gluc)))
lola: processed formula length: 46
lola: 49 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((3 <= Pi))) AND E ((((Lac <= _1_3_BPG) AND (NADPH <= Lac)) U (GSSG + 1 <= GSH))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((Lac <= _1_3_BPG) AND (NADPH <= Lac)) U (GSSG + 1 <= GSH)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((Lac <= _1_3_BPG) AND (NADPH <= Lac)) U (GSSG + 1 <= GSH)))
lola: processed formula length: 64
lola: 51 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (GSSG + 1 <= GSH)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 238 markings, 506 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((2 <= PEP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX((2 <= PEP)))
lola: processed formula length: 24
lola: 50 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 45 markings, 45 edges

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((Gluc + 1 <= a2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (Gluc + 1 <= a2)
lola: processed formula length: 16
lola: 49 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: 2467533 markings, 10225571 edges, 493507 markings/sec, 0 secs
lola: 4810762 markings, 20322836 edges, 468646 markings/sec, 5 secs
lola: 7085998 markings, 30136026 edges, 455047 markings/sec, 10 secs
lola: 9366058 markings, 40069424 edges, 456012 markings/sec, 15 secs
lola: 11601467 markings, 49804494 edges, 447082 markings/sec, 20 secs
lola: 13853058 markings, 59601748 edges, 450318 markings/sec, 25 secs
lola: 16047460 markings, 69008402 edges, 438880 markings/sec, 30 secs
lola: 18143451 markings, 78054712 edges, 419198 markings/sec, 35 secs
lola: 20226763 markings, 87127400 edges, 416662 markings/sec, 40 secs
lola: 22303547 markings, 96113769 edges, 415357 markings/sec, 45 secs
lola: 24249015 markings, 105184009 edges, 389094 markings/sec, 50 secs
lola: 26215821 markings, 113997724 edges, 393361 markings/sec, 55 secs
lola: 28095912 markings, 122872484 edges, 376018 markings/sec, 60 secs
lola: 29852657 markings, 131673206 edges, 351349 markings/sec, 65 secs
lola: 31593708 markings, 140388931 edges, 348210 markings/sec, 70 secs
lola: 33286995 markings, 149157349 edges, 338657 markings/sec, 75 secs
lola: 34981440 markings, 157854895 edges, 338889 markings/sec, 80 secs
lola: 36664497 markings, 166668267 edges, 336611 markings/sec, 85 secs
lola: 38346053 markings, 175405296 edges, 336311 markings/sec, 90 secs
lola: 40015075 markings, 184211509 edges, 333804 markings/sec, 95 secs
lola: 41713879 markings, 193004400 edges, 339761 markings/sec, 100 secs
lola: 43391489 markings, 201813038 edges, 335522 markings/sec, 105 secs
lola: 45076979 markings, 210595264 edges, 337098 markings/sec, 110 secs
lola: 46784326 markings, 219482434 edges, 341469 markings/sec, 115 secs
lola: 48466929 markings, 228337600 edges, 336521 markings/sec, 120 secs
lola: 50173505 markings, 237214846 edges, 341315 markings/sec, 125 secs
lola: 51893969 markings, 246169480 edges, 344093 markings/sec, 130 secs
lola: 53604813 markings, 255079868 edges, 342169 markings/sec, 135 secs
lola: 55303863 markings, 263966210 edges, 339810 markings/sec, 140 secs
lola: 57004941 markings, 272862177 edges, 340216 markings/sec, 145 secs
lola: 58723477 markings, 281803114 edges, 343707 markings/sec, 150 secs
lola: 60456953 markings, 290791899 edges, 346695 markings/sec, 155 secs
lola: 62183986 markings, 299800019 edges, 345407 markings/sec, 160 secs
lola: 63937296 markings, 308890212 edges, 350662 markings/sec, 165 secs
lola: 65699040 markings, 318042377 edges, 352349 markings/sec, 170 secs
lola: 67493533 markings, 327317111 edges, 358899 markings/sec, 175 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is unreachable from any successor.
lola: 68816617 markings, 334026825 edges

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= _2PG)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((2 <= _2PG)))
lola: processed formula length: 19
lola: 49 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (2 <= _2PG)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= a2) AND (b2 <= DHAP))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= a2) AND (b2 <= DHAP))))
lola: processed formula length: 36
lola: 49 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= a2) AND (b2 <= DHAP))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000010-CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2442432 markings, 9051966 edges, 488486 markings/sec, 0 secs
lola: sara is running 5 secs || 4695338 markings, 18054842 edges, 450581 markings/sec, 5 secs
lola: sara is running 10 secs || 6910225 markings, 26901388 edges, 442977 markings/sec, 10 secs
lola: sara is running 15 secs || 9123620 markings, 35642154 edges, 442679 markings/sec, 15 secs
lola: sara is running 20 secs || 11306437 markings, 44348072 edges, 436563 markings/sec, 20 secs
lola: sara is running 25 secs || 13493022 markings, 53012009 edges, 437317 markings/sec, 25 secs
lola: sara is running 30 secs || 15608056 markings, 61425501 edges, 423007 markings/sec, 30 secs
lola: sara is running 35 secs || 17785259 markings, 70130082 edges, 435441 markings/sec, 35 secs
lola: sara is running 40 secs || 19992444 markings, 78817373 edges, 441437 markings/sec, 40 secs
lola: sara is running 45 secs || 22170686 markings, 87508352 edges, 435648 markings/sec, 45 secs
lola: sara is running 50 secs || 24335071 markings, 96151613 edges, 432877 markings/sec, 50 secs
lola: sara is running 55 secs || 26483650 markings, 104713673 edges, 429716 markings/sec, 55 secs
lola: sara is running 60 secs || 28669902 markings, 113389588 edges, 437250 markings/sec, 60 secs
lola: sara is running 65 secs || 30861478 markings, 122075756 edges, 438315 markings/sec, 65 secs
lola: sara is running 70 secs || 33035860 markings, 130678669 edges, 434876 markings/sec, 70 secs
lola: sara is running 75 secs || 35189306 markings, 139185175 edges, 430689 markings/sec, 75 secs
lola: sara is running 80 secs || 37359180 markings, 147773862 edges, 433975 markings/sec, 80 secs
lola: sara is running 85 secs || 39564775 markings, 156509815 edges, 441119 markings/sec, 85 secs
lola: sara is running 90 secs || 41763233 markings, 165212656 edges, 439692 markings/sec, 90 secs
lola: sara is running 95 secs || 43925404 markings, 173866174 edges, 432434 markings/sec, 95 secs
lola: sara is running 100 secs || 46087388 markings, 182498368 edges, 432397 markings/sec, 100 secs
lola: sara is running 105 secs || 48292884 markings, 191231527 edges, 441099 markings/sec, 105 secs
lola: sara is running 110 secs || 50505178 markings, 199999014 edges, 442459 markings/sec, 110 secs
lola: sara is running 115 secs || 52717757 markings, 208710520 edges, 442516 markings/sec, 115 secs
lola: sara is running 120 secs || 54924826 markings, 217388003 edges, 441414 markings/sec, 120 secs
lola: sara is running 125 secs || 57116819 markings, 226102442 edges, 438399 markings/sec, 125 secs
lola: sara is running 130 secs || 59310324 markings, 234865857 edges, 438701 markings/sec, 130 secs
lola: sara is running 135 secs || 61533634 markings, 243566473 edges, 444662 markings/sec, 135 secs
lola: sara is running 140 secs || 63990318 markings, 253333951 edges, 491337 markings/sec, 140 secs
lola: sara is running 145 secs || 66508604 markings, 263217987 edges, 503657 markings/sec, 145 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 68249661 markings, 270050551 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((NADPH <= 1) AND (DHAP <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((NADPH <= 1) AND (DHAP <= 0))))
lola: processed formula length: 38
lola: 48 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 82 markings, 119 edges

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= E4P) AND (2 <= NADH))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: ((1 <= E4P) AND (2 <= NADH))
lola: processed formula length: 28
lola: 49 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 41 markings, 41 edges
lola:
FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((_3PG <= a1))) U (ATP <= Lac)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(E(TRUE U (_3PG <= a1)) U (ATP <= Lac))
lola: processed formula length: 40
lola: 50 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 44 markings, 86 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((GSSG + 1 <= NADH) AND (2 <= ADP)) AND E (F ((Ru5P <= PEP))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (((GSSG + 1 <= NADH) AND (2 <= ADP)) AND E(TRUE U (Ru5P <= PEP))))
lola: processed formula length: 75
lola: 50 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 864 markings, 1403 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((GSH + 1 <= FBP)) R ((PEP <= 1) OR (DHAP <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A ((((GSH + 1 <= FBP)) R ((PEP <= 1) OR (DHAP <= 1))))
lola: processed formula length: 55
lola: 54 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((2 <= PEP) AND (2 <= DHAP))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000010-CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 167810 markings, 865301 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((ATP <= 1))) AND ((DHAP + 1 <= ADP) OR (S7P + 1 <= NADPplus)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((DHAP + 1 <= ADP) OR (S7P + 1 <= NADPplus))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((DHAP + 1 <= ADP) OR (S7P + 1 <= NADPplus))
lola: processed formula length: 45
lola: 48 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: processed formula with 2 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 904 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((ATP <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((ATP <= 1)))
lola: processed formula length: 18
lola: 49 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (ATP <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 41 markings, 40 edges
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 904 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((2 <= c1))))) AND (G6P <= GAP))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 904 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G6P <= GAP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (G6P <= GAP)
lola: processed formula length: 12
lola: 48 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-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: 0 markings, 0 edges
lola: ========================================
sara: try reading problem file GPPP-PT-C0100N0000000010-CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: subprocess 14 will run for 1356 seconds at most (--localtimelimit=0)
lola: ========================================

lola: ...considering subproblem: E (F (A (G ((2 <= c1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (c1 <= 1)
lola: processed formula length: 9
lola: 50 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 712 markings, 891 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((b2 <= E4P))) OR (((3 <= Ru5P) AND ((c2 <= 0) OR (a2 + 1 <= GSH))) OR ((2 <= NADPH) AND (DHAP <= NADPH))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((b2 <= E4P)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((b2 <= E4P)))
lola: processed formula length: 19
lola: 48 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 15 will run for 2712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((3 <= Ru5P) AND ((c2 <= 0) OR (a2 + 1 <= GSH))) OR ((2 <= NADPH) AND (DHAP <= NADPH)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= Ru5P) AND ((c2 <= 0) OR (a2 + 1 <= GSH))) OR ((2 <= NADPH) AND (DHAP <= NADPH)))
lola: processed formula length: 90
lola: 48 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((_2PG + 1 <= GSH) AND (_2PG + 1 <= b1)) AND A (G ((FBP + 1 <= a2)))) OR (A (G ((_2PG <= 0))) AND (a2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (a2 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a2 <= 2)
lola: processed formula length: 9
lola: 48 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-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: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((_2PG <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((_2PG <= 0)))
lola: processed formula length: 19
lola: 50 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (1 <= _2PG)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-CTLCardinality-17-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FBP + 1 <= a2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((FBP + 1 <= a2)))
lola: processed formula length: 23
lola: 50 rewrites
lola: closed formula file GPPP-PT-C0100N0000000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: (a2 <= FBP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000010-CTLCardinality-18-0.sara

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no no yes yes yes yes no no yes no
lola:
preliminary result: no no no yes yes yes no no yes yes yes yes no no yes no
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000010-CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic

lola: memory consumption: 25348 KB
lola: time consumption: 857 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000000010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is GPPP-PT-C0100N0000000010, 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 r088-blw7-152649998300304"
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 ;