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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169800301
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527789933901

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 CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ MAPKbis-PT-5320 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-CTLFireability.task
lola: NOT(E (F ((A (X (FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_TAK1_equals_1))) AND FIREABLE(GADD45_equals_0_to_GADD45_equals_1_when_p53_equals_1))))) : E (F ((FIREABLE(SMAD_equals_0_to_SMAD_equals_1_when_TGFBR_equals_1) AND (NOT FIREABLE(p38_equals_1_to_p38_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_MTK1_equals_0_and_TAK1_equals_0_and_TAOK_equals_0) OR NOT FIREABLE(p53_equals_1_to_p53_equals_0_when_ATM_equals_1_and_MDM2_equals_1_and_p38_equals_0)) AND NOT FIREABLE(FOS_equals_1_to_FOS_equals_0_when_CREB_equals_0_and_ELK1_equals_0)))) : (NOT((FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_0_and_MTK1_equals_1) OR E (F ((FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) AND FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_MTK1_equals_1)))))) OR (FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_p53_equals_0) OR A (F ((FIREABLE(RAS_equals_0_to_RAS_equals_1_when_SOS_equals_1) AND FIREABLE(SPRY_equals_1_to_SPRY_equals_0_when_ERK_equals_0) AND NOT FIREABLE(CREB_equals_1_to_CREB_equals_0_when_MSK_equals_0)))))) : E (F (FIREABLE(TAK1_equals_0_to_TAK1_equals_1_when_TGFBR_equals_1))) : (A (((FIREABLE(MEK1_2_equals_0_to_MEK1_2_equals_1_when_AP1_equals_0_and_MAP3K1_3_equals_1_and_PPP2CA_equals_0) AND FIREABLE(RAF_equals_1_to_RAF_equals_0_when_PKC_equals_0_and_RAS_equals_0) AND (FIREABLE(Apoptosis_equals_0_to_Apoptosis_equals_1_when_BCL2_equals_0_and_ERK_equals_0_and_FOXO3_equals_1_and_p53_equals_1) OR FIREABLE(MEK1_2_equals_0_to_MEK1_2_equals_1_when_AP1_equals_0_and_MAP3K1_3_equals_0_and_PPP2CA_equals_0_and_RAF_equals_1))) U E (F (FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_0_and_MAX_equals_1_and_MSK_equals_1))))) AND (NOT(NOT(E (F (FIREABLE(GRB2_equals_1_to_GRB2_equals_0_when_EGFR_equals_0_and_FRS2_equals_0_and_TGFBR_equals_0))))) OR (FIREABLE(PKC_equals_0_to_PKC_equals_1_when_PLCG_equals_1) OR E (F ((FIREABLE(SPRY_equals_0_to_SPRY_equals_1_when_ERK_equals_1) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_PKC_equals_1))))))) : E (G (E ((NOT FIREABLE(MEK1_2_equals_1_to_MEK1_2_equals_0_when_AP1_equals_1) U (FIREABLE(MEK1_2_equals_0_to_MEK1_2_equals_1_when_AP1_equals_0_and_MAP3K1_3_equals_1_and_PPP2CA_equals_0) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_PKC_equals_1)))))) : (NOT(E (F (FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_ERK_equals_1)))) OR (A (X (A (X (FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_TAK1_equals_1))))) AND E ((FIREABLE(p70_equals_1_to_p70_equals_0_when_PDK1_equals_0) U NOT FIREABLE(RSK_equals_0_to_RSK_equals_1_when_ERK_equals_1))))) : NOT((((E (X (FIREABLE(MTK1_equals_0_to_MTK1_equals_1_when_GADD45_equals_1))) AND (NOT FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_1_and_MSK_equals_1) AND NOT FIREABLE(ATM_equals_1_to_ATM_equals_0_when_DNA_damage_equals_0))) AND (FIREABLE(p21_equals_1_to_p21_equals_0_when_AKT_equals_1) OR FIREABLE(ATF2_equals_0_to_ATF2_equals_1_when_p38_equals_1))) OR A (X (E (F (FIREABLE(PLCG_equals_0_to_PLCG_equals_1_when_EGFR_equals_1))))))) : NOT(A (X (NOT(E (F (FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_TAOK_equals_1))))))) : E ((((FIREABLE(MDM2_equals_0_to_MDM2_equals_1_when_AKT_equals_1_and_p14_equals_0) OR FIREABLE(JUN_equals_1_to_JUN_equals_0_when_JNK_equals_0) OR NOT FIREABLE(MEK1_2_equals_1_to_MEK1_2_equals_0_when_AP1_equals_1)) OR A (X (FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_0_and_TAOK_equals_0)))) U A (X (FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_1_and_TAK1_equals_0_and_TAOK_equals_0))))) : ((E (X ((FIREABLE(MDM2_equals_0_to_MDM2_equals_1_when_AKT_equals_0_and_p14_equals_0_and_p53_equals_1) OR FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_MAP3K1_3_equals_1)))) OR (A (G (NOT FIREABLE(RAS_equals_0_to_RAS_equals_1_when_SOS_equals_1))) OR FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_0_and_TAOK_equals_1))) OR ((FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_1_and_TAK1_equals_0_and_TAOK_equals_0) AND (NOT FIREABLE(CREB_equals_1_to_CREB_equals_0_when_MSK_equals_0) OR FIREABLE(SPRY_equals_1_to_SPRY_equals_0_when_ERK_equals_0))) AND NOT(E (G (NOT FIREABLE(p21_equals_1_to_p21_equals_0_when_AKT_equals_1)))))) : (E ((FIREABLE(SOS_equals_0_to_SOS_equals_1_when_GRB2_equals_1_and_RSK_equals_0) U E (F (FIREABLE(MYC_equals_1_to_MYC_equals_0_when_AKT_equals_0_and_MAX_equals_0))))) OR E (((FIREABLE(ERK_equals_0_to_ERK_equals_1_when_MEK1_2_equals_1) OR FIREABLE(FRS2_equals_1_to_FRS2_equals_0_when_FGFR3_equals_0) OR NOT FIREABLE(AP1_equals_0_to_AP1_equals_1_when_ATF2_equals_0_and_FOS_equals_1_and_JUN_equals_1)) U FIREABLE(JUN_equals_1_to_JUN_equals_0_when_JNK_equals_0)))) : (NOT(A (((FIREABLE(p53_equals_0_to_p53_equals_1_when_ATM_equals_0_and_MDM2_equals_0_and_p38_equals_1) AND FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_1_and_TAK1_equals_1)) U NOT FIREABLE(Apoptosis_equals_0_to_Apoptosis_equals_1_when_BCL2_equals_0_and_ERK_equals_0_and_FOXO3_equals_1_and_p53_equals_1)))) OR NOT((A (G (NOT FIREABLE(PLCG_equals_1_to_PLCG_equals_0_when_EGFR_equals_0_and_FGFR3_equals_0))) OR E (G ((FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_TAOK_equals_1) AND FIREABLE(Proliferation_equals_1_to_Proliferation_equals_0_when_p21_equals_1))))))) : (A (X (E (F (FIREABLE(Growth_Arrest_equals_0_to_Growth_Arrest_equals_1_when_p21_equals_1))))) AND E (G (NOT(E (F (FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_MTK1_equals_1))))))) : NOT(NOT((FIREABLE(RSK_equals_0_to_RSK_equals_1_when_ERK_equals_1) OR E (F ((FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) OR FIREABLE(FOXO3_equals_1_to_FOXO3_equals_0_when_JNK_equals_0))))))) : (E (F ((FIREABLE(ELK1_equals_0_to_ELK1_equals_1_when_ERK_equals_1) OR E (G (FIREABLE(MSK_equals_0_to_MSK_equals_1_when_p38_equals_1)))))) OR FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_BCL2_equals_1))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:452
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:476
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X (NOT FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_TAK1_equals_1))) OR NOT FIREABLE(GADD45_equals_0_to_GADD45_equals_1_when_p53_equals_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(E(TRUE U (NOT(EX(NOT FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_TAK1_equals_1))) AND FIREABLE(GADD45_equals_0_to_GADD45_equals_1_when_p53_equals_1))))
lola: processed formula length: 173
lola: 81 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: 711669 markings, 4085425 edges, 142334 markings/sec, 0 secs
lola: 1173597 markings, 7501469 edges, 92386 markings/sec, 5 secs
lola: 1590898 markings, 10925165 edges, 83460 markings/sec, 10 secs
lola: 1984452 markings, 14137754 edges, 78711 markings/sec, 15 secs
lola: 2356643 markings, 17231692 edges, 74438 markings/sec, 20 secs
lola: 2706966 markings, 20382489 edges, 70065 markings/sec, 25 secs
lola: 3044443 markings, 23495038 edges, 67495 markings/sec, 30 secs
lola: 3340120 markings, 26668400 edges, 59135 markings/sec, 35 secs
lola: 3634852 markings, 29965905 edges, 58946 markings/sec, 40 secs
lola: 3904058 markings, 33443145 edges, 53841 markings/sec, 45 secs
lola: 4157800 markings, 37129074 edges, 50748 markings/sec, 50 secs
lola: 4186084 markings, 40004935 edges, 5657 markings/sec, 55 secs
lola: 4186123 markings, 42710747 edges, 8 markings/sec, 60 secs
lola: 4186125 markings, 45394983 edges, 0 markings/sec, 65 secs
lola: 4186125 markings, 48162253 edges, 0 markings/sec, 70 secs
lola: 4316265 markings, 51241082 edges, 26028 markings/sec, 75 secs
lola: 4823789 markings, 54539368 edges, 101505 markings/sec, 80 secs
lola: 5246543 markings, 57473201 edges, 84551 markings/sec, 85 secs
lola: 5588374 markings, 60490086 edges, 68366 markings/sec, 90 secs
lola: 5932001 markings, 63556906 edges, 68725 markings/sec, 95 secs
lola: 6295693 markings, 66514392 edges, 72738 markings/sec, 100 secs
lola: 6632493 markings, 69424220 edges, 67360 markings/sec, 105 secs
lola: 6938406 markings, 72356209 edges, 61183 markings/sec, 110 secs
lola: 7208440 markings, 75444692 edges, 54007 markings/sec, 115 secs
lola: 7462245 markings, 78579030 edges, 50761 markings/sec, 120 secs
lola: 7707289 markings, 82109079 edges, 49009 markings/sec, 125 secs
lola: 7934631 markings, 85778825 edges, 45468 markings/sec, 130 secs
lola: 8126085 markings, 89470506 edges, 38291 markings/sec, 135 secs
lola: 8126445 markings, 91619563 edges, 72 markings/sec, 140 secs
lola: 8126461 markings, 93848881 edges, 3 markings/sec, 145 secs
lola: 8126465 markings, 96046281 edges, 1 markings/sec, 150 secs
lola: 8126465 markings, 98293886 edges, 0 markings/sec, 155 secs
lola: 8126465 markings, 100581762 edges, 0 markings/sec, 160 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8126465 markings, 101580801 edges

FORMULA MAPKbis-PT-5320-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (NOT FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_ERK_equals_1))) OR (A (X (A (X (FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_TAK1_equals_1))))) AND E ((FIREABLE(p70_equals_1_to_p70_equals_0_when_PDK1_equals_0) U NOT FIREABLE(RSK_equals_0_to_RSK_equals_1_when_ERK_equals_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_ERK_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:695
lola: processed formula: A (G (NOT FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_ERK_equals_1)))
lola: processed formula length: 80
lola: 79 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_ERK_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-CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 647303 markings, 2203234 edges, 129461 markings/sec, 0 secs
lola: sara is running 5 secs || 1166564 markings, 4443905 edges, 103852 markings/sec, 5 secs
lola: sara is running 10 secs || 1588766 markings, 7246106 edges, 84440 markings/sec, 10 secs
lola: sara is running 15 secs || 1972949 markings, 9855647 edges, 76837 markings/sec, 15 secs
lola: sara is running 20 secs || 2302832 markings, 12842189 edges, 65977 markings/sec, 20 secs
lola: sara is running 25 secs || 2595459 markings, 15987819 edges, 58525 markings/sec, 25 secs
lola: sara is running 30 secs || 2615297 markings, 19670494 edges, 3968 markings/sec, 30 secs
lola: sara is running 35 secs || 2859949 markings, 22825326 edges, 48930 markings/sec, 35 secs
lola: sara is running 40 secs || 3390334 markings, 24680701 edges, 106077 markings/sec, 40 secs
lola: sara is running 45 secs || 3862988 markings, 26763992 edges, 94531 markings/sec, 45 secs
lola: sara is running 50 secs || 4250299 markings, 29080255 edges, 77462 markings/sec, 50 secs
lola: sara is running 55 secs || 4588099 markings, 31724979 edges, 67560 markings/sec, 55 secs
lola: sara is running 60 secs || 4902812 markings, 34696581 edges, 62943 markings/sec, 60 secs
lola: sara is running 65 secs || 5110537 markings, 38156963 edges, 41545 markings/sec, 65 secs
lola: sara is running 70 secs || 5111768 markings, 41509859 edges, 246 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 5111809 markings, 44439073 edges
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X (NOT FIREABLE(MTK1_equals_0_to_MTK1_equals_1_when_GADD45_equals_1))) OR ((FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_1_and_MSK_equals_1) OR FIREABLE(ATM_equals_1_to_ATM_equals_0_when_DNA_damage_equals_0)) OR (NOT FIREABLE(p21_equals_1_to_p21_equals_0_when_AKT_equals_1) AND NOT FIREABLE(ATF2_equals_0_to_ATF2_equals_1_when_p38_equals_1)))) AND E (X (A (G (NOT FIREABLE(PLCG_equals_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_1_and_MSK_equals_1) OR FIREABLE(ATM_equals_1_to_ATM_equals_0_when_DNA_damage_equals_0)) OR (NOT FIREABLE(p21_equals_1_to_p21_equals_0_when_AKT_equals_1) AND NOT FIREABLE(ATF2_equals_0_to_ATF2_equals_1_when_p38_equals_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: processed formula: ((FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_1_and_MSK_equals_1) OR FIREABLE(ATM_equals_1_to_ATM_equals_0_when_DNA_damage_equals_0)) OR (NOT FIREABLE(p21_equals_1_to_p21_equals_0_when_AKT_equals_1) AND NOT FIREABLE(ATF2_equals_0_to_ATF2_equals_1_when_p38_equals_1)))
lola: processed formula length: 278
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (NOT FIREABLE(PLCG_equals_0_to_PLCG_equals_1_when_EGFR_equals_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: EX(NOT(E(TRUE U FIREABLE(PLCG_equals_0_to_PLCG_equals_1_when_EGFR_equals_1))))
lola: processed formula length: 78
lola: 80 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: 735867 markings, 4257460 edges, 147173 markings/sec, 0 secs
lola: 1248321 markings, 8124312 edges, 102491 markings/sec, 5 secs
lola: 1707053 markings, 11893843 edges, 91746 markings/sec, 10 secs
lola: 2139784 markings, 15444084 edges, 86546 markings/sec, 15 secs
lola: 2539991 markings, 18838385 edges, 80041 markings/sec, 20 secs
lola: 2914979 markings, 22248102 edges, 74998 markings/sec, 25 secs
lola: 3250660 markings, 25684027 edges, 67136 markings/sec, 30 secs
lola: 3562043 markings, 29134966 edges, 62277 markings/sec, 35 secs
lola: 3849008 markings, 32717391 edges, 57393 markings/sec, 40 secs
lola: 4119831 markings, 36539226 edges, 54165 markings/sec, 45 secs
lola: 4186073 markings, 39755117 edges, 13248 markings/sec, 50 secs
lola: 4186121 markings, 42596571 edges, 10 markings/sec, 55 secs
lola: 4186124 markings, 45557228 edges, 1 markings/sec, 60 secs
lola: 4186124 markings, 48817167 edges, 0 markings/sec, 65 secs
lola: 4533246 markings, 52568833 edges, 69424 markings/sec, 70 secs
lola: 5084731 markings, 56261987 edges, 110297 markings/sec, 75 secs
lola: 5505788 markings, 59739905 edges, 84211 markings/sec, 80 secs
lola: 5895585 markings, 63258918 edges, 77959 markings/sec, 85 secs
lola: 6301457 markings, 66563979 edges, 81174 markings/sec, 90 secs
lola: 6678405 markings, 69845226 edges, 75390 markings/sec, 95 secs
lola: 7018128 markings, 73221522 edges, 67945 markings/sec, 100 secs
lola: 7314733 markings, 76727402 edges, 59321 markings/sec, 105 secs
lola: 7596301 markings, 80406595 edges, 56314 markings/sec, 110 secs
lola: 7860827 markings, 84575172 edges, 52905 markings/sec, 115 secs
lola: 8120249 markings, 88981258 edges, 51884 markings/sec, 120 secs
lola: 8126449 markings, 91861126 edges, 1240 markings/sec, 125 secs
lola: 8126463 markings, 94722295 edges, 3 markings/sec, 130 secs
lola: 8126464 markings, 97628450 edges, 0 markings/sec, 135 secs
lola: 8126464 markings, 100680672 edges, 0 markings/sec, 140 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8126464 markings, 101580800 edges
lola: lola: SUBRESULT
lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_TAOK_equals_1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_TAOK_equals_1)
lola: processed formula length: 98
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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 unreachable from any successor.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((FIREABLE(MDM2_equals_0_to_MDM2_equals_1_when_AKT_equals_1_and_p14_equals_0) OR FIREABLE(JUN_equals_1_to_JUN_equals_0_when_JNK_equals_0) OR NOT FIREABLE(MEK1_2_equals_1_to_MEK1_2_equals_0_when_AP1_equals_1)) OR A (X (FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_0_and_TAOK_equals_0)))) U A (X (FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(((FIREABLE(MDM2_equals_0_to_MDM2_equals_1_when_AKT_equals_1_and_p14_equals_0) OR FIREABLE(JUN_equals_1_to_JUN_equals_0_when_JNK_equals_0) OR NOT FIREABLE(MEK1_2_equals_1_to_MEK1_2_equals_0_when_AP1_equals_1)) OR AX(FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_0_and_TAOK_equals_0))) U AX(FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1_equals_1... (shortened)
lola: processed formula length: 479
lola: 80 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: 24 markings, 23 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((FIREABLE(MDM2_equals_0_to_MDM2_equals_1_when_AKT_equals_0_and_p14_equals_0_and_p53_equals_1) OR FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_MAP3K1_3_equals_1)))) OR (A (G (NOT FIREABLE(RAS_equals_0_to_RAS_equals_1_when_SOS_equals_1))) OR (FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_0_and_TAOK_equals_1) OR ((FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1_equ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_0_and_TAOK_equals_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_0_and_TAOK_equals_1)
lola: processed formula length: 76
lola: 77 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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 6 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_1_and_TAK1_equals_0_and_TAOK_equals_0) AND (NOT FIREABLE(CREB_equals_1_to_CREB_equals_0_when_MSK_equals_0) OR FIREABLE(SPRY_equals_1_to_SPRY_equals_0_when_ERK_equals_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(JNK_equals_1_to_JNK_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_1_and_TAK1_equals_0_and_TAOK_equals_0) AND (NOT FIREABLE(CREB_equals_1_to_CREB_equals_0_when_MSK_equals_0) OR FIREABLE(SPRY_equals_1_to_SPRY_equals_0_when_ERK_equals_0)))
lola: processed formula length: 268
lola: 77 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: subprocess 7 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(RAS_equals_0_to_RAS_equals_1_when_SOS_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 (NOT FIREABLE(RAS_equals_0_to_RAS_equals_1_when_SOS_equals_1)))
lola: processed formula length: 68
lola: 79 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(RAS_equals_0_to_RAS_equals_1_when_SOS_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-CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLFireability-7-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F (FIREABLE(Growth_Arrest_equals_0_to_Growth_Arrest_equals_1_when_p21_equals_1))))) AND A (G (NOT FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_MTK1_equals_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_MTK1_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:695
lola: processed formula: A (G (NOT FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_MTK1_equals_1)))
lola: processed formula length: 110
lola: 79 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_MTK1_equals_1)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 692242 markings, 2015298 edges, 138448 markings/sec, 0 secs
lola: sara is running 5 secs || 1226375 markings, 4589533 edges, 106827 markings/sec, 5 secs
lola: sara is running 10 secs || 1572804 markings, 8137918 edges, 69286 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1572961 markings, 10039521 edges
lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (FIREABLE(Growth_Arrest_equals_0_to_Growth_Arrest_equals_1_when_p21_equals_1)))))
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 FIREABLE(Growth_Arrest_equals_0_to_Growth_Arrest_equals_1_when_p21_equals_1)))
lola: processed formula length: 90
lola: 79 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: 3 markings, 2 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(TAK1_equals_0_to_TAK1_equals_1_when_TGFBR_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 (FIREABLE(TAK1_equals_0_to_TAK1_equals_1_when_TGFBR_equals_1)))
lola: processed formula length: 68
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(TAK1_equals_0_to_TAK1_equals_1_when_TGFBR_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-CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLFireability-7-0.sara.
========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges

FORMULA MAPKbis-PT-5320-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SMAD_equals_0_to_SMAD_equals_1_when_TGFBR_equals_1) AND (NOT FIREABLE(p38_equals_1_to_p38_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_MTK1_equals_0_and_TAK1_equals_0_and_TAOK_equals_0) OR NOT FIREABLE(p53_equals_1_to_p53_equals_0_when_ATM_equals_1_and_MDM2_equals_1_and_p38_equals_0)) AND NOT FIREABLE(FOS_equals_1_to_FOS_equals_0_when_CREB_equals_0_and_ELK1_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 ((FIREABLE(SMAD_equals_0_to_SMAD_equals_1_when_TGFBR_equals_1) AND (NOT FIREABLE(p38_equals_1_to_p38_equals_0_when_DUSP1_equals_1_and_MAP3K1_3_equals_1_and_MTK1_equals_0_and_TAK1_equals_0_and_TAOK_equals_0) OR NOT FIREABLE(p53_equals_1_to_p53_equals_0_when_ATM_equals_1_and_MDM2_equals_1_and_p38_equals_0)) AND NOT FIREABLE(FOS_equals_1_to_FOS_equals_0_when_CREB_equals_0_and_ELK1_equals_0))))
lola: processed formula length: 399
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((NOT FIREABLE(MEK1_2_equals_1_to_MEK1_2_equals_0_when_AP1_equals_1) U (FIREABLE(MEK1_2_equals_0_to_MEK1_2_equals_1_when_AP1_equals_0_and_MAP3K1_3_equals_1_and_PPP2CA_equals_0) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_PKC_equals_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E(NOT FIREABLE(MEK1_2_equals_1_to_MEK1_2_equals_0_when_AP1_equals_1) U (FIREABLE(MEK1_2_equals_0_to_MEK1_2_equals_1_when_AP1_equals_0_and_MAP3K1_3_equals_1_and_PPP2CA_equals_0) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_PKC_equals_1))))))
lola: processed formula length: 261
lola: 79 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: 792789 markings, 4651645 edges, 158558 markings/sec, 0 secs
lola: 1342307 markings, 8903705 edges, 109904 markings/sec, 5 secs
lola: 1826192 markings, 12858801 edges, 96777 markings/sec, 10 secs
lola: 2284366 markings, 16633962 edges, 91635 markings/sec, 15 secs
lola: 2704042 markings, 20348798 edges, 83935 markings/sec, 20 secs
lola: 3094038 markings, 24008267 edges, 77999 markings/sec, 25 secs
lola: 3433781 markings, 27728555 edges, 67949 markings/sec, 30 secs
lola: 3754855 markings, 31477154 edges, 64215 markings/sec, 35 secs
lola: 4051478 markings, 35485667 edges, 59325 markings/sec, 40 secs
lola: 4185406 markings, 39135042 edges, 26786 markings/sec, 45 secs
lola: 4186120 markings, 42185447 edges, 143 markings/sec, 50 secs
lola: 4186125 markings, 45343506 edges, 1 markings/sec, 55 secs
lola: 4186125 markings, 48540407 edges, 0 markings/sec, 60 secs
lola: 4485235 markings, 52230427 edges, 59822 markings/sec, 65 secs
lola: 5038725 markings, 55938333 edges, 110698 markings/sec, 70 secs
lola: 5472425 markings, 59444154 edges, 86740 markings/sec, 75 secs
lola: 5865479 markings, 63013146 edges, 78611 markings/sec, 80 secs
lola: 6265820 markings, 66270394 edges, 80068 markings/sec, 85 secs
lola: 6636282 markings, 69458451 edges, 74092 markings/sec, 90 secs
lola: 6965523 markings, 72642714 edges, 65848 markings/sec, 95 secs
lola: 7275489 markings, 76229308 edges, 61993 markings/sec, 100 secs
lola: 7569436 markings, 80015346 edges, 58789 markings/sec, 105 secs
lola: 7860894 markings, 84576208 edges, 58292 markings/sec, 110 secs
lola: 8125958 markings, 89258408 edges, 53013 markings/sec, 115 secs
lola: 8126452 markings, 92220452 edges, 99 markings/sec, 120 secs
lola: 8126464 markings, 95127771 edges, 2 markings/sec, 125 secs
lola: 8126465 markings, 98103503 edges, 0 markings/sec, 130 secs
lola: 8126465 markings, 101302409 edges, 0 markings/sec, 135 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-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(RSK_equals_0_to_RSK_equals_1_when_ERK_equals_1) OR E (F ((FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) OR FIREABLE(FOXO3_equals_1_to_FOXO3_equals_0_when_JNK_equals_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(RSK_equals_0_to_RSK_equals_1_when_ERK_equals_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(RSK_equals_0_to_RSK_equals_1_when_ERK_equals_1)
lola: processed formula length: 56
lola: 77 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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 11 will run for 603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) OR FIREABLE(FOXO3_equals_1_to_FOXO3_equals_0_when_JNK_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 ((FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) OR FIREABLE(FOXO3_equals_1_to_FOXO3_equals_0_when_JNK_equals_0))))
lola: processed formula length: 132
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: (FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) OR FIREABLE(FOXO3_equals_1_to_FOXO3_equals_0_when_JNK_equals_0))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(MYC_equals_1_to_MYC_equals_0_when_AKT_equals_0_and_MAX_equals_0))) OR E (((FIREABLE(ERK_equals_0_to_ERK_equals_1_when_MEK1_2_equals_1) OR FIREABLE(FRS2_equals_1_to_FRS2_equals_0_when_FGFR3_equals_0) OR NOT FIREABLE(AP1_equals_0_to_AP1_equals_1_when_ATF2_equals_0_and_FOS_equals_1_and_JUN_equals_1)) U FIREABLE(JUN_equals_1_to_JUN_equals_0_when_JNK_equals_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(MYC_equals_1_to_MYC_equals_0_when_AKT_equals_0_and_MAX_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 (FIREABLE(MYC_equals_1_to_MYC_equals_0_when_AKT_equals_0_and_MAX_equals_0)))
lola: processed formula length: 81
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLFireability-11-0.sara
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(MYC_equals_1_to_MYC_equals_0_when_AKT_equals_0_and_MAX_equals_0)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLFireability-11-0.sara.
lola: state equation: calling and running sara
lola: ========================================
lola: sara: try reading problem file MAPKbis-PT-5320-CTLFireability-11-0.sara.
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_0_and_MTK1_equals_1) AND A (G ((NOT FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) OR NOT FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_MTK1_equals_1))))) OR (FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_p53_equals_0) OR A (F ((FIREABLE(RAS_equals_0_to_RAS_equals_1_when_SOS_equals_1) AND FIREABLE(SP... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_p53_equals_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_p53_equals_0)
lola: processed formula length: 68
lola: 77 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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 13 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_0_and_MTK1_equals_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_0_and_MTK1_equals_1)
lola: processed formula length: 80
lola: 77 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 14 will run for 1509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) OR NOT FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_MTK1_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:695
lola: processed formula: A (G ((NOT FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) OR NOT FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_MTK1_equals_1))))
lola: processed formula length: 156
lola: 79 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: (FIREABLE(AKT_equals_1_to_AKT_equals_0_when_PTEN_equals_1) AND FIREABLE(JNK_equals_0_to_JNK_equals_1_when_DUSP1_equals_0_and_MTK1_equals_1))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 437985 markings, 1577725 edges, 87597 markings/sec, 0 secs

lola: sara is running 5 secs || 977624 markings, 3771857 edges, 107928 markings/sec, 5 secs
lola: sara is running 10 secs || 1432676 markings, 6354831 edges, 91010 markings/sec, 10 secs
lola: sara is running 15 secs || 1865778 markings, 8919544 edges, 86620 markings/sec, 15 secs
lola: sara is running 20 secs || 2289364 markings, 11274888 edges, 84717 markings/sec, 20 secs
lola: sara is running 25 secs || 2668910 markings, 14358479 edges, 75909 markings/sec, 25 secs
lola: sara is running 30 secs || 3043188 markings, 16977096 edges, 74856 markings/sec, 30 secs
lola: sara is running 35 secs || 3364611 markings, 20235864 edges, 64285 markings/sec, 35 secs
lola: sara is running 40 secs || 3687608 markings, 23384159 edges, 64599 markings/sec, 40 secs
lola: sara is running 45 secs || 4015921 markings, 26201860 edges, 65663 markings/sec, 45 secs
lola: sara is running 50 secs || 4142692 markings, 29973539 edges, 25354 markings/sec, 50 secs
lola: sara is running 55 secs || 4153364 markings, 33790708 edges, 2134 markings/sec, 55 secs
lola: sara is running 60 secs || 4153364 markings, 37958458 edges, 0 markings/sec, 60 secs
lola: sara is running 65 secs || 4302424 markings, 41974621 edges, 29812 markings/sec, 65 secs
lola: sara is running 70 secs || 4826572 markings, 43700239 edges, 104830 markings/sec, 70 secs
lola: sara is running 75 secs || 5258030 markings, 45862113 edges, 86292 markings/sec, 75 secs
lola: sara is running 80 secs || 5657444 markings, 48172999 edges, 79883 markings/sec, 80 secs
lola: sara is running 85 secs || 6060451 markings, 50537739 edges, 80601 markings/sec, 85 secs
lola: sara is running 90 secs || 6449904 markings, 53132598 edges, 77891 markings/sec, 90 secs
lola: sara is running 95 secs || 6812007 markings, 55966071 edges, 72421 markings/sec, 95 secs
lola: sara is running 100 secs || 7131472 markings, 58742453 edges, 63893 markings/sec, 100 secs
lola: sara is running 105 secs || 7443930 markings, 62034532 edges, 62492 markings/sec, 105 secs
lola: sara is running 110 secs || 7695569 markings, 65472465 edges, 50328 markings/sec, 110 secs
lola: sara is running 115 secs || 7965586 markings, 68859601 edges, 54003 markings/sec, 115 secs
lola: sara is running 120 secs || 8040120 markings, 72943473 edges, 14907 markings/sec, 120 secs
lola: sara is running 125 secs || 8043884 markings, 76820548 edges, 753 markings/sec, 125 secs
lola: sara is running 130 secs || 8044545 markings, 80706511 edges, 132 markings/sec, 130 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8044545 markings, 83513455 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 960 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(ELK1_equals_0_to_ELK1_equals_1_when_ERK_equals_1))) OR (E (F (E (G (FIREABLE(MSK_equals_0_to_MSK_equals_1_when_p38_equals_1))))) OR FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_BCL2_equals_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 960 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(ELK1_equals_0_to_ELK1_equals_1_when_ERK_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 (FIREABLE(ELK1_equals_0_to_ELK1_equals_1_when_ERK_equals_1)))
lola: processed formula length: 66
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(ELK1_equals_0_to_ELK1_equals_1_when_ERK_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-CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLFireability-13-0.sara.
sara: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
place or transition ordering is non-deterministic
lola: subprocess 14 will run for 1440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_BCL2_equals_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Apoptosis_equals_1_to_Apoptosis_equals_0_when_BCL2_equals_1)
lola: processed formula length: 69
lola: 77 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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 15 will run for 2881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(MSK_equals_0_to_MSK_equals_1_when_p38_equals_1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(MSK_equals_0_to_MSK_equals_1_when_p38_equals_1)
lola: processed formula length: 56
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: 375760 markings, 1563025 edges, 75152 markings/sec, 0 secs
lola: 713527 markings, 2935048 edges, 67553 markings/sec, 5 secs
lola: 1048118 markings, 4375608 edges, 66918 markings/sec, 10 secs
lola: 1367236 markings, 5970094 edges, 63824 markings/sec, 15 secs
lola: 1664817 markings, 7735776 edges, 59516 markings/sec, 20 secs
lola: 1938145 markings, 9579502 edges, 54666 markings/sec, 25 secs
lola: 2189500 markings, 11474470 edges, 50271 markings/sec, 30 secs
lola: 2435304 markings, 13312636 edges, 49161 markings/sec, 35 secs
lola: 2677833 markings, 15136631 edges, 48506 markings/sec, 40 secs
lola: 2916936 markings, 16933462 edges, 47821 markings/sec, 45 secs
lola: 3146219 markings, 18795235 edges, 45857 markings/sec, 50 secs
lola: 3362580 markings, 20657578 edges, 43272 markings/sec, 55 secs
lola: 3573926 markings, 22715101 edges, 42269 markings/sec, 60 secs
sara: warning, failure of lp_solve (at job 23308)
lola: 3795077 markings, 24804549 edges, 44230 markings/sec, 65 secs
lola: 3992264 markings, 27038476 edges, 39437 markings/sec, 70 secs
lola: 4159743 markings, 29466037 edges, 33496 markings/sec, 75 secs
lola: 4186014 markings, 31990914 edges, 5254 markings/sec, 80 secs
lola: 4186094 markings, 34548104 edges, 16 markings/sec, 85 secs
lola: 4186111 markings, 37147289 edges, 3 markings/sec, 90 secs
lola: 4186114 markings, 39758837 edges, 1 markings/sec, 95 secs
lola: 4186114 markings, 42450887 edges, 0 markings/sec, 100 secs
lola: 4245940 markings, 44942577 edges, 11965 markings/sec, 105 secs
lola: 4588047 markings, 46389264 edges, 68421 markings/sec, 110 secs
lola: 4915686 markings, 48183643 edges, 65528 markings/sec, 115 secs
lola: 5228485 markings, 49738249 edges, 62560 markings/sec, 120 secs
lola: 5514820 markings, 51750806 edges, 57267 markings/sec, 125 secs
lola: 5755324 markings, 54092318 edges, 48101 markings/sec, 130 secs
lola: 5994122 markings, 56906691 edges, 47760 markings/sec, 135 secs
lola: 6292850 markings, 58750975 edges, 59746 markings/sec, 140 secs
lola: 6577561 markings, 60521663 edges, 56942 markings/sec, 145 secs
lola: 6833393 markings, 62368768 edges, 51166 markings/sec, 150 secs
lola: 7066838 markings, 64254433 edges, 46689 markings/sec, 155 secs
lola: 7269105 markings, 65940031 edges, 40453 markings/sec, 160 secs
lola: 7451485 markings, 67682785 edges, 36476 markings/sec, 165 secs
lola: 7617060 markings, 69374979 edges, 33115 markings/sec, 170 secs
lola: 7770911 markings, 71332290 edges, 30770 markings/sec, 175 secs
lola: 7927089 markings, 73584787 edges, 31236 markings/sec, 180 secs
lola: 8062495 markings, 75910741 edges, 27081 markings/sec, 185 secs
lola: 8125353 markings, 78345717 edges, 12572 markings/sec, 190 secs
lola: 8126234 markings, 80762047 edges, 176 markings/sec, 195 secs
lola: 8126418 markings, 83193076 edges, 37 markings/sec, 200 secs
lola: 8126452 markings, 85613374 edges, 7 markings/sec, 205 secs
lola: 8126455 markings, 88119471 edges, 1 markings/sec, 210 secs
lola: 8126465 markings, 90755306 edges, 2 markings/sec, 215 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, 91194809 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.========================================

lola: ========================================

FORMULA MAPKbis-PT-5320-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_0_and_MAX_equals_1_and_MSK_equals_1))) AND (E (F (FIREABLE(GRB2_equals_1_to_GRB2_equals_0_when_EGFR_equals_0_and_FRS2_equals_0_and_TGFBR_equals_0))) OR (FIREABLE(PKC_equals_0_to_PKC_equals_1_when_PLCG_equals_1) OR E (F ((FIREABLE(SPRY_equals_0_to_SPRY_equals_1_when_ERK_equals_1) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_PKC_equals... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(GRB2_equals_1_to_GRB2_equals_0_when_EGFR_equals_0_and_FRS2_equals_0_and_TGFBR_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 (FIREABLE(GRB2_equals_1_to_GRB2_equals_0_when_EGFR_equals_0_and_FRS2_equals_0_and_TGFBR_equals_0)))
lola: processed formula length: 104
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_0_and_MAX_equals_1_and_MSK_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 (FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_0_and_MAX_equals_1_and_MSK_equals_1)))
lola: processed formula length: 98
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_0_and_MAX_equals_1_and_MSK_equals_1)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SPRY_equals_0_to_SPRY_equals_1_when_ERK_equals_1) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_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 ((FIREABLE(SPRY_equals_0_to_SPRY_equals_1_when_ERK_equals_1) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_PKC_equals_1))))
lola: processed formula length: 131
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((NOT FIREABLE(p53_equals_0_to_p53_equals_1_when_ATM_equals_0_and_MDM2_equals_0_and_p38_equals_1) OR NOT FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_1_and_TAK1_equals_1)) R FIREABLE(Apoptosis_equals_0_to_Apoptosis_equals_1_when_BCL2_equals_0_and_ERK_equals_0_and_FOXO3_equals_1_and_p53_equals_1))) OR (E (F (FIREABLE(PLCG_equals_1_to_PLCG_equa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(PLCG_equals_1_to_PLCG_equals_0_when_EGFR_equals_0_and_FGFR3_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 (FIREABLE(PLCG_equals_1_to_PLCG_equals_0_when_EGFR_equals_0_and_FGFR3_equals_0)))
lola: processed formula length: 86
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(PLCG_equals_1_to_PLCG_equals_0_when_EGFR_equals_0_and_FGFR3_equals_0)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLFireability-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
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: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_0_and_MAX_equals_1_and_MSK_equals_1))) AND (E (F (FIREABLE(GRB2_equals_1_to_GRB2_equals_0_when_EGFR_equals_0_and_FRS2_equals_0_and_TGFBR_equals_0))) OR (FIREABLE(PKC_equals_0_to_PKC_equals_1_when_PLCG_equals_1) OR E (F ((FIREABLE(SPRY_equals_0_to_SPRY_equals_1_when_ERK_equals_1) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_PKC_equals... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_0_and_MAX_equals_1_and_MSK_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 (FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_0_and_MAX_equals_1_and_MSK_equals_1)))
lola: processed formula length: 98
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT_equals_0_and_MAX_equals_1_and_MSK_equals_1)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLFireability-16-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: ...considering subproblem: FIREABLE(PKC_equals_0_to_PKC_equals_1_when_PLCG_equals_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(PKC_equals_0_to_PKC_equals_1_when_PLCG_equals_1)
lola: processed formula length: 57
lola: 77 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: ========================================
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 (F (FIREABLE(GRB2_equals_1_to_GRB2_equals_0_when_EGFR_equals_0_and_FRS2_equals_0_and_TGFBR_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 (FIREABLE(GRB2_equals_1_to_GRB2_equals_0_when_EGFR_equals_0_and_FRS2_equals_0_and_TGFBR_equals_0)))
lola: processed formula length: 104
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: FIREABLE(GRB2_equals_1_to_GRB2_equals_0_when_EGFR_equals_0_and_FRS2_equals_0_and_TGFBR_equals_0)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLFireability-18-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SPRY_equals_0_to_SPRY_equals_1_when_ERK_equals_1) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_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 ((FIREABLE(SPRY_equals_0_to_SPRY_equals_1_when_ERK_equals_1) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_PKC_equals_1))))
lola: processed formula length: 131
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: (FIREABLE(SPRY_equals_0_to_SPRY_equals_1_when_ERK_equals_1) OR FIREABLE(EGFR_equals_1_to_EGFR_equals_0_when_PKC_equals_1))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-CTLFireability-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-CTLFireability-19-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: ========================================
lola:
FORMULA MAPKbis-PT-5320-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: ========================================
lola: ...considering subproblem: (E (((NOT FIREABLE(p53_equals_0_to_p53_equals_1_when_ATM_equals_0_and_MDM2_equals_0_and_p38_equals_1) OR NOT FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_1_and_TAK1_equals_1)) R FIREABLE(Apoptosis_equals_0_to_Apoptosis_equals_1_when_BCL2_equals_0_and_ERK_equals_0_and_FOXO3_equals_1_and_p53_equals_1))) OR (E (F (FIREABLE(PLCG_equals_1_to_PLCG_equa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(PLCG_equals_1_to_PLCG_equals_0_when_EGFR_equals_0_and_FGFR3_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 (FIREABLE(PLCG_equals_1_to_PLCG_equals_0_when_EGFR_equals_0_and_FGFR3_equals_0)))
lola: processed formula length: 86
lola: 78 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(p53_equals_0_to_p53_equals_1_when_ATM_equals_0_and_MDM2_equals_0_and_p38_equals_1) OR NOT FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_1_and_TAK1_equals_1)) R FIREABLE(Apoptosis_equals_0_to_Apoptosis_equals_1_when_BCL2_equals_0_and_ERK_equals_0_and_FOXO3_equals_1_and_p53_equals_1)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((NOT FIREABLE(p53_equals_0_to_p53_equals_1_when_ATM_equals_0_and_MDM2_equals_0_and_p38_equals_1) OR NOT FIREABLE(p38_equals_0_to_p38_equals_1_when_DUSP1_equals_1_and_MAP3K1_3_equals_0_and_MTK1_equals_1_and_TAK1_equals_1)) R FIREABLE(Apoptosis_equals_0_to_Apoptosis_equals_1_when_BCL2_equals_0_and_ERK_equals_0_and_FOXO3_equals_1_and_p53_equals_1)))
lola: processed formula length: 353
lola: 79 rewrites
lola: closed formula file MAPKbis-PT-5320-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA MAPKbis-PT-5320-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes yes no yes yes yes no yes yes no
lola:
preliminary result: yes no yes no no no yes yes no yes yes yes no yes yes no
lola: ========================================
lola: ========================================
lola: memory consumption: 15064 KB
lola: time consumption: 909 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="CTLFireability"
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 CTLFireability"
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-152749169800301"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;