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 212K
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 33K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Angiogenesis-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-qhx1-152646241000017
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526621154484

info: Time: 3600 - MCC
===========================================================================================
prep: translating Angiogenesis-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Angiogenesis-PT-10 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Angiogenesis-PT-10 @ 3565 seconds
lola: LoLA will run for 3565 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 103/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 54 transition conflict sets
lola: TASK
lola: reading formula from Angiogenesis-PT-10-CTLCardinality.task
lola: always true
lola: ((E (F ((Enz + 1 <= KdStarGStarP3k))) AND (AktP3 <= KdStarGStarPgStarP2)) OR NOT(A (F ((KdStarGStarPg <= KdStarGStarP3k))))) : E (((KdStarPgStarP2 <= KdStarGStarP3kStar) U A (X ((2 <= DAG))))) : (((E (F ((1 <= KdStarGStarPgP3))) OR (1 <= KdStarGStarP3kStarP3P2)) OR A (((KdStarGStarPgP3 <= Akt) U (2 <= Pip3)))) AND (KdStarGStarPgP3 <= GP3)) : A (X (E (F (((Gab1 <= KdStarGStarPgStarP3) OR (3 <= KdStarGStarP3)))))) : (A (G (((GStarPgP3 + 1 <= KdStarGStarP3kStarP3) OR (GStarPgP3 <= 1)))) OR A (G (((KdStarGP3 + 1 <= GStarP3kP3) AND (Enz + 1 <= DAGE))))) : E (F ((((GStarPgP3 <= Pip2) AND (Pip2 <= KdStarG) AND ((2 <= KdStarG) OR (Pg <= GStarP3kP3))) AND E (F ((KdStarG <= Gab1)))))) : (E ((((KdStarGStarP3 <= KdStarGStarP3kStarP2) OR (2 <= KdStarGStarP3kStar)) U (2 <= Pip3))) OR (E (G ((2 <= KdStarGStarPgStar))) OR (1 <= KdStarGStarP3k))) : (NOT((E (F ((1 <= KdStarGStarP3kStar))) AND ((P3k <= GStarP3kP3) OR (1 <= AktStar) OR (2 <= KdStarGStarPgStar) OR (1 <= PtP2)))) AND A (G (((1 <= GStarP3) OR (KdStarGStarP3kStarP2 <= KdStarGStarPgStarP2) OR (3 <= Pten) OR (3 <= Pip2))))) : ((KdStarGStarP3kP3 <= KdStarG) AND A (G (((KdStarGStarP3kStarP3P2 <= 0) OR (3 <= AktStar))))) : A (G (((KdStarGStarP3kStarP3P2 <= 2) OR (KdStarGStarP3k <= KdStarGStarPg)))) : (E (F (E (G ((3 <= GStarPgP3))))) AND (KdStarGStar <= Pg)) : NOT(E (F ((((3 <= GStarPgP3) OR (1 <= GStarPgP3)) AND ((KdStarG <= GStarP3) OR (Gab1 <= PtP3P2)))))) : A (G (A (X ((DAGE <= Gab1))))) : A (G (E (((KdStarGStarP3 <= DAGE) U (KdStarGStarP3kStar <= KdStarGStarP3))))) : (((E (X ((3 <= KdStarG))) AND ((GStarP3kP3 + 1 <= KdStarGStarPgStarP3P2) AND ((3 <= PtP3) OR (KdStarPg <= KdStarGStarP3)))) OR E (F (((GP3 <= GStarP3kP3) AND (2 <= GP3))))) OR A (F (A (G ((KdStarGStarP3kStarP2 <= AktStar)))))) : (A (X (A (G ((2 <= KdStarPgStar))))) OR E (F (((2 <= GP3) AND (1 <= KdStarGP3) AND (1 <= Pip2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((KdStarPgStarP2 <= KdStarGStarP3kStar) U A (X ((2 <= DAG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((KdStarPgStarP2 <= KdStarGStarP3kStar) U AX((2 <= DAG)))
lola: processed formula length: 58
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 450 markings, 801 edges
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((Gab1 <= KdStarGStarPgStarP3) OR (3 <= KdStarGStarP3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U ((Gab1 <= KdStarGStarPgStarP3) OR (3 <= KdStarGStarP3))))
lola: processed formula length: 70
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 175343 markings, 346258 edges
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((DAGE <= Gab1)))))
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: (Gab1 + 1 <= DAGE)
lola: processed formula length: 18
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 176 markings, 266 edges

FORMULA Angiogenesis-PT-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X ((3 <= KdStarG))) AND ((GStarP3kP3 + 1 <= KdStarGStarPgStarP3P2) AND ((3 <= PtP3) OR (KdStarPg <= KdStarGStarP3)))) OR (E (F (((GP3 <= GStarP3kP3) AND (2 <= GP3)))) OR A (F (A (G ((KdStarGStarP3kStarP2 <= AktStar)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((GP3 <= GStarP3kP3) AND (2 <= GP3))))
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 (((GP3 <= GStarP3kP3) AND (2 <= GP3))))
lola: processed formula length: 44
lola: 15 rewrites
lola: closed formula file Angiogenesis-PT-10-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: ((GP3 <= GStarP3kP3) AND (2 <= GP3))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-10-CTLCardinality-3-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((2 <= KdStarPgStar))))) OR E (F (((2 <= GP3) AND (1 <= KdStarGP3) AND (1 <= Pip2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= GP3) AND (1 <= KdStarGP3) AND (1 <= Pip2))))
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 <= GP3) AND (1 <= KdStarGP3) AND (1 <= Pip2))))
lola: processed formula length: 57
lola: 15 rewrites
lola: closed formula file Angiogenesis-PT-10-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 <= GP3) AND (1 <= KdStarGP3) AND (1 <= Pip2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-10-CTLCardinality-4-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((KdStarGStarP3kStarP3P2 <= 2) OR (KdStarGStarP3k <= KdStarGStarPg))))
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:694
lola: processed formula: A (G (((KdStarGStarP3kStarP3P2 <= 2) OR (KdStarGStarP3k <= KdStarGStarPg))))
lola: processed formula length: 77
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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:694
lola: formula 0: ((3 <= KdStarGStarP3kStarP3P2) AND (KdStarGStarPg + 1 <= KdStarGStarP3k))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1344 markings, 2067 edges

FORMULA Angiogenesis-PT-10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((GStarPgP3 <= 2) AND (GStarPgP3 <= 0)) OR ((GStarP3 + 1 <= KdStarG) AND (PtP3P2 + 1 <= Gab1)))))
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 ((((GStarPgP3 <= 2) AND (GStarPgP3 <= 0)) OR ((GStarP3 + 1 <= KdStarG) AND (PtP3P2 + 1 <= Gab1)))))
lola: processed formula length: 105
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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: (((3 <= GStarPgP3) OR (1 <= GStarPgP3)) AND ((KdStarG <= GStarP3) OR (Gab1 <= PtP3P2)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((KdStarGStarP3 <= DAGE) U (KdStarGStarP3kStar <= KdStarGStarP3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(E((KdStarGStarP3 <= DAGE) U (KdStarGStarP3kStar <= KdStarGStarP3)))))
lola: processed formula length: 86
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 789345 markings, 3498723 edges
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((GStarPgP3 <= Pip2) AND (Pip2 <= KdStarG) AND ((2 <= KdStarG) OR (Pg <= GStarP3kP3))) AND E (F ((KdStarG <= Gab1))))))
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 (((GStarPgP3 <= Pip2) AND (Pip2 <= KdStarG) AND ((2 <= KdStarG) OR (Pg <= GStarP3kP3))) AND E(TRUE U (KdStarG <= Gab1))))
lola: processed formula length: 131
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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: 1510 markings, 3094 edges

FORMULA Angiogenesis-PT-10-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((KdStarGStarP3kP3 <= KdStarG) AND A (G (((KdStarGStarP3kStarP3P2 <= 0) OR (3 <= AktStar)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (KdStarGStarP3kP3 <= KdStarG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (KdStarGStarP3kP3 <= KdStarG)
lola: processed formula length: 29
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((KdStarGStarP3kStarP3P2 <= 0) OR (3 <= AktStar))))
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:694
lola: processed formula: A (G (((KdStarGStarP3kStarP3P2 <= 0) OR (3 <= AktStar))))
lola: processed formula length: 58
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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:694
lola: formula 0: ((1 <= KdStarGStarP3kStarP3P2) AND (AktStar <= 2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-10-CTLCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((3 <= GStarPgP3))))) AND (KdStarGStar <= Pg))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (KdStarGStar <= Pg)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (KdStarGStar <= Pg)
lola: processed formula length: 19
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((3 <= GStarPgP3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (3 <= GStarPgP3)
lola: processed formula length: 16
lola: 15 rewrites
lola: closed formula file Angiogenesis-PT-10-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: 6700 markings, 11344 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: lola: ========================================
========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((Enz + 1 <= KdStarGStarP3k))) AND (AktP3 <= KdStarGStarPgStarP2)) OR E (G ((KdStarGStarP3k + 1 <= KdStarGStarPg))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AktP3 <= KdStarGStarPgStarP2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (AktP3 <= KdStarGStarPgStarP2)
lola: processed formula length: 30
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((KdStarGStarP3k + 1 <= KdStarGStarPg)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((KdStarGStarP3k + 1 <= KdStarGStarPg)))
lola: processed formula length: 45
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Enz + 1 <= KdStarGStarP3k)))
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 ((Enz + 1 <= KdStarGStarP3k)))
lola: processed formula length: 35
lola: 15 rewrites
lola: closed formula file Angiogenesis-PT-10-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: (Enz + 1 <= KdStarGStarP3k)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-10-CTLCardinality-13-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((1 <= KdStarGStarPgP3))) OR ((1 <= KdStarGStarP3kStarP3P2) OR A (((KdStarGStarPgP3 <= Akt) U (2 <= Pip3))))) AND (KdStarGStarPgP3 <= GP3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= KdStarGStarP3kStarP3P2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= KdStarGStarP3kStarP3P2)
lola: processed formula length: 29
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (KdStarGStarPgP3 <= GP3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (KdStarGStarPgP3 <= GP3)
lola: processed formula length: 24
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= KdStarGStarPgP3)))
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 <= KdStarGStarPgP3)))
lola: processed formula length: 30
lola: 15 rewrites
lola: closed formula file Angiogenesis-PT-10-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 <= KdStarGStarPgP3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-10-CTLCardinality-14-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((GStarPgP3 + 1 <= KdStarGStarP3kStarP3) OR (GStarPgP3 <= 1)))) OR A (G (((KdStarGP3 + 1 <= GStarP3kP3) AND (Enz + 1 <= DAGE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((GStarPgP3 + 1 <= KdStarGStarP3kStarP3) OR (GStarPgP3 <= 1))))
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:694
lola: processed formula: A (G (((GStarPgP3 + 1 <= KdStarGStarP3kStarP3) OR (GStarPgP3 <= 1))))
lola: processed formula length: 70
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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:694
lola: formula 0: ((KdStarGStarP3kStarP3 <= GStarPgP3) AND (2 <= GStarPgP3))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-10-CTLCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6259 markings, 10620 edges
lola: ========================================
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((KdStarGP3 + 1 <= GStarP3kP3) AND (Enz + 1 <= DAGE))))
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:694
lola: processed formula: A (G (((KdStarGP3 + 1 <= GStarP3kP3) AND (Enz + 1 <= DAGE))))
lola: processed formula length: 61
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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:694
lola: formula 0: ((GStarP3kP3 <= KdStarGP3) OR (DAGE <= Enz))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((KdStarGStarP3 <= KdStarGStarP3kStarP2) OR (2 <= KdStarGStarP3kStar)) U (2 <= Pip3))) OR (E (G ((2 <= KdStarGStarPgStar))) OR (1 <= KdStarGStarP3k)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= KdStarGStarP3k)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= KdStarGStarP3k)
lola: processed formula length: 21
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= KdStarGStarPgStar)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((2 <= KdStarGStarPgStar)))
lola: processed formula length: 32
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((KdStarGStarP3kStar <= 0))) OR ((GStarP3kP3 + 1 <= P3k) AND (AktStar <= 0) AND (KdStarGStarPgStar <= 1) AND (PtP2 <= 0))) AND A (G (((1 <= GStarP3) OR (KdStarGStarP3kStarP2 <= KdStarGStarPgStarP2) OR (3 <= Pten) OR (3 <= Pip2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= GStarP3) OR (KdStarGStarP3kStarP2 <= KdStarGStarPgStarP2) OR (3 <= Pten) OR (3 <= Pip2))))
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:694
lola: processed formula: A (G (((1 <= GStarP3) OR (KdStarGStarP3kStarP2 <= KdStarGStarPgStarP2) OR (3 <= Pten) OR (3 <= Pip2))))
lola: processed formula length: 106
lola: 16 rewrites
lola: closed formula file Angiogenesis-PT-10-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:694
lola: formula 0: ((GStarP3 <= 0) AND (KdStarGStarPgStarP2 + 1 <= KdStarGStarP3kStarP2) AND (Pten <= 2) AND (Pip2 <= 2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-15-0.sara
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-10-CTLCardinality-15-0.sara.

lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E ((((KdStarGStarP3 <= KdStarGStarP3kStarP2) OR (2 <= KdStarGStarP3kStar)) U (2 <= Pip3))) OR (E (G ((2 <= KdStarGStarPgStar))) OR (1 <= KdStarGStarP3k)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= KdStarGStarP3k)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= KdStarGStarP3k)
lola: processed formula length: 21
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= KdStarGStarPgStar)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((2 <= KdStarGStarPgStar)))
lola: processed formula length: 32
lola: 14 rewrites
lola: closed formula file Angiogenesis-PT-10-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: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((KdStarGStarP3 <= KdStarGStarP3kStarP2) OR (2 <= KdStarGStarP3kStar)) U (2 <= Pip3)))
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 ((((KdStarGStarP3 <= KdStarGStarP3kStarP2) OR (2 <= KdStarGStarP3kStar)) U (2 <= Pip3)))
lola: processed formula length: 91
lola: 17 rewrites
lola: closed formula file Angiogenesis-PT-10-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 <= Pip3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-10-CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-10-CTLCardinality-18-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 791611 markings, 1636767 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Angiogenesis-PT-10-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes no no no yes no no no yes yes
lola:
preliminary result: yes yes yes yes no yes yes no no no yes no no no yes yes
lola: memory consumption: 25792 KB
lola: time consumption: 13 seconds

BK_STOP 1526621193310

--------------------
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="Angiogenesis-PT-10"
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/Angiogenesis-PT-10.tgz
mv Angiogenesis-PT-10 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 Angiogenesis-PT-10, 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 r016-qhx1-152646241000017"
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 ;