Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r120-csrt-158961292400007.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is MAPK-PT-00080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-csrt-158961292400007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K Apr 8 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 8 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 6 19:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 6 19:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 6 02:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 25K Mar 24 05:37 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-00080-00
FORMULA_NAME MAPK-PT-00080-01
FORMULA_NAME MAPK-PT-00080-02
FORMULA_NAME MAPK-PT-00080-03
FORMULA_NAME MAPK-PT-00080-04
FORMULA_NAME MAPK-PT-00080-05
FORMULA_NAME MAPK-PT-00080-06
FORMULA_NAME MAPK-PT-00080-07
FORMULA_NAME MAPK-PT-00080-08
FORMULA_NAME MAPK-PT-00080-09
FORMULA_NAME MAPK-PT-00080-10
FORMULA_NAME MAPK-PT-00080-11
FORMULA_NAME MAPK-PT-00080-12
FORMULA_NAME MAPK-PT-00080-13
FORMULA_NAME MAPK-PT-00080-14
FORMULA_NAME MAPK-PT-00080-15

=== Now, execution of the tool begins

BK_START 1590336260110

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-00080 @ 3570 seconds

FORMULA MAPK-PT-00080-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00080-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA MAPK-PT-00080-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00080-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA MAPK-PT-00080-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA MAPK-PT-00080-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA MAPK-PT-00080-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00080-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA MAPK-PT-00080-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00080-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00080-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2639
rslt: Output for LTLCardinality @ MAPK-PT-00080

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 24 16:04:20 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F (G ((RafP_Phase1 + 1 <= MEK_RafP))))",
"processed_size": 41,
"rewrites": 112
},
"result":
{
"edges": 23,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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 <= Raf_RasGTP)",
"processed_size": 17,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((X (F ((2 <= RafP_Phase1))) OR (G (((RafP_Phase1 <= 1) OR (ERKP <= 2))) AND X (F ((2 <= RafP_Phase1))))))",
"processed_size": 109,
"rewrites": 112
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G ((((ERKPP_Phase3 + 1 <= MEKPP_Phase2) OR (ERK_MEKPP <= 0)) OR X (G (((ERKPP_Phase3 + 1 <= MEKPP_Phase2) AND (ERK_MEKPP <= 0))))))))",
"processed_size": 140,
"rewrites": 112
},
"result":
{
"edges": 16765,
"markings": 6908,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((ERKPP <= 1)) OR (X (F ((MEKP_RafP + 1 <= Raf))) R (Raf_RasGTP + 1 <= ERKP_MEKPP))))",
"processed_size": 89,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (((Raf_RasGTP + 1 <= RafP_Phase1) AND F ((RafP_Phase1 <= Raf_RasGTP))))))",
"processed_size": 81,
"rewrites": 112
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": "(RasGTP <= ERKP)",
"processed_size": 16,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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 <= RafP_Phase1)))",
"processed_size": 40,
"rewrites": 114
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(1 <= ERKPP)",
"processed_size": 12,
"rewrites": 114
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 554
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F ((MEKPP <= ERKP))))",
"processed_size": 27,
"rewrites": 112
},
"result":
{
"edges": 674,
"markings": 471,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 778
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (((3 <= Raf_RasGTP) AND G ((Phase3 + 1 <= MEKP_Phase2)))))",
"processed_size": 63,
"rewrites": 112
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1037
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((G ((ERK + 1 <= ERKP_Phase3)) OR F ((ERKPP <= MEK))))",
"processed_size": 56,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1555
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((ERKP_MEKPP <= ERK) OR G (F ((G ((ERK + 1 <= ERKP_MEKPP)) AND (((1 <= MEKP) OR (RafP <= MEK)) R (MEKP <= 0)))))))",
"processed_size": 118,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3111
},
"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 ((Raf <= Phase2)))",
"processed_size": 23,
"rewrites": 114
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21160,
"runtime": 931.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(F(**))) : A((** OR G(F((G(*) AND (* R *)))))) : (A(G(**)) AND A(G(F(*)))) : A(F((** AND G(*)))) : (A(F(G(**))) AND A(X(G((** OR X(G(**))))))) : (** AND (A(F(**)) AND A(X(G(**))))) : A((X(F(**)) OR (G(*) AND X(F(**))))) : A(F(G((* OR X(G(*)))))) : A(G(**)) : A((* OR (X(F(*)) R *))) : A(X(X((* AND F(**))))) : A(F(**)) : A((G(*) OR G(**))) : A(F((* OR G(**)))) : (** AND (A(F((** OR X(**)))) AND A(X(X(F(**)))))) : A((G(*) OR F(**)))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no yes no no no no no no no yes no yes unknown unknown no yes ",
"value": "no yes no no no no no no no yes no yes unknown unknown no yes "
},
"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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (MEKPP <= Phase2)
lola: LP says that atomic proposition is always true: (MEKPP <= Phase2)
lola: A (G (F ((MEKPP <= ERKP)))) : A (((ERKP_MEKPP <= ERK) OR G (F (NOT(G ((F ((ERKP_MEKPP <= ERK)) OR (((MEKP <= 0) AND (MEK + 1 <= RafP)) U (1 <= MEKP))))))))) : A (G (((Raf <= Phase2) AND NOT((G ((2 <= Phase2)) AND F (((2 <= Phase2) U F (X ((0 <= RafP)))))))))) : A (F (((3 <= Raf_RasGTP) AND NOT(F ((MEKP_Phase2 <= Phase3)))))) : A (G (X (((MEK_RafP <= RafP_Phase1) U G (X ((RafP_Phase1 + 1 <= MEK_RafP))))))) : A ((((3 <= Raf_RasGTP) AND (((3 <= Raf_RasGTP) OR ((Raf_RasGTP <= 2) AND (ERKPP + 1 <= MEKPP_Phase2))) U F ((3 <= Raf_RasGTP)))) AND G (X ((MEK <= ERKP_Phase3))))) : A ((NOT(F (((2 <= RafP_Phase1) AND (3 <= ERKP)))) U F (X (F ((2 <= RafP_Phase1)))))) : A (F (X (G (X (G (NOT((((MEKPP_Phase2 <= ERKPP_Phase3) AND (1 <= ERK_MEKPP)) AND F (X (((MEKPP_Phase2 <= ERKPP_Phase3) OR (1 <= ERK_MEKPP)))))))))))) : A (G (((MEKP_Phase2 + 1 <= RafP_Phase1) OR NOT((((0 <= ERK_MEKPP) OR F ((MEKP_RafP <= ERK))) OR X ((1 <= MEK_RafP))))))) : A (NOT((((2 <= ERKPP)) AND (G (X ((Raf <= MEKP_RafP))) U (ERKP_MEKPP <= Raf_RasGTP))))) : A (X (NOT((X ((RafP_Phase1 <= Raf_RasGTP)) OR NOT(X (F ((RafP_Phase1 <= Raf_RasGTP)))))))) : A ((NOT(G (X (G (NOT(((MEKPP <= ERKPP_Phase3) OR G ((0 <= ERKP_MEKPP)))))))) AND F ((ERKPP <= 0)))) : A ((NOT(F ((Raf <= MEKP_RafP))) OR ((0 <= ERKP) AND G ((Raf <= MEKP_RafP))))) : A (NOT((G (((3 <= Phase2) AND NOT(G (((MEK <= Raf)))))) OR G (F (NOT(F ((MEKPP <= Phase2)))))))) : A ((((RasGTP <= ERKP) AND F (((ERKP <= ERKPP) OR X ((ERKP <= ERKPP))))) AND X (X (F ((ERKP <= ERKPP)))))) : A ((NOT(F ((ERKP_Phase3 <= ERK))) OR F (((ERKP_Phase3 <= ERK) U (ERKPP <= MEK)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((RafP_Phase1 + 1 <= MEK_RafP)))) AND A (X (G (((MEK_RafP <= RafP_Phase1) OR X (G ((RafP_Phase1 + 1 <= MEK_RafP))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((RafP_Phase1 + 1 <= MEK_RafP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((RafP_Phase1 + 1 <= MEK_RafP))))
lola: processed formula length: 41
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 1
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= Raf_RasGTP) AND (A (F ((3 <= Raf_RasGTP))) AND A (X (G ((MEK <= ERKP_Phase3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Raf_RasGTP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Raf_RasGTP)
lola: processed formula length: 17
lola: 112 rewrites
lola: closed formula file LTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((2 <= RafP_Phase1))) OR (G (((RafP_Phase1 <= 1) OR (ERKP <= 2))) AND X (F ((2 <= RafP_Phase1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((2 <= RafP_Phase1))) OR (G (((RafP_Phase1 <= 1) OR (ERKP <= 2))) AND X (F ((2 <= RafP_Phase1))))))
lola: processed formula length: 109
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((((ERKPP_Phase3 + 1 <= MEKPP_Phase2) OR (ERK_MEKPP <= 0)) OR X (G (((ERKPP_Phase3 + 1 <= MEKPP_Phase2) AND (ERK_MEKPP <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((((ERKPP_Phase3 + 1 <= MEKPP_Phase2) OR (ERK_MEKPP <= 0)) OR X (G (((ERKPP_Phase3 + 1 <= MEKPP_Phase2) AND (ERK_MEKPP <= 0))))))))
lola: processed formula length: 140
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6908 markings, 16765 edges
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((ERKPP <= 1)) OR (X (F ((MEKP_RafP + 1 <= Raf))) R (Raf_RasGTP + 1 <= ERKP_MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((ERKPP <= 1)) OR (X (F ((MEKP_RafP + 1 <= Raf))) R (Raf_RasGTP + 1 <= ERKP_MEKPP))))
lola: processed formula length: 89
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((Raf_RasGTP + 1 <= RafP_Phase1) AND F ((RafP_Phase1 <= Raf_RasGTP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((Raf_RasGTP + 1 <= RafP_Phase1) AND F ((RafP_Phase1 <= Raf_RasGTP))))))
lola: processed formula length: 81
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((RasGTP <= ERKP) AND (A (F (((ERKP <= ERKPP) OR X ((ERKP <= ERKPP))))) AND A (X (X (F ((ERKP <= ERKPP)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (RasGTP <= ERKP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (RasGTP <= ERKP)
lola: processed formula length: 16
lola: 112 rewrites
lola: closed formula file LTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((MEKP_Phase2 + 1 <= RafP_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 ((MEKP_Phase2 + 1 <= RafP_Phase1)))
lola: processed formula length: 40
lola: 114 rewrites
lola: closed formula file LTLCardinality.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: (RafP_Phase1 <= 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: state equation: write sara problem file to LTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((ERKPP <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (1 <= ERKPP)
lola: processed formula length: 12
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((MEKP_RafP + 1 <= Raf)) OR G ((Raf <= MEKP_RafP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((MEKP_RafP + 1 <= Raf)) OR G ((Raf <= MEKP_RafP))))
lola: processed formula length: 58
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2475074 markings, 5142430 edges, 495015 markings/sec, 0 secs
lola: 4779042 markings, 9994126 edges, 460794 markings/sec, 5 secs
lola: 6918913 markings, 14509605 edges, 427974 markings/sec, 10 secs
lola: 9057816 markings, 19025248 edges, 427781 markings/sec, 15 secs
lola: 11292553 markings, 23761190 edges, 446947 markings/sec, 20 secs
lola: 13378555 markings, 28173526 edges, 417200 markings/sec, 25 secs
lola: 15452079 markings, 32559972 edges, 414705 markings/sec, 30 secs
lola: 17541311 markings, 36972866 edges, 417846 markings/sec, 35 secs
lola: 19559093 markings, 41261744 edges, 403556 markings/sec, 40 secs
lola: 21597525 markings, 45573522 edges, 407686 markings/sec, 45 secs
lola: 23742356 markings, 50117240 edges, 428966 markings/sec, 50 secs
lola: 25880166 markings, 54651629 edges, 427562 markings/sec, 55 secs
lola: 27987772 markings, 59130412 edges, 421521 markings/sec, 60 secs
lola: 30078963 markings, 63575922 edges, 418238 markings/sec, 65 secs
lola: 32177758 markings, 68025533 edges, 419759 markings/sec, 70 secs
lola: 34189967 markings, 72309585 edges, 402442 markings/sec, 75 secs
lola: 36351124 markings, 76887574 edges, 432231 markings/sec, 80 secs
lola: 38293885 markings, 81018898 edges, 388552 markings/sec, 85 secs
lola: 40311097 markings, 85297771 edges, 403442 markings/sec, 90 secs
lola: 42307703 markings, 89538592 edges, 399321 markings/sec, 95 secs
lola: 44252436 markings, 93677638 edges, 388947 markings/sec, 100 secs
lola: 46207237 markings, 97825842 edges, 390960 markings/sec, 105 secs
lola: 48286651 markings, 102252665 edges, 415883 markings/sec, 110 secs
lola: 50399928 markings, 106743338 edges, 422655 markings/sec, 115 secs
lola: 52507768 markings, 111232118 edges, 421568 markings/sec, 120 secs
lola: 54586683 markings, 115661154 edges, 415783 markings/sec, 125 secs
lola: 56703884 markings, 120160617 edges, 423440 markings/sec, 130 secs
lola: 58782851 markings, 124596238 edges, 415793 markings/sec, 135 secs
lola: 60899979 markings, 129087613 edges, 423426 markings/sec, 140 secs
lola: 62921665 markings, 133388872 edges, 404337 markings/sec, 145 secs
lola: 64839567 markings, 137465594 edges, 383580 markings/sec, 150 secs
lola: 66730107 markings, 141505162 edges, 378108 markings/sec, 155 secs
lola: 68622155 markings, 145538019 edges, 378410 markings/sec, 160 secs
lola: 70508358 markings, 149554160 edges, 377241 markings/sec, 165 secs
lola: 72541186 markings, 153867681 edges, 406566 markings/sec, 170 secs
lola: 74553639 markings, 158158574 edges, 402491 markings/sec, 175 secs
lola: 76555480 markings, 162425647 edges, 400368 markings/sec, 180 secs
lola: 78582010 markings, 166735823 edges, 405306 markings/sec, 185 secs
lola: 80567087 markings, 170954334 edges, 397015 markings/sec, 190 secs
lola: 82465344 markings, 175002867 edges, 379651 markings/sec, 195 secs
lola: 84357835 markings, 179033733 edges, 378498 markings/sec, 200 secs
lola: 86216122 markings, 182994455 edges, 371657 markings/sec, 205 secs
lola: 88071565 markings, 186946608 edges, 371089 markings/sec, 210 secs
lola: 89951101 markings, 190946040 edges, 375907 markings/sec, 215 secs
lola: 91853635 markings, 194989374 edges, 380507 markings/sec, 220 secs
lola: 93757124 markings, 199036887 edges, 380698 markings/sec, 225 secs
lola: 95578778 markings, 202922330 edges, 364331 markings/sec, 230 secs
lola: 95763813 markings, 203315074 edges, 37007 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((MEKPP <= ERKP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((MEKPP <= ERKP))))
lola: processed formula length: 27
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 471 markings, 674 edges
lola: ========================================
lola: subprocess 11 will run for 664 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((Phase2 <= 2) OR G (((MEK <= Raf))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((Phase2 <= 2) OR G (((MEK <= Raf))))))
lola: processed formula length: 45
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2583089 markings, 5700574 edges, 516618 markings/sec, 0 secs
lola: 4898100 markings, 10779305 edges, 463002 markings/sec, 5 secs
lola: 7336648 markings, 15772804 edges, 487710 markings/sec, 10 secs
lola: 9756502 markings, 20809605 edges, 483971 markings/sec, 15 secs
lola: 12025313 markings, 25557448 edges, 453762 markings/sec, 20 secs
lola: 14283221 markings, 30267776 edges, 451582 markings/sec, 25 secs
lola: 16561022 markings, 35029461 edges, 455560 markings/sec, 30 secs
lola: 18917602 markings, 39893468 edges, 471316 markings/sec, 35 secs
lola: 21339732 markings, 44887889 edges, 484426 markings/sec, 40 secs
lola: 23660520 markings, 49745926 edges, 464158 markings/sec, 45 secs
lola: 25998640 markings, 54562886 edges, 467624 markings/sec, 50 secs
lola: 28385791 markings, 59525725 edges, 477430 markings/sec, 55 secs
lola: 30683839 markings, 64269708 edges, 459610 markings/sec, 60 secs
lola: 32995988 markings, 69087290 edges, 462430 markings/sec, 65 secs
lola: 35265037 markings, 73790229 edges, 453810 markings/sec, 70 secs
lola: 37492201 markings, 78434338 edges, 445433 markings/sec, 75 secs
lola: 39745644 markings, 83079391 edges, 450689 markings/sec, 80 secs
lola: 41840164 markings, 87430006 edges, 418904 markings/sec, 85 secs
lola: 43950889 markings, 91822400 edges, 422145 markings/sec, 90 secs
lola: 46001787 markings, 96088527 edges, 410180 markings/sec, 95 secs
lola: 48122626 markings, 100493212 edges, 424168 markings/sec, 100 secs
lola: 50219002 markings, 104839286 edges, 419275 markings/sec, 105 secs
lola: 52254047 markings, 109073319 edges, 407009 markings/sec, 110 secs
lola: 54350264 markings, 113426501 edges, 419243 markings/sec, 115 secs
lola: 56432445 markings, 117777744 edges, 416436 markings/sec, 120 secs
lola: 58464532 markings, 122031320 edges, 406417 markings/sec, 125 secs
lola: 60506828 markings, 126266093 edges, 408459 markings/sec, 130 secs
lola: 62592975 markings, 130646757 edges, 417229 markings/sec, 135 secs
lola: 64769990 markings, 135154414 edges, 435403 markings/sec, 140 secs
lola: 66823997 markings, 139440964 edges, 410801 markings/sec, 145 secs
lola: 68874209 markings, 143696288 edges, 410042 markings/sec, 150 secs
lola: 70868153 markings, 147881086 edges, 398789 markings/sec, 155 secs
lola: 72872667 markings, 152043889 edges, 400903 markings/sec, 160 secs
lola: 74977385 markings, 156476227 edges, 420944 markings/sec, 165 secs
lola: 77087562 markings, 160895569 edges, 422035 markings/sec, 170 secs
lola: 79223825 markings, 165338671 edges, 427253 markings/sec, 175 secs
lola: 81381056 markings, 169810303 edges, 431446 markings/sec, 180 secs
lola: 83561305 markings, 174280381 edges, 436050 markings/sec, 185 secs
lola: 85700311 markings, 178762767 edges, 427801 markings/sec, 190 secs
lola: 87782333 markings, 183159027 edges, 416404 markings/sec, 195 secs
lola: 89937066 markings, 187707303 edges, 430947 markings/sec, 200 secs
lola: 90951058 markings, 189873009 edges, 202798 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= Raf_RasGTP) AND G ((Phase3 + 1 <= MEKP_Phase2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((3 <= Raf_RasGTP) AND G ((Phase3 + 1 <= MEKP_Phase2)))))
lola: processed formula length: 63
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1037 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((ERK + 1 <= ERKP_Phase3)) OR F ((ERKPP <= MEK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((ERK + 1 <= ERKP_Phase3)) OR F ((ERKPP <= MEK))))
lola: processed formula length: 56
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((ERKP_MEKPP <= ERK) OR G (F ((G ((ERK + 1 <= ERKP_MEKPP)) AND (((1 <= MEKP) OR (RafP <= MEK)) R (MEKP <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((ERKP_MEKPP <= ERK) OR G (F ((G ((ERK + 1 <= ERKP_MEKPP)) AND (((1 <= MEKP) OR (RafP <= MEK)) R (MEKP <= 0)))))))
lola: processed formula length: 118
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((Raf <= Phase2))) AND A (G (F ((Phase2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Raf <= Phase2)))
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 ((Raf <= Phase2)))
lola: processed formula length: 23
lola: 114 rewrites
lola: closed formula file LTLCardinality.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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((G ((MEKP_RafP + 1 <= Raf)) OR G ((Raf <= MEKP_RafP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((MEKP_RafP + 1 <= Raf)) OR G ((Raf <= MEKP_RafP))))
lola: processed formula length: 58
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2502363 markings, 5200730 edges, 500473 markings/sec, 0 secs
lola: 4838781 markings, 10120756 edges, 467284 markings/sec, 5 secs
lola: 7131793 markings, 14959573 edges, 458602 markings/sec, 10 secs
lola: 9401843 markings, 19751744 edges, 454010 markings/sec, 15 secs
lola: 11616496 markings, 24441663 edges, 442931 markings/sec, 20 secs
lola: 13824198 markings, 29113130 edges, 441540 markings/sec, 25 secs
lola: 16031758 markings, 33779036 edges, 441512 markings/sec, 30 secs
lola: 18189528 markings, 38349865 edges, 431554 markings/sec, 35 secs
lola: 20326164 markings, 42886137 edges, 427327 markings/sec, 40 secs
lola: 22485565 markings, 47459243 edges, 431880 markings/sec, 45 secs
lola: 24501889 markings, 51733171 edges, 403265 markings/sec, 50 secs
lola: 26508868 markings, 55990344 edges, 401396 markings/sec, 55 secs
lola: 28491942 markings, 60201737 edges, 396615 markings/sec, 60 secs
lola: 30618788 markings, 64716290 edges, 425369 markings/sec, 65 secs
lola: 32735618 markings, 69207960 edges, 423366 markings/sec, 70 secs
lola: 34814544 markings, 73632664 edges, 415785 markings/sec, 75 secs
lola: 36932448 markings, 78121190 edges, 423581 markings/sec, 80 secs
lola: 39008795 markings, 82533579 edges, 415269 markings/sec, 85 secs
lola: 41108301 markings, 86991563 edges, 419901 markings/sec, 90 secs
lola: 43202426 markings, 91442803 edges, 418825 markings/sec, 95 secs
lola: 45299841 markings, 95896375 edges, 419483 markings/sec, 100 secs
lola: 47349161 markings, 100263590 edges, 409864 markings/sec, 105 secs
lola: 49436396 markings, 104693348 edges, 417447 markings/sec, 110 secs
lola: 51387568 markings, 108848431 edges, 390234 markings/sec, 115 secs
lola: 53294592 markings, 112908543 edges, 381405 markings/sec, 120 secs
lola: 55228333 markings, 117025706 edges, 386748 markings/sec, 125 secs
lola: 57185301 markings, 121187507 edges, 391394 markings/sec, 130 secs
lola: 59074582 markings, 125215094 edges, 377856 markings/sec, 135 secs
lola: 61016711 markings, 129341020 edges, 388426 markings/sec, 140 secs
lola: 63079509 markings, 133719473 edges, 412560 markings/sec, 145 secs
lola: 65108627 markings, 138038112 edges, 405824 markings/sec, 150 secs
lola: 67111235 markings, 142321856 edges, 400522 markings/sec, 155 secs
lola: 69116970 markings, 146594392 edges, 401147 markings/sec, 160 secs
lola: 71160232 markings, 150935036 edges, 408652 markings/sec, 165 secs
lola: 73193375 markings, 155260386 edges, 406629 markings/sec, 170 secs
lola: 75213656 markings, 159560770 edges, 404056 markings/sec, 175 secs
lola: 77208445 markings, 163809929 edges, 398958 markings/sec, 180 secs
lola: 79225774 markings, 168105203 edges, 403466 markings/sec, 185 secs
lola: 81241934 markings, 172393844 edges, 403232 markings/sec, 190 secs
lola: 83287988 markings, 176750158 edges, 409211 markings/sec, 195 secs
lola: 85310925 markings, 181059592 edges, 404587 markings/sec, 200 secs
lola: 87310305 markings, 185328005 edges, 399876 markings/sec, 205 secs
lola: 89288452 markings, 189540089 edges, 395629 markings/sec, 210 secs
lola: 91257245 markings, 193725341 edges, 393759 markings/sec, 215 secs
lola: 93315461 markings, 198092175 edges, 411643 markings/sec, 220 secs
lola: 95313020 markings, 202355232 edges, 399512 markings/sec, 225 secs
lola: 95772507 markings, 203333820 edges, 91897 markings/sec, 230 secs
lola: 95795015 markings, 203382273 edges, 4502 markings/sec, 235 secs
lola: 95795038 markings, 203382324 edges, 5 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (((Phase2 <= 2) OR G (((MEK <= Raf))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((Phase2 <= 2) OR G (((MEK <= Raf))))))
lola: processed formula length: 45
lola: 112 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2501978 markings, 5533569 edges, 500396 markings/sec, 0 secs
lola: 4872941 markings, 10717819 edges, 474193 markings/sec, 5 secs
lola: 7180772 markings, 15452320 edges, 461566 markings/sec, 10 secs
lola: 9520517 markings, 20319193 edges, 467949 markings/sec, 15 secs
lola: 11954946 markings, 25408756 edges, 486886 markings/sec, 20 secs
lola: 14325824 markings, 30363366 edges, 474176 markings/sec, 25 secs
lola: 16486413 markings, 34874673 edges, 432118 markings/sec, 30 secs
lola: 18611429 markings, 39265043 edges, 425003 markings/sec, 35 secs
lola: 20840715 markings, 43839331 edges, 445857 markings/sec, 40 secs
lola: 22997068 markings, 48322808 edges, 431271 markings/sec, 45 secs
lola: 25125411 markings, 52758121 edges, 425669 markings/sec, 50 secs
lola: 27264820 markings, 57183725 edges, 427882 markings/sec, 55 secs
lola: 29489621 markings, 61802997 edges, 444960 markings/sec, 60 secs
lola: 31853604 markings, 66661045 edges, 472797 markings/sec, 65 secs
lola: 34096924 markings, 71386878 edges, 448664 markings/sec, 70 secs
lola: 36384039 markings, 76142799 edges, 457423 markings/sec, 75 secs
lola: 38621164 markings, 80802031 edges, 447425 markings/sec, 80 secs
lola: 40828022 markings, 85285723 edges, 441372 markings/sec, 85 secs
lola: 42857648 markings, 89549314 edges, 405925 markings/sec, 90 secs
lola: 44979116 markings, 93944285 edges, 424294 markings/sec, 95 secs
lola: 47149771 markings, 98466789 edges, 434131 markings/sec, 100 secs
lola: 49384984 markings, 103112064 edges, 447043 markings/sec, 105 secs
lola: 51649412 markings, 107799313 edges, 452886 markings/sec, 110 secs
lola: 53824526 markings, 112333557 edges, 435023 markings/sec, 115 secs
lola: 55960612 markings, 116807286 edges, 427217 markings/sec, 120 secs
lola: 58018294 markings, 121092904 edges, 411536 markings/sec, 125 secs
lola: 60028579 markings, 125275981 edges, 402057 markings/sec, 130 secs
lola: 62018005 markings, 129453927 edges, 397885 markings/sec, 135 secs
lola: 64066186 markings, 133717834 edges, 409636 markings/sec, 140 secs
lola: 66180922 markings, 138080510 edges, 422947 markings/sec, 145 secs
lola: 68201190 markings, 142282403 edges, 404054 markings/sec, 150 secs
lola: 70177881 markings, 146438717 edges, 395338 markings/sec, 155 secs
lola: 72234963 markings, 150715102 edges, 411416 markings/sec, 160 secs
lola: 74307301 markings, 155087305 edges, 414468 markings/sec, 165 secs
lola: 76413538 markings, 159490667 edges, 421247 markings/sec, 170 secs
lola: 78576054 markings, 163990787 edges, 432503 markings/sec, 175 secs
lola: 80650503 markings, 168311148 edges, 414890 markings/sec, 180 secs
lola: 82818488 markings, 172775506 edges, 433597 markings/sec, 185 secs
lola: 84932247 markings, 177163162 edges, 422752 markings/sec, 190 secs
lola: 87030023 markings, 181572111 edges, 419555 markings/sec, 195 secs
lola: 89143183 markings, 186038494 edges, 422632 markings/sec, 200 secs
lola: 90814073 markings, 189576878 edges, 334178 markings/sec, 205 secs
lola: 91000262 markings, 189973651 edges, 37238 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no yes no yes unknown unknown no yes
lola:
preliminary result: no yes no no no no no no no yes no yes unknown unknown no yes
lola: memory consumption: 21160 KB
lola: time consumption: 931 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590337191552

--------------------
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-00080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is MAPK-PT-00080, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r120-csrt-158961292400007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00080.tgz
mv MAPK-PT-00080 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;