Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r093-smll-155246584200265.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is MAPK-PT-00040, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246584200265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.5K Feb 11 22:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 22:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 7 23:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 7 23:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.1K Feb 5 00:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.2K Feb 5 00:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 06:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 4 06:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Jan 31 23:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Jan 31 23:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 25K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552859269235

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ MAPK-PT-00040 @ 3570 seconds

FORMULA MAPK-PT-00040-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2618
rslt: Output for CTLCardinality @ MAPK-PT-00040

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 17 21:47:49 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 244
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((ERKP_Phase3 <= 2)))",
"processed_size": 26,
"rewrites": 28
},
"result":
{
"edges": 18,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 263
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((Phase2 + 1 <= ERKP)))",
"processed_size": 28,
"rewrites": 27
},
"result":
{
"edges": 97,
"markings": 72,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 284
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((MEKP_Phase2 + 1 <= ERK)))",
"processed_size": 32,
"rewrites": 28
},
"result":
{
"edges": 288,
"markings": 200,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((2 <= Phase3) AND (2 <= Phase1))))",
"processed_size": 41,
"rewrites": 28
},
"result":
{
"edges": 115,
"markings": 88,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 341
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((MEKP_RafP + 1 <= MEK)))",
"processed_size": 30,
"rewrites": 28
},
"result":
{
"edges": 60,
"markings": 42,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 379
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= ERKP_Phase3) AND (Phase2 <= MEKP_Phase2))))",
"processed_size": 56,
"rewrites": 27
},
"result":
{
"edges": 50,
"markings": 40,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 427
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((3 <= ERKPP_Phase3) AND ((ERKP_Phase3 <= MEKPP_Phase2) OR (ERK_MEKPP <= MEKP_Phase2)) AND (1 <= MEKP_RafP))))",
"processed_size": 117,
"rewrites": 27
},
"result":
{
"edges": 43,
"markings": 33,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 488
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(Phase2 <= 2)",
"processed_size": 13,
"rewrites": 29
},
"result":
{
"edges": 84,
"markings": 67,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 569
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 569
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(Phase1 <= MEK_RafP)",
"processed_size": 20,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 683
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (((ERKPP + 1 <= Phase1) U (3 <= MEKPP_Phase2)))",
"processed_size": 49,
"rewrites": 29
},
"result":
{
"edges": 7956151,
"markings": 3255998,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 682
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 682
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= Phase1)",
"processed_size": 13,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 852
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((3 <= Phase1)))",
"processed_size": 21,
"rewrites": 28
},
"result":
{
"edges": 111,
"markings": 85,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1137
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((Phase1 <= MEK) OR ((ERK_MEKPP + 1 <= ERKP_MEKPP)))",
"processed_size": 53,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 852
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 852
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= ERK)))",
"processed_size": 18,
"rewrites": 28
},
"result":
{
"edges": 95,
"markings": 66,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1137
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1137
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((ERKPP <= 2)))",
"processed_size": 20,
"rewrites": 28
},
"result":
{
"edges": 32,
"markings": 23,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1705
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((ERK <= 0) AND (Raf <= 2) AND ((MEKP <= 2) OR (RasGTP <= 1)) AND (RafP + 1 <= MEKP))",
"processed_size": 86,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1705
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1705
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= ERKP_MEKPP)",
"processed_size": 17,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3411
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= ERKPP)))",
"processed_size": 20,
"rewrites": 27
},
"result":
{
"edges": 32,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3411
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (((1 <= ERKPP_Phase3) U ((3 <= Phase3) OR (Phase2 <= Raf_RasGTP))))",
"processed_size": 70,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20880,
"runtime": 952.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : E(F(*)) : (E((** U **)) AND E((** U **))) : (** OR (E(F(**)) OR A(G(**)))) : E(F(**)) : E(F(E(G(**)))) : A(G(**)) : E(F(**)) : A(G(*)) : A(G(E(X(**)))) : (A(G(*)) OR *) : A(G(**)) : (** AND (A(G(**)) OR **)) : (E((** U **)) AND A(G(**))) : (** OR E((** U **))) : A(G(**))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no yes unknown yes yes yes no yes no unknown no no no no yes no ",
"value": "no yes unknown yes yes yes no yes no unknown no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: (E (((MEKP_RafP + 1 <= Phase2) U (1 <= 0))) AND (Raf_RasGTP <= 2)) : NOT(A (G ((ERKP <= Phase2)))) : (E (((1 <= ERKPP_Phase3) U ((3 <= Phase3) OR (Phase2 <= Raf_RasGTP)))) AND E ((((2 <= Phase3) OR (ERKP <= RafP)) U (Phase1 <= 1)))) : ((3 <= ERKP_MEKPP) OR (E (F ((3 <= ERKPP))) OR A (G (((MEKP_RafP <= ERK_MEKPP) AND (MEK_RafP <= MEKP_Phase2)))))) : E (F (((3 <= ERKPP_Phase3) AND ((ERKP_Phase3 <= MEKPP_Phase2) OR (ERK_MEKPP <= MEKP_Phase2)) AND (1 <= MEKP_RafP)))) : E (F (E (G ((Phase2 <= 2))))) : NOT(NOT(A (G ((MEKP_Phase2 + 1 <= ERK))))) : E (((0 <= 0) U ((1 <= ERKP_Phase3) AND (Phase2 <= MEKP_Phase2)))) : NOT(A (F (E (F ((3 <= ERKP_Phase3)))))) : A (G (E (X (((MEKP_RafP <= Raf) OR (3 <= MEK)))))) : NOT((E (F ((3 <= ERKPP))) AND ((1 <= ERK) OR (3 <= Raf) OR ((3 <= MEKP) AND (2 <= RasGTP)) OR (MEKP <= RafP)))) : A (G (A (G (((2 <= Phase3) AND (2 <= Phase1)))))) : ((3 <= Phase1) AND (A (G ((3 <= Phase1))) OR ((Phase1 <= MEK) OR ((ERK_MEKPP + 1 <= ERKP_MEKPP))))) : (E (((MEKP <= 2) U (2 <= Phase1))) AND A (G (E (G ((1 <= ERK)))))) : ((Phase1 <= MEK_RafP) OR E (((ERKPP + 1 <= Phase1) U (3 <= MEKPP_Phase2)))) : A (G ((MEKP_RafP + 1 <= MEK)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:449
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 26 rewrites
lola: closed formula file CTLCardinality.xml
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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((MEKP_RafP <= Raf) OR (3 <= MEK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((MEKP_RafP <= Raf) OR (3 <= MEK))))
lola: processed formula length: 43
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
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: 2341351 markings, 5723576 edges, 468270 markings/sec, 0 secs
lola: 4674992 markings, 11421226 edges, 466728 markings/sec, 5 secs
lola: 7022756 markings, 17157132 edges, 469553 markings/sec, 10 secs
lola: 9328648 markings, 22791437 edges, 461178 markings/sec, 15 secs
lola: 11628307 markings, 28407501 edges, 459932 markings/sec, 20 secs
lola: 13826783 markings, 33780153 edges, 439695 markings/sec, 25 secs
lola: 16081890 markings, 39288361 edges, 451021 markings/sec, 30 secs
lola: 18338861 markings, 44803864 edges, 451394 markings/sec, 35 secs
lola: 20564779 markings, 50242063 edges, 445184 markings/sec, 40 secs
lola: 22806968 markings, 55726601 edges, 448438 markings/sec, 45 secs
lola: 25008911 markings, 61105042 edges, 440389 markings/sec, 50 secs
lola: 27233171 markings, 66538807 edges, 444852 markings/sec, 55 secs
lola: 29402613 markings, 71836230 edges, 433888 markings/sec, 60 secs
lola: 31617758 markings, 77250591 edges, 443029 markings/sec, 65 secs
lola: 33763066 markings, 82494369 edges, 429062 markings/sec, 70 secs
lola: 35958293 markings, 87853580 edges, 439045 markings/sec, 75 secs
lola: 38138880 markings, 93186184 edges, 436117 markings/sec, 80 secs
lola: 40318886 markings, 98515642 edges, 436001 markings/sec, 85 secs
lola: 42483603 markings, 103809679 edges, 432943 markings/sec, 90 secs
lola: 44621982 markings, 109038843 edges, 427676 markings/sec, 95 secs
lola: 46816445 markings, 114396825 edges, 438893 markings/sec, 100 secs
lola: 49013248 markings, 119770262 edges, 439361 markings/sec, 105 secs
lola: 51179882 markings, 125072016 edges, 433327 markings/sec, 110 secs
lola: 53280438 markings, 130207906 edges, 420111 markings/sec, 115 secs
lola: 55399970 markings, 135384474 edges, 423906 markings/sec, 120 secs
lola: 57554465 markings, 140648811 edges, 430899 markings/sec, 125 secs
lola: 59693517 markings, 145876097 edges, 427810 markings/sec, 130 secs
lola: 61845295 markings, 151132559 edges, 430356 markings/sec, 135 secs
lola: 63770998 markings, 155847384 edges, 385141 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKP_Phase3 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((ERKP_Phase3 <= 2)))
lola: processed formula length: 26
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 18 edges
lola: formula 0: (3 <= ERKP_Phase3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Phase2 + 1 <= ERKP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((Phase2 + 1 <= ERKP)))
lola: processed formula length: 28
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Phase2 + 1 <= ERKP)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 72 markings, 97 edges
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((MEKP_Phase2 + 1 <= ERK)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((MEKP_Phase2 + 1 <= ERK)))
lola: processed formula length: 32
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (ERK <= MEKP_Phase2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 200 markings, 288 edges
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= Phase3) AND (2 <= Phase1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= Phase3) AND (2 <= Phase1))))
lola: processed formula length: 41
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Phase3 <= 1) OR (Phase1 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 88 markings, 115 edges
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((MEKP_RafP + 1 <= MEK)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((MEKP_RafP + 1 <= MEK)))
lola: processed formula length: 30
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (MEK <= MEKP_RafP)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42 markings, 60 edges
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= ERKP_Phase3) AND (Phase2 <= MEKP_Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= ERKP_Phase3) AND (Phase2 <= MEKP_Phase2))))
lola: processed formula length: 56
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= ERKP_Phase3) AND (Phase2 <= MEKP_Phase2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 50 edges
lola: ========================================
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= ERKPP_Phase3) AND ((ERKP_Phase3 <= MEKPP_Phase2) OR (ERK_MEKPP <= MEKP_Phase2)) AND (1 <= MEKP_RafP))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= ERKPP_Phase3) AND ((ERKP_Phase3 <= MEKPP_Phase2) OR (ERK_MEKPP <= MEKP_Phase2)) AND (1 <= MEKP_RafP))))
lola: processed formula length: 117
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: ((3 <= ERKPP_Phase3) AND ((ERKP_Phase3 <= MEKPP_Phase2) OR (ERK_MEKPP <= MEKP_Phase2)) AND (1 <= MEKP_RafP))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: The predicate is reachable.
lola: 33 markings, 43 edges
lola: ========================================
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((Phase2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (Phase2 <= 2)
lola: processed formula length: 13
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= Phase2)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 67 markings, 84 edges
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (Phase2 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Phase1 <= MEK_RafP) OR E (((ERKPP + 1 <= Phase1) U (3 <= MEKPP_Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Phase1 <= MEK_RafP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Phase1 <= MEK_RafP)
lola: processed formula length: 20
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((ERKPP + 1 <= Phase1) U (3 <= MEKPP_Phase2)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((ERKPP + 1 <= Phase1) U (3 <= MEKPP_Phase2)))
lola: processed formula length: 49
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= MEKPP_Phase2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2214525 markings, 5413496 edges, 442905 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 3255998 markings, 7956151 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= Phase1) AND (A (G ((3 <= Phase1))) OR ((Phase1 <= MEK) OR ((ERK_MEKPP + 1 <= ERKP_MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Phase1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Phase1)
lola: processed formula length: 13
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Phase1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((3 <= Phase1)))
lola: processed formula length: 21
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 85 markings, 111 edges
lola: ========================================
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Phase1 <= MEK) OR ((ERK_MEKPP + 1 <= ERKP_MEKPP)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Phase1 <= MEK) OR ((ERK_MEKPP + 1 <= ERKP_MEKPP)))
lola: processed formula length: 53
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((MEKP <= 2) U (2 <= Phase1))) AND A (G ((1 <= ERK))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= ERK)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= ERK)))
lola: processed formula length: 18
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (ERK <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 66 markings, 95 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((ERKPP <= 2))) OR ((ERK <= 0) AND (Raf <= 2) AND ((MEKP <= 2) OR (RasGTP <= 1)) AND (RafP + 1 <= MEKP)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKPP <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((ERKPP <= 2)))
lola: processed formula length: 20
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= ERKPP)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 32 edges
lola: ========================================
lola: subprocess 14 will run for 1705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ERK <= 0) AND (Raf <= 2) AND ((MEKP <= 2) OR (RasGTP <= 1)) AND (RafP + 1 <= MEKP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ERK <= 0) AND (Raf <= 2) AND ((MEKP <= 2) OR (RasGTP <= 1)) AND (RafP + 1 <= MEKP))
lola: processed formula length: 86
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= ERKP_MEKPP) OR (E (F ((3 <= ERKPP))) OR A (G (((MEKP_RafP <= ERK_MEKPP) AND (MEK_RafP <= MEKP_Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= ERKP_MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ERKP_MEKPP)
lola: processed formula length: 17
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= ERKPP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= ERKPP)))
lola: processed formula length: 20
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 32 edges
lola: formula 0: (3 <= ERKPP)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((1 <= ERKPP_Phase3) U ((3 <= Phase3) OR (Phase2 <= Raf_RasGTP)))) AND E ((((2 <= Phase3) OR (ERKP <= RafP)) U (Phase1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= Phase3) OR (ERKP <= RafP)) U (Phase1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((2 <= Phase3) OR (ERKP <= RafP)) U (Phase1 <= 1)))
lola: processed formula length: 56
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Phase1 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2185509 markings, 5340218 edges, 437102 markings/sec, 0 secs
lola: sara is running 5 secs || 4361119 markings, 10656369 edges, 435122 markings/sec, 5 secs
lola: sara is running 10 secs || 6482163 markings, 15836808 edges, 424209 markings/sec, 10 secs
lola: sara is running 15 secs || 8758052 markings, 21415139 edges, 455178 markings/sec, 15 secs
lola: sara is running 20 secs || 10967713 markings, 26823965 edges, 441932 markings/sec, 20 secs
lola: sara is running 25 secs || 13127045 markings, 32098255 edges, 431866 markings/sec, 25 secs
lola: sara is running 30 secs || 15290851 markings, 37389353 edges, 432761 markings/sec, 30 secs
lola: sara is running 35 secs || 17452522 markings, 42674158 edges, 432334 markings/sec, 35 secs
lola: sara is running 40 secs || 19644928 markings, 48043478 edges, 438481 markings/sec, 40 secs
lola: sara is running 45 secs || 21828674 markings, 53400002 edges, 436749 markings/sec, 45 secs
lola: sara is running 50 secs || 23953994 markings, 58608849 edges, 425064 markings/sec, 50 secs
lola: sara is running 55 secs || 26133835 markings, 63948706 edges, 435968 markings/sec, 55 secs
lola: sara is running 60 secs || 28280886 markings, 69200955 edges, 429410 markings/sec, 60 secs
lola: sara is running 65 secs || 30405342 markings, 74395211 edges, 424891 markings/sec, 65 secs
lola: sara is running 70 secs || 32498089 markings, 79512688 edges, 418549 markings/sec, 70 secs
lola: sara is running 75 secs || 34647868 markings, 84775356 edges, 429956 markings/sec, 75 secs
lola: sara is running 80 secs || 36733194 markings, 89869231 edges, 417065 markings/sec, 80 secs
lola: sara is running 85 secs || 38798888 markings, 94913202 edges, 413139 markings/sec, 85 secs
lola: sara is running 90 secs || 40846321 markings, 99918234 edges, 409487 markings/sec, 90 secs
lola: sara is running 95 secs || 42946348 markings, 105061094 edges, 420005 markings/sec, 95 secs
lola: sara is running 100 secs || 45053204 markings, 110219933 edges, 421371 markings/sec, 100 secs
lola: sara is running 105 secs || 47143180 markings, 115328589 edges, 417995 markings/sec, 105 secs
lola: sara is running 110 secs || 49235051 markings, 120451223 edges, 418374 markings/sec, 110 secs
lola: sara is running 115 secs || 51303010 markings, 125506161 edges, 413592 markings/sec, 115 secs
lola: sara is running 120 secs || 53414799 markings, 130667667 edges, 422358 markings/sec, 120 secs
lola: sara is running 125 secs || 55478196 markings, 135717953 edges, 412679 markings/sec, 125 secs
lola: sara is running 130 secs || 57539921 markings, 140765141 edges, 412345 markings/sec, 130 secs
lola: sara is running 135 secs || 59624322 markings, 145872813 edges, 416880 markings/sec, 135 secs
lola: sara is running 140 secs || 61728076 markings, 151020126 edges, 420751 markings/sec, 140 secs
lola: sara is running 145 secs || 63853648 markings, 156230171 edges, 425114 markings/sec, 145 secs
lola: sara is running 150 secs || 65920214 markings, 161283921 edges, 413313 markings/sec, 150 secs
lola: sara is running 155 secs || 67986639 markings, 166344063 edges, 413285 markings/sec, 155 secs
lola: sara is running 160 secs || 70068397 markings, 171460285 edges, 416352 markings/sec, 160 secs
lola: sara is running 165 secs || 72081880 markings, 176390916 edges, 402697 markings/sec, 165 secs
lola: sara is running 170 secs || 74110164 markings, 181355168 edges, 405657 markings/sec, 170 secs
lola: sara is running 175 secs || 76220529 markings, 186526729 edges, 422073 markings/sec, 175 secs
lola: sara is running 180 secs || 78251537 markings, 191487626 edges, 406202 markings/sec, 180 secs
lola: sara is running 185 secs || 80305711 markings, 196502088 edges, 410835 markings/sec, 185 secs
lola: sara is running 190 secs || 82288306 markings, 201345287 edges, 396519 markings/sec, 190 secs
lola: sara is running 195 secs || 84310719 markings, 206287447 edges, 404483 markings/sec, 195 secs
lola: sara is running 200 secs || 86418063 markings, 211447905 edges, 421469 markings/sec, 200 secs
lola: sara is running 205 secs || 88451807 markings, 216433070 edges, 406749 markings/sec, 205 secs
lola: sara is running 210 secs || 90504515 markings, 221459943 edges, 410542 markings/sec, 210 secs
lola: sara is running 215 secs || 92576100 markings, 226537462 edges, 414317 markings/sec, 215 secs
lola: sara is running 220 secs || 94610291 markings, 231517948 edges, 406838 markings/sec, 220 secs
lola: sara is running 225 secs || 96672648 markings, 236566682 edges, 412471 markings/sec, 225 secs
lola: sara is running 230 secs || 98715849 markings, 241567714 edges, 408640 markings/sec, 230 secs
lola: sara is running 235 secs || 100761368 markings, 246576219 edges, 409104 markings/sec, 235 secs
lola: sara is running 240 secs || 102876415 markings, 251759238 edges, 423009 markings/sec, 240 secs
lola: sara is running 245 secs || 104918253 markings, 256764222 edges, 408368 markings/sec, 245 secs
lola: sara is running 250 secs || 107006352 markings, 261885316 edges, 417620 markings/sec, 250 secs
lola: sara is running 255 secs || 109024968 markings, 266823902 edges, 403723 markings/sec, 255 secs
lola: sara is running 260 secs || 111089780 markings, 271884782 edges, 412962 markings/sec, 260 secs
lola: sara is running 265 secs || 113067179 markings, 276722978 edges, 395480 markings/sec, 265 secs
lola: sara is running 270 secs || 115152378 markings, 281832184 edges, 417040 markings/sec, 270 secs
lola: sara is running 275 secs || 117133530 markings, 286673747 edges, 396230 markings/sec, 275 secs
lola: sara is running 280 secs || 119154047 markings, 291625193 edges, 404103 markings/sec, 280 secs
lola: sara is running 285 secs || 121200456 markings, 296633845 edges, 409282 markings/sec, 285 secs
lola: sara is running 290 secs || 123189421 markings, 301500733 edges, 397793 markings/sec, 290 secs
lola: sara is running 295 secs || 125260239 markings, 306584943 edges, 414164 markings/sec, 295 secs
lola: sara is running 300 secs || 127263321 markings, 311485763 edges, 400616 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
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: A (G (E (X (((MEKP_RafP <= Raf) OR (3 <= MEK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((MEKP_RafP <= Raf) OR (3 <= MEK))))
lola: processed formula length: 43
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
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: 2351754 markings, 5749023 edges, 470351 markings/sec, 0 secs
lola: 4662387 markings, 11390323 edges, 462127 markings/sec, 5 secs
lola: 6930533 markings, 16932040 edges, 453629 markings/sec, 10 secs
lola: 8953787 markings, 21876221 edges, 404651 markings/sec, 15 secs
lola: 11225410 markings, 27423456 edges, 454325 markings/sec, 20 secs
lola: 13516456 markings, 33021458 edges, 458209 markings/sec, 25 secs
lola: 15732903 markings, 38434875 edges, 443289 markings/sec, 30 secs
lola: 17991577 markings, 43955468 edges, 451735 markings/sec, 35 secs
lola: 20195995 markings, 49338894 edges, 440884 markings/sec, 40 secs
lola: 22446750 markings, 54845184 edges, 450151 markings/sec, 45 secs
lola: 24656689 markings, 60245673 edges, 441988 markings/sec, 50 secs
lola: 26875504 markings, 65666178 edges, 443763 markings/sec, 55 secs
lola: 29042983 markings, 70958164 edges, 433496 markings/sec, 60 secs
lola: 31244211 markings, 76337690 edges, 440246 markings/sec, 65 secs
lola: 33403599 markings, 81616803 edges, 431878 markings/sec, 70 secs
lola: 35560058 markings, 86880821 edges, 431292 markings/sec, 75 secs
lola: 37767722 markings, 92279388 edges, 441533 markings/sec, 80 secs
lola: 39935739 markings, 97580456 edges, 433603 markings/sec, 85 secs
lola: 42114992 markings, 102908387 edges, 435851 markings/sec, 90 secs
lola: 44227575 markings, 108075955 edges, 422517 markings/sec, 95 secs
lola: 46409137 markings, 113403077 edges, 436312 markings/sec, 100 secs
lola: 48611690 markings, 118786964 edges, 440511 markings/sec, 105 secs
lola: 50783821 markings, 124104040 edges, 434426 markings/sec, 110 secs
lola: 52871215 markings, 129208728 edges, 417479 markings/sec, 115 secs
lola: 54978451 markings, 134354775 edges, 421447 markings/sec, 120 secs
lola: 57142837 markings, 139642716 edges, 432877 markings/sec, 125 secs
lola: 59271408 markings, 144844834 edges, 425714 markings/sec, 130 secs
lola: 61416501 markings, 150084571 edges, 429019 markings/sec, 135 secs
lola: 63581582 markings, 155381806 edges, 433016 markings/sec, 140 secs
lola: 63730399 markings, 155747754 edges, 29763 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (((1 <= ERKPP_Phase3) U ((3 <= Phase3) OR (Phase2 <= Raf_RasGTP)))) AND E ((((2 <= Phase3) OR (ERKP <= RafP)) U (Phase1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E ((((2 <= Phase3) OR (ERKP <= RafP)) U (Phase1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((2 <= Phase3) OR (ERKP <= RafP)) U (Phase1 <= 1)))
lola: processed formula length: 56
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Phase1 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2103101 markings, 5139093 edges, 420620 markings/sec, 0 secs
lola: sara is running 5 secs || 4278815 markings, 10455495 edges, 435143 markings/sec, 5 secs
lola: sara is running 10 secs || 6395340 markings, 15624145 edges, 423305 markings/sec, 10 secs
lola: sara is running 15 secs || 8671108 markings, 21202822 edges, 455154 markings/sec, 15 secs
lola: sara is running 20 secs || 10882361 markings, 26615634 edges, 442251 markings/sec, 20 secs
lola: sara is running 25 secs || 13049615 markings, 31909062 edges, 433451 markings/sec, 25 secs
lola: sara is running 30 secs || 15208182 markings, 37187567 edges, 431713 markings/sec, 30 secs
lola: sara is running 35 secs || 17370371 markings, 42473750 edges, 432438 markings/sec, 35 secs
lola: sara is running 40 secs || 19570001 markings, 47859953 edges, 439926 markings/sec, 40 secs
lola: sara is running 45 secs || 21757464 markings, 53226057 edges, 437493 markings/sec, 45 secs
lola: sara is running 50 secs || 23885557 markings, 58440532 edges, 425619 markings/sec, 50 secs
lola: sara is running 55 secs || 26060678 markings, 63769145 edges, 435024 markings/sec, 55 secs
lola: sara is running 60 secs || 28213736 markings, 69037137 edges, 430612 markings/sec, 60 secs
lola: sara is running 65 secs || 30339098 markings, 74233547 edges, 425072 markings/sec, 65 secs
lola: sara is running 70 secs || 32432416 markings, 79352468 edges, 418664 markings/sec, 70 secs
lola: sara is running 75 secs || 34580021 markings, 84609709 edges, 429521 markings/sec, 75 secs
lola: sara is running 80 secs || 36666778 markings, 89707201 edges, 417351 markings/sec, 80 secs
lola: sara is running 85 secs || 38729358 markings, 94743838 edges, 412516 markings/sec, 85 secs
lola: sara is running 90 secs || 40776397 markings, 99746965 edges, 409408 markings/sec, 90 secs
lola: sara is running 95 secs || 42880765 markings, 104900818 edges, 420874 markings/sec, 95 secs
lola: sara is running 100 secs || 44986584 markings, 110057812 edges, 421164 markings/sec, 100 secs
lola: sara is running 105 secs || 47089736 markings, 115198121 edges, 420630 markings/sec, 105 secs
lola: sara is running 110 secs || 49175894 markings, 120306537 edges, 417232 markings/sec, 110 secs
lola: sara is running 115 secs || 51250353 markings, 125377474 edges, 414892 markings/sec, 115 secs
lola: sara is running 120 secs || 53362957 markings, 130540677 edges, 422521 markings/sec, 120 secs
lola: sara is running 125 secs || 55431932 markings, 135604957 edges, 413795 markings/sec, 125 secs
lola: sara is running 130 secs || 57492415 markings, 140649222 edges, 412097 markings/sec, 130 secs
lola: sara is running 135 secs || 59580805 markings, 145766524 edges, 417678 markings/sec, 135 secs
lola: sara is running 140 secs || 61686896 markings, 150918982 edges, 421218 markings/sec, 140 secs
lola: sara is running 145 secs || 63817385 markings, 156141149 edges, 426098 markings/sec, 145 secs
lola: sara is running 150 secs || 65884821 markings, 161197144 edges, 413487 markings/sec, 150 secs
lola: sara is running 155 secs || 67953344 markings, 166262467 edges, 413705 markings/sec, 155 secs
lola: sara is running 160 secs || 70039802 markings, 171388864 edges, 417292 markings/sec, 160 secs
lola: sara is running 165 secs || 72059117 markings, 176335274 edges, 403863 markings/sec, 165 secs
lola: sara is running 170 secs || 74090272 markings, 181306145 edges, 406231 markings/sec, 170 secs
lola: sara is running 175 secs || 76202213 markings, 186481885 edges, 422388 markings/sec, 175 secs
lola: sara is running 180 secs || 78236138 markings, 191450170 edges, 406785 markings/sec, 180 secs
lola: sara is running 185 secs || 80295846 markings, 196477907 edges, 411942 markings/sec, 185 secs
lola: sara is running 190 secs || 82278696 markings, 201321794 edges, 396570 markings/sec, 190 secs
lola: sara is running 195 secs || 84305236 markings, 206274085 edges, 405308 markings/sec, 195 secs
lola: sara is running 200 secs || 86415633 markings, 211441943 edges, 422079 markings/sec, 200 secs
lola: sara is running 205 secs || 88452078 markings, 216433705 edges, 407289 markings/sec, 205 secs
lola: sara is running 210 secs || 90509189 markings, 221471401 edges, 411422 markings/sec, 210 secs
lola: sara is running 215 secs || 92586812 markings, 226563523 edges, 415525 markings/sec, 215 secs
lola: sara is running 220 secs || 94623899 markings, 231551280 edges, 407417 markings/sec, 220 secs
lola: sara is running 225 secs || 96689639 markings, 236608456 edges, 413148 markings/sec, 225 secs
lola: sara is running 230 secs || 98733668 markings, 241611146 edges, 408806 markings/sec, 230 secs
lola: sara is running 235 secs || 100785741 markings, 246635548 edges, 410415 markings/sec, 235 secs
lola: sara is running 240 secs || 102905947 markings, 251831699 edges, 424041 markings/sec, 240 secs
lola: sara is running 245 secs || 104954282 markings, 256852409 edges, 409667 markings/sec, 245 secs
lola: sara is running 250 secs || 107051175 markings, 261994566 edges, 419379 markings/sec, 250 secs
lola: sara is running 255 secs || 109066246 markings, 266925380 edges, 403014 markings/sec, 255 secs
lola: sara is running 260 secs || 111135668 markings, 271996935 edges, 413884 markings/sec, 260 secs
lola: sara is running 265 secs || 113119205 markings, 276849982 edges, 396707 markings/sec, 265 secs
lola: sara is running 270 secs || 115203251 markings, 281956508 edges, 416809 markings/sec, 270 secs
lola: sara is running 275 secs || 117188769 markings, 286808620 edges, 397104 markings/sec, 275 secs
lola: sara is running 280 secs || 119217379 markings, 291779159 edges, 405722 markings/sec, 280 secs
lola: sara is running 285 secs || 121267189 markings, 296798064 edges, 409962 markings/sec, 285 secs
lola: sara is running 290 secs || 123262272 markings, 301680372 edges, 399017 markings/sec, 290 secs
lola: sara is running 295 secs || 125332547 markings, 306761027 edges, 414055 markings/sec, 295 secs
lola: sara is running 300 secs || 127340404 markings, 311674189 edges, 401571 markings/sec, 300 secs
lola: sara is running 305 secs || 128441684 markings, 314373036 edges, 220256 markings/sec, 305 secs
lola: sara is running 310 secs || 128441736 markings, 314373166 edges, 10 markings/sec, 310 secs
lola: sara is running 315 secs || 128441783 markings, 314373280 edges, 9 markings/sec, 315 secs
lola: sara is running 320 secs || 128441814 markings, 314373357 edges, 6 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (((1 <= ERKPP_Phase3) U ((3 <= Phase3) OR (Phase2 <= Raf_RasGTP))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((1 <= ERKPP_Phase3) U ((3 <= Phase3) OR (Phase2 <= Raf_RasGTP))))
lola: processed formula length: 70
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= Phase3) OR (Phase2 <= Raf_RasGTP))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: lola: ========================================
========================================
lola: RESULT
lola:
SUMMARY: no yes unknown yes yes yes no yes no unknown no no no no yes no
lola:
preliminary result: no yes unknown yes yes yes no yes no unknown no no no no yes no
lola: memory consumption: 20880 KB
lola: time consumption: 952 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552860221710

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPK-PT-00040"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool lola"
echo " Input is MAPK-PT-00040, 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 r093-smll-155246584200265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00040.tgz
mv MAPK-PT-00040 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;