About the Execution of LoLA for MAPKbis-PT-5320
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3660.680 | 904744.00 | 1473263.00 | 95.20 | FFFTFTTFFFFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 4.4K May 30 21:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 30 21:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 29 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 28 09:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 28 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.3K May 28 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.7K May 27 04:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 27 04:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 5 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 166K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is MAPKbis-PT-5320, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169800300
=====================================================================
--------------------
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 MAPKbis-PT-5320-CTLCardinality-00
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-01
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-02
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-03
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-04
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-05
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-06
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-07
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-08
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-09
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-10
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-11
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-12
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-13
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-14
FORMULA_NAME MAPKbis-PT-5320-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527789926234
info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPKbis-PT-5320 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPKbis-PT-5320 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ MAPKbis-PT-5320 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 279/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3392
lola: finding significant places
lola: 106 places, 173 transitions, 49 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 343 transition conflict sets
lola: TASK
lola: reading formula from MAPKbis-PT-5320-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= JNK_equals_0)
lola: LP says that atomic proposition is always false: (2 <= FOS_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= EGFR_stimulus_equals_1)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= EGFR_stimulus_equals_0)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= AP1_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (EGFR_stimulus_equals_1 <= SOS_equals_1)
lola: after: (0 <= SOS_equals_1)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (MDM2_equals_0 <= TGFBR_stimulus_equals_0)
lola: after: (MDM2_equals_0 <= 1)
lola: LP says that atomic proposition is always true: (MDM2_equals_0 <= 1)
lola: LP says that atomic proposition is always false: (2 <= MDM2_equals_0)
lola: LP says that atomic proposition is always false: (3 <= PI3K_equals_1)
lola: LP says that atomic proposition is always false: (3 <= GADD45_equals_0)
lola: LP says that atomic proposition is always false: (2 <= MAX_equals_0)
lola: LP says that atomic proposition is always false: (3 <= TGFBR_equals_1)
lola: LP says that atomic proposition is always false: (3 <= MTK1_equals_1)
lola: LP says that atomic proposition is always false: (3 <= GADD45_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (ERK_equals_0 <= TGFBR_stimulus_equals_1)
lola: after: (ERK_equals_0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (EGFR_stimulus_equals_1 <= Apoptosis_equals_1)
lola: after: (0 <= Apoptosis_equals_1)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= GADD45_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= EGFR_stimulus_equals_1)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= PLCG_equals_1)
lola: LP says that atomic proposition is always false: (3 <= p14_equals_0)
lola: LP says that atomic proposition is always false: (3 <= FOXO3_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (FGFR3_stimulus_equals_0 <= MTK1_equals_1)
lola: after: (1 <= MTK1_equals_1)
lola: LP says that atomic proposition is always false: (2 <= JUN_equals_0)
lola: LP says that atomic proposition is always false: (3 <= GAB1_equals_1)
lola: LP says that atomic proposition is always false: (3 <= FGFR3_equals_1)
lola: place invariant simplifies atomic proposition
lola: before: (TGFBR_stimulus_equals_1 <= CREB_equals_0)
lola: after: (0 <= CREB_equals_0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (FGFR3_stimulus_equals_0 <= SMAD_equals_0)
lola: after: (1 <= SMAD_equals_0)
lola: ((E (F (())) AND A (G (((DUSP1_equals_1 <= p14_equals_0))))) OR NOT(E (X ((MEK1_2_equals_1 <= SMAD_equals_0))))) : A (G (A (F (((1 <= DUSP1_equals_0)))))) : A (G (E (F ((GRB2_equals_0 <= FOS_equals_1))))) : A (G ((() OR A (X ((1 <= SOS_equals_0)))))) : A (F (E (F (FALSE)))) : A ((() U A (G ((1 <= TAK1_equals_0))))) : (E (F (A (F ((PLCG_equals_1 <= PKC_equals_1))))) AND A (G (E (G ((GRB2_equals_1 <= MSK_equals_1)))))) : E (((((p53_equals_1 <= ELK1_equals_0))) U ((EGFR_equals_0 <= AKT_equals_1)))) : E ((E (F ((ERK_equals_0 <= 0))) U ((SMAD_equals_0 <= RAS_equals_1)))) : A (F ((() OR E (F (FALSE))))) : (E (F (((FRS2_equals_1 + 1 <= EGFR_equals_1) AND (PPP2CA_equals_0 <= p70_equals_0)))) OR A (X (FALSE))) : NOT(NOT(E (F (())))) : ((A (G (((SPRY_equals_0 <= FRS2_equals_1) OR (p70_equals_1 <= CREB_equals_0)))) AND ()) OR ((((MTK1_equals_1 + 1 <= GADD45_equals_0) AND (PDK1_equals_0 <= RSK_equals_1)) OR E (X (FALSE))) AND (1 <= ELK1_equals_1))) : E (F (E (F (FALSE)))) : A (G ((A (X ((GADD45_equals_1 <= p38_equals_1))) OR ()))) : E (F (NOT(A (F ((PI3K_equals_1 <= p38_equals_1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 52 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 52 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLCardinality.task
lola: processed formula with 0 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
FORMULA MAPKbis-PT-5320-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((SMAD_equals_0 + 1 <= MEK1_2_equals_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((SMAD_equals_0 + 1 <= MEK1_2_equals_1))
lola: processed formula length: 42
lola: 53 rewrites
lola: closed formula file MAPKbis-PT-5320-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= TAK1_equals_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:694
lola: processed formula: A (G ((1 <= TAK1_equals_0)))
lola: processed formula length: 28
lola: 54 rewrites
lola: closed formula file MAPKbis-PT-5320-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (TAK1_equals_0 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= DUSP1_equals_0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((DUSP1_equals_0 <= 0))
lola: processed formula length: 23
lola: 54 rewrites
lola: closed formula file MAPKbis-PT-5320-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: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 30 markings, 29 edges
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((GRB2_equals_0 <= FOS_equals_1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (GRB2_equals_0 <= FOS_equals_1)
lola: processed formula length: 31
lola: 53 rewrites
lola: closed formula file MAPKbis-PT-5320-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: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p38_equals_1 + 1 <= PI3K_equals_1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p38_equals_1 + 1 <= PI3K_equals_1)
lola: processed formula length: 35
lola: 53 rewrites
lola: closed formula file MAPKbis-PT-5320-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: 545585 markings, 1804902 edges, 109117 markings/sec, 0 secs
lola: 1027751 markings, 3220946 edges, 96433 markings/sec, 5 secs
lola: 1415625 markings, 5422934 edges, 77575 markings/sec, 10 secs
lola: 1711644 markings, 7885797 edges, 59204 markings/sec, 15 secs
lola: 2071249 markings, 9405141 edges, 71921 markings/sec, 20 secs
lola: 2424154 markings, 10873392 edges, 70581 markings/sec, 25 secs
lola: 2714367 markings, 12676958 edges, 58043 markings/sec, 30 secs
lola: 2983877 markings, 14935895 edges, 53902 markings/sec, 35 secs
lola: 3263240 markings, 17018155 edges, 55873 markings/sec, 40 secs
lola: 3479204 markings, 19247432 edges, 43193 markings/sec, 45 secs
lola: 3691099 markings, 21543657 edges, 42379 markings/sec, 50 secs
lola: 3920702 markings, 23602126 edges, 45921 markings/sec, 55 secs
lola: 4104822 markings, 25884186 edges, 36824 markings/sec, 60 secs
lola: 4182839 markings, 28553364 edges, 15603 markings/sec, 65 secs
lola: 4186021 markings, 31266494 edges, 636 markings/sec, 70 secs
lola: 4186114 markings, 33842613 edges, 19 markings/sec, 75 secs
lola: 4186114 markings, 36528182 edges, 0 markings/sec, 80 secs
lola: 4186114 markings, 39421085 edges, 0 markings/sec, 85 secs
lola: 4186114 markings, 42376256 edges, 0 markings/sec, 90 secs
lola: 4459889 markings, 44664026 edges, 54755 markings/sec, 95 secs
lola: 4906821 markings, 46111791 edges, 89386 markings/sec, 100 secs
lola: 5287418 markings, 47702974 edges, 76119 markings/sec, 105 secs
lola: 5633677 markings, 49568497 edges, 69252 markings/sec, 110 secs
lola: 5958354 markings, 51384391 edges, 64935 markings/sec, 115 secs
lola: 6246520 markings, 53362279 edges, 57633 markings/sec, 120 secs
lola: 6539760 markings, 55208629 edges, 58648 markings/sec, 125 secs
lola: 6818928 markings, 57127008 edges, 55834 markings/sec, 130 secs
lola: 7072153 markings, 59170407 edges, 50645 markings/sec, 135 secs
lola: 7313036 markings, 61327770 edges, 48177 markings/sec, 140 secs
lola: 7547553 markings, 63303392 edges, 46903 markings/sec, 145 secs
lola: 7781913 markings, 65498823 edges, 46872 markings/sec, 150 secs
lola: 7972769 markings, 68069269 edges, 38171 markings/sec, 155 secs
lola: 8105272 markings, 70600613 edges, 26501 markings/sec, 160 secs
lola: 8125347 markings, 73224441 edges, 4015 markings/sec, 165 secs
lola: 8126074 markings, 75888074 edges, 145 markings/sec, 170 secs
lola: 8126360 markings, 78604683 edges, 57 markings/sec, 175 secs
lola: 8126421 markings, 81267065 edges, 12 markings/sec, 180 secs
lola: 8126454 markings, 84079185 edges, 7 markings/sec, 185 secs
lola: 8126462 markings, 86883306 edges, 2 markings/sec, 190 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 8126465 markings, 89483297 edges
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((ERK_equals_0 <= 0))) U ((SMAD_equals_0 <= RAS_equals_1))))
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 (ERK_equals_0 <= 0)) U ((SMAD_equals_0 <= RAS_equals_1)))
lola: processed formula length: 68
lola: 54 rewrites
lola: closed formula file MAPKbis-PT-5320-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: 688925 markings, 3938514 edges, 137785 markings/sec, 0 secs
lola: 1186904 markings, 7614036 edges, 99596 markings/sec, 5 secs
lola: 1599375 markings, 10992675 edges, 82494 markings/sec, 10 secs
lola: 1986336 markings, 14150343 edges, 77392 markings/sec, 15 secs
lola: 2348048 markings, 17158461 edges, 72342 markings/sec, 20 secs
lola: 2682800 markings, 20157309 edges, 66950 markings/sec, 25 secs
lola: 3003327 markings, 23090657 edges, 64105 markings/sec, 30 secs
lola: 3290620 markings, 26116947 edges, 57459 markings/sec, 35 secs
lola: 3571825 markings, 29247097 edges, 56241 markings/sec, 40 secs
lola: 3834055 markings, 32518035 edges, 52446 markings/sec, 45 secs
lola: 4079762 markings, 35914244 edges, 49141 markings/sec, 50 secs
lola: 4184865 markings, 38855976 edges, 21021 markings/sec, 55 secs
lola: 4186111 markings, 41249524 edges, 249 markings/sec, 60 secs
lola: 4186124 markings, 43792190 edges, 3 markings/sec, 65 secs
lola: 4186125 markings, 46402070 edges, 0 markings/sec, 70 secs
lola: 4186125 markings, 49148915 edges, 0 markings/sec, 75 secs
lola: 4494933 markings, 52294443 edges, 61762 markings/sec, 80 secs
lola: 4959071 markings, 55404652 edges, 92828 markings/sec, 85 secs
lola: 5345536 markings, 58283267 edges, 77293 markings/sec, 90 secs
lola: 5668698 markings, 61317331 edges, 64632 markings/sec, 95 secs
lola: 6031095 markings, 64355000 edges, 72479 markings/sec, 100 secs
lola: 6399831 markings, 67400930 edges, 73747 markings/sec, 105 secs
lola: 6746732 markings, 70466436 edges, 69380 markings/sec, 110 secs
lola: 7046369 markings, 73557437 edges, 59927 markings/sec, 115 secs
lola: 7295806 markings, 76478705 edges, 49887 markings/sec, 120 secs
lola: 7534486 markings, 79512620 edges, 47736 markings/sec, 125 secs
lola: 7788592 markings, 83424906 edges, 50821 markings/sec, 130 secs
lola: 8039685 markings, 87535280 edges, 50219 markings/sec, 135 secs
lola: 8126386 markings, 90646748 edges, 17340 markings/sec, 140 secs
lola: 8126454 markings, 93067959 edges, 14 markings/sec, 145 secs
lola: 8126465 markings, 95465198 edges, 2 markings/sec, 150 secs
lola: 8126465 markings, 97890201 edges, 0 markings/sec, 155 secs
lola: 8126465 markings, 100330655 edges, 0 markings/sec, 160 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8126465 markings, 101580802 edges
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 800 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p53_equals_1 <= ELK1_equals_0))) U ((EGFR_equals_0 <= AKT_equals_1))))
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 (((((p53_equals_1 <= ELK1_equals_0))) U ((EGFR_equals_0 <= AKT_equals_1))))
lola: processed formula length: 77
lola: 55 rewrites
lola: closed formula file MAPKbis-PT-5320-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: ((EGFR_equals_0 <= AKT_equals_1))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 564657 markings, 3077736 edges, 112931 markings/sec, 0 secs
lola: sara is running 5 secs || 976661 markings, 5991222 edges, 82401 markings/sec, 5 secs
lola: sara is running 10 secs || 1363854 markings, 9049374 edges, 77439 markings/sec, 10 secs
lola: sara is running 15 secs || 1723517 markings, 12097550 edges, 71933 markings/sec, 15 secs
lola: sara is running 20 secs || 2046614 markings, 15199972 edges, 64619 markings/sec, 20 secs
lola: sara is running 25 secs || 2320829 markings, 18104146 edges, 54843 markings/sec, 25 secs
lola: sara is running 30 secs || 2589477 markings, 21183540 edges, 53730 markings/sec, 30 secs
lola: sara is running 35 secs || 2853789 markings, 24289774 edges, 52862 markings/sec, 35 secs
lola: sara is running 40 secs || 3092223 markings, 27335794 edges, 47687 markings/sec, 40 secs
lola: sara is running 45 secs || 3141324 markings, 30084843 edges, 9820 markings/sec, 45 secs
lola: sara is running 50 secs || 3141641 markings, 32564157 edges, 63 markings/sec, 50 secs
lola: sara is running 55 secs || 3141645 markings, 35153790 edges, 1 markings/sec, 55 secs
lola: sara is running 60 secs || 3337580 markings, 38048870 edges, 39187 markings/sec, 60 secs
lola: sara is running 65 secs || 3774934 markings, 40929125 edges, 87471 markings/sec, 65 secs
lola: sara is running 70 secs || 4126130 markings, 43865551 edges, 70239 markings/sec, 70 secs
lola: sara is running 75 secs || 4429139 markings, 46971995 edges, 60602 markings/sec, 75 secs
lola: sara is running 80 secs || 4751261 markings, 49719892 edges, 64424 markings/sec, 80 secs
lola: sara is running 85 secs || 5048845 markings, 52481108 edges, 59517 markings/sec, 85 secs
lola: sara is running 90 secs || 5312548 markings, 55251714 edges, 52741 markings/sec, 90 secs
lola: sara is running 95 secs || 5554303 markings, 58153998 edges, 48351 markings/sec, 95 secs
lola: sara is running 100 secs || 5785607 markings, 61266217 edges, 46261 markings/sec, 100 secs
lola: sara is running 105 secs || 5989444 markings, 64624026 edges, 40767 markings/sec, 105 secs
lola: sara is running 110 secs || 6029301 markings, 67285165 edges, 7971 markings/sec, 110 secs
lola: sara is running 115 secs || 6029313 markings, 69803022 edges, 2 markings/sec, 115 secs
lola: sara is running 120 secs || 6029313 markings, 72402708 edges, 0 markings/sec, 120 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 6029313 markings, 73203713 edges
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1025 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((FRS2_equals_1 + 1 <= EGFR_equals_1) AND (PPP2CA_equals_0 <= p70_equals_0)))) OR DEADLOCK)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1025 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 52 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLCardinality.task
lola: processed formula with 0 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 14 will run for 1538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FRS2_equals_1 + 1 <= EGFR_equals_1) AND (PPP2CA_equals_0 <= p70_equals_0))))
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 (((FRS2_equals_1 + 1 <= EGFR_equals_1) AND (PPP2CA_equals_0 <= p70_equals_0))))
lola: processed formula length: 84
lola: 53 rewrites
lola: closed formula file MAPKbis-PT-5320-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: ((FRS2_equals_1 + 1 <= EGFR_equals_1) AND (PPP2CA_equals_0 <= p70_equals_0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((SPRY_equals_0 <= FRS2_equals_1) OR (p70_equals_1 <= CREB_equals_0)))) OR (((MTK1_equals_1 + 1 <= GADD45_equals_0) AND (PDK1_equals_0 <= RSK_equals_1)) AND (1 <= ELK1_equals_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((MTK1_equals_1 + 1 <= GADD45_equals_0) AND (PDK1_equals_0 <= RSK_equals_1)) AND (1 <= ELK1_equals_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: (((MTK1_equals_1 + 1 <= GADD45_equals_0) AND (PDK1_equals_0 <= RSK_equals_1)) AND (1 <= ELK1_equals_1))
lola: processed formula length: 103
lola: 53 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLCardinality.task
lola: processed formula with 3 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 3077 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((SPRY_equals_0 <= FRS2_equals_1) OR (p70_equals_1 <= CREB_equals_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:694
lola: processed formula: A (G (((SPRY_equals_0 <= FRS2_equals_1) OR (p70_equals_1 <= CREB_equals_0))))
lola: processed formula length: 78
lola: 54 rewrites
lola: closed formula file MAPKbis-PT-5320-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: ((FRS2_equals_1 + 1 <= SPRY_equals_0) AND (CREB_equals_0 + 1 <= p70_equals_1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 675608 markings, 2128579 edges, 135122 markings/sec, 0 secs
lola: sara is running 5 secs || 1248609 markings, 3666865 edges, 114600 markings/sec, 5 secs
lola: sara is running 10 secs || 1682582 markings, 6032974 edges, 86795 markings/sec, 10 secs
lola: sara is running 15 secs || 2064081 markings, 8573716 edges, 76300 markings/sec, 15 secs
lola: sara is running 20 secs || 2491014 markings, 10896695 edges, 85387 markings/sec, 20 secs
lola: sara is running 25 secs || 2886344 markings, 14083340 edges, 79066 markings/sec, 25 secs
lola: sara is running 30 secs || 3280149 markings, 17091118 edges, 78761 markings/sec, 30 secs
lola: sara is running 35 secs || 3610698 markings, 20342320 edges, 66110 markings/sec, 35 secs
lola: sara is running 40 secs || 3930752 markings, 23776286 edges, 64011 markings/sec, 40 secs
lola: sara is running 45 secs || 4166695 markings, 27717527 edges, 47189 markings/sec, 45 secs
lola: sara is running 50 secs || 4185779 markings, 32181767 edges, 3817 markings/sec, 50 secs
lola: sara is running 55 secs || 4186111 markings, 36520685 edges, 66 markings/sec, 55 secs
lola: sara is running 60 secs || 4186114 markings, 41105202 edges, 1 markings/sec, 60 secs
lola: sara is running 65 secs || 4531793 markings, 44427502 edges, 69136 markings/sec, 65 secs
lola: sara is running 70 secs || 5110642 markings, 46387742 edges, 115770 markings/sec, 70 secs
lola: sara is running 75 secs || 5577835 markings, 48920699 edges, 93439 markings/sec, 75 secs
lola: sara is running 80 secs || 6041637 markings, 51260094 edges, 92760 markings/sec, 80 secs
lola: sara is running 85 secs || 6462323 markings, 53651464 edges, 84137 markings/sec, 85 secs
lola: sara is running 90 secs || 6859280 markings, 55904860 edges, 79391 markings/sec, 90 secs
lola: sara is running 95 secs || 7196115 markings, 58413895 edges, 67367 markings/sec, 95 secs
lola: sara is running 100 secs || 7508909 markings, 61594630 edges, 62559 markings/sec, 100 secs
lola: sara is running 105 secs || 7798401 markings, 65474253 edges, 57898 markings/sec, 105 secs
lola: sara is running 110 secs || 8063988 markings, 69663795 edges, 53117 markings/sec, 110 secs
lola: sara is running 115 secs || 8099798 markings, 73599125 edges, 7162 markings/sec, 115 secs
lola: sara is running 120 secs || 8126319 markings, 77716718 edges, 5304 markings/sec, 120 secs
lola: sara is running 125 secs || 8126464 markings, 82190026 edges, 29 markings/sec, 125 secs
lola: sara is running 130 secs || 8126465 markings, 86839906 edges, 0 markings/sec, 130 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8126465 markings, 89564425 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2939 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((PLCG_equals_1 <= PKC_equals_1))) AND A (G ((GRB2_equals_1 <= MSK_equals_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2939 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((GRB2_equals_1 <= MSK_equals_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 ((GRB2_equals_1 <= MSK_equals_1)))
lola: processed formula length: 39
lola: 54 rewrites
lola: closed formula file MAPKbis-PT-5320-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: (MSK_equals_1 + 1 <= GRB2_equals_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 728319 markings, 1975170 edges, 145664 markings/sec, 0 secs
lola: sara is running 5 secs || 1354842 markings, 3777043 edges, 125305 markings/sec, 5 secs
lola: sara is running 10 secs || 1804807 markings, 6703596 edges, 89993 markings/sec, 10 secs
lola: sara is running 15 secs || 2258632 markings, 9378480 edges, 90765 markings/sec, 15 secs
lola: sara is running 20 secs || 2654440 markings, 12183925 edges, 79162 markings/sec, 20 secs
lola: sara is running 25 secs || 3017235 markings, 15500140 edges, 72559 markings/sec, 25 secs
lola: sara is running 30 secs || 3339959 markings, 19208025 edges, 64545 markings/sec, 30 secs
lola: sara is running 35 secs || 3687029 markings, 22526572 edges, 69414 markings/sec, 35 secs
lola: sara is running 40 secs || 3991874 markings, 26238493 edges, 60969 markings/sec, 40 secs
lola: sara is running 45 secs || 4171483 markings, 30236735 edges, 35922 markings/sec, 45 secs
lola: sara is running 50 secs || 4185550 markings, 34432153 edges, 2813 markings/sec, 50 secs
lola: sara is running 55 secs || 4186114 markings, 38790777 edges, 113 markings/sec, 55 secs
lola: sara is running 60 secs || 4245121 markings, 43594104 edges, 11801 markings/sec, 60 secs
lola: sara is running 65 secs || 4863094 markings, 45333024 edges, 123595 markings/sec, 65 secs
lola: sara is running 70 secs || 5340616 markings, 47764763 edges, 95504 markings/sec, 70 secs
lola: sara is running 75 secs || 5774619 markings, 50388985 edges, 86801 markings/sec, 75 secs
lola: sara is running 80 secs || 6189111 markings, 52967676 edges, 82898 markings/sec, 80 secs
lola: sara is running 85 secs || 6610974 markings, 55161567 edges, 84373 markings/sec, 85 secs
lola: sara is running 90 secs || 7000723 markings, 57526434 edges, 77950 markings/sec, 90 secs
lola: sara is running 95 secs || 7343574 markings, 60382651 edges, 68570 markings/sec, 95 secs
lola: sara is running 100 secs || 7661474 markings, 63807180 edges, 63580 markings/sec, 100 secs
lola: sara is running 105 secs || 7935622 markings, 67895644 edges, 54830 markings/sec, 105 secs
lola: sara is running 110 secs || 8055468 markings, 72153026 edges, 23969 markings/sec, 110 secs
lola: sara is running 115 secs || 8074543 markings, 76223466 edges, 3815 markings/sec, 115 secs
lola: sara is running 120 secs || 8126465 markings, 80373457 edges, 10384 markings/sec, 120 secs
lola: sara is running 125 secs || 8126465 markings, 84580909 edges, 0 markings/sec, 125 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8126465 markings, 89239529 edges
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: lola: ========================================
========================================
lola: ...considering subproblem: (E (F ((PLCG_equals_1 <= PKC_equals_1))) AND A (G ((GRB2_equals_1 <= MSK_equals_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((GRB2_equals_1 <= MSK_equals_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 ((GRB2_equals_1 <= MSK_equals_1)))
lola: processed formula length: 39
lola: 54 rewrites
lola: closed formula file MAPKbis-PT-5320-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: (MSK_equals_1 + 1 <= GRB2_equals_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 716845 markings, 1950902 edges, 143369 markings/sec, 0 secs
lola: sara is running 5 secs || 1343506 markings, 3727229 edges, 125332 markings/sec, 5 secs
lola: sara is running 10 secs || 1817025 markings, 6801864 edges, 94704 markings/sec, 10 secs
lola: sara is running 15 secs || 2257224 markings, 9370807 edges, 88040 markings/sec, 15 secs
lola: sara is running 20 secs || 2663440 markings, 12264724 edges, 81243 markings/sec, 20 secs
lola: sara is running 25 secs || 3030852 markings, 15643122 edges, 73482 markings/sec, 25 secs
lola: sara is running 30 secs || 3348235 markings, 19289396 edges, 63477 markings/sec, 30 secs
lola: sara is running 35 secs || 3684928 markings, 22508592 edges, 67339 markings/sec, 35 secs
lola: sara is running 40 secs || 3979908 markings, 26078217 edges, 58996 markings/sec, 40 secs
lola: sara is running 45 secs || 4171387 markings, 30040407 edges, 38296 markings/sec, 45 secs
lola: sara is running 50 secs || 4185410 markings, 34082215 edges, 2805 markings/sec, 50 secs
lola: sara is running 55 secs || 4186114 markings, 38038283 edges, 141 markings/sec, 55 secs
lola: sara is running 60 secs || 4186114 markings, 42640537 edges, 0 markings/sec, 60 secs
lola: sara is running 65 secs || 4715248 markings, 44761143 edges, 105827 markings/sec, 65 secs
lola: sara is running 70 secs || 5192822 markings, 47066418 edges, 95515 markings/sec, 70 secs
lola: sara is running 75 secs || 5633888 markings, 49401879 edges, 88213 markings/sec, 75 secs
lola: sara is running 80 secs || 6030042 markings, 52083029 edges, 79231 markings/sec, 80 secs
lola: sara is running 85 secs || 6410074 markings, 54087597 edges, 76006 markings/sec, 85 secs
lola: sara is running 90 secs || 6781630 markings, 56118886 edges, 74311 markings/sec, 90 secs
lola: sara is running 95 secs || 7137040 markings, 58609898 edges, 71082 markings/sec, 95 secs
lola: sara is running 100 secs || 7459691 markings, 61471983 edges, 64530 markings/sec, 100 secs
lola: sara is running 105 secs || 7742099 markings, 64916540 edges, 56482 markings/sec, 105 secs
lola: sara is running 110 secs || 7993929 markings, 68864797 edges, 50366 markings/sec, 110 secs
lola: sara is running 115 secs || 8056647 markings, 72788065 edges, 12544 markings/sec, 115 secs
lola: sara is running 120 secs || 8089936 markings, 76815002 edges, 6658 markings/sec, 120 secs
lola: sara is running 125 secs || 8126465 markings, 80988540 edges, 7306 markings/sec, 125 secs
lola: sara is running 130 secs || 8126465 markings, 85321847 edges, 0 markings/sec, 130 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8126465 markings, 89239529 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((PLCG_equals_1 <= PKC_equals_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 ((PLCG_equals_1 <= PKC_equals_1)))
lola: processed formula length: 39
lola: 53 rewrites
lola: closed formula file MAPKbis-PT-5320-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: (PLCG_equals_1 <= PKC_equals_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLCardinality-17-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA MAPKbis-PT-5320-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes no no no no no yes no yes no
lola:
preliminary result: no no no yes no yes yes no no no no no yes no yes no
lola: memory consumption: 23208 KB
lola: time consumption: 904 seconds
BK_STOP 1527790830978
--------------------
content from stderr:
grep: GenericPropertiesVerdict.xml: No such file or directory
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="MAPKbis-PT-5320"
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/MAPKbis-PT-5320.tgz
mv MAPKbis-PT-5320 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 MAPKbis-PT-5320, 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 r280-csrt-152749169800300"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;