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-158961292400015.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-01280, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-csrt-158961292400015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.2K Apr 8 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 8 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:22 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.2K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 6 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 6 02:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 6 02:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-01280-00
FORMULA_NAME MAPK-PT-01280-01
FORMULA_NAME MAPK-PT-01280-02
FORMULA_NAME MAPK-PT-01280-03
FORMULA_NAME MAPK-PT-01280-04
FORMULA_NAME MAPK-PT-01280-05
FORMULA_NAME MAPK-PT-01280-06
FORMULA_NAME MAPK-PT-01280-07
FORMULA_NAME MAPK-PT-01280-08
FORMULA_NAME MAPK-PT-01280-09
FORMULA_NAME MAPK-PT-01280-10
FORMULA_NAME MAPK-PT-01280-11
FORMULA_NAME MAPK-PT-01280-12
FORMULA_NAME MAPK-PT-01280-13
FORMULA_NAME MAPK-PT-01280-14
FORMULA_NAME MAPK-PT-01280-15

=== Now, execution of the tool begins

BK_START 1590336260950

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

FORMULA MAPK-PT-01280-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA MAPK-PT-01280-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA MAPK-PT-01280-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA MAPK-PT-01280-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2845
rslt: Output for LTLCardinality @ MAPK-PT-01280

{
"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:21 2020
",
"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": "TRUE",
"processed_size": 4,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((MEK_RafP + 1 <= Phase2) U (X ((Phase2 <= MEK_RafP)) AND G ((RafP_Phase1 + 1 <= MEK_RafP)))))",
"processed_size": 97,
"rewrites": 123
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((MEK_RafP <= Phase1) U X (X ((((ERKP_Phase3 + 1 <= RafP) OR (Phase1 + 1 <= MEK_RafP)) OR X ((Phase1 + 1 <= MEK_RafP)))))))",
"processed_size": 127,
"rewrites": 123
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 0,
"G": 1,
"U": 0,
"X": 3,
"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": "A (X (X (X (G ((Raf_RasGTP + 1 <= ERKP_MEKPP))))))",
"processed_size": 50,
"rewrites": 123
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1,
"U": 2,
"X": 1,
"aconj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "A (((F ((1 <= ERKPP)) U G ((1 <= ERKPP))) U X (TRUE)))",
"processed_size": 54,
"rewrites": 123
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "A (G (F ((G (F ((2 <= ERK))) OR G ((F ((Raf <= Phase2)) AND F ((2 <= ERK))))))))",
"processed_size": 80,
"rewrites": 123
},
"result":
{
"edges": 2299713,
"markings": 921618,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 5,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 6,
"visible_transitions": 0
},
"processed": "A (X (X (F (((ERKPP <= MEK) OR (X (G ((ERKPP_Phase3 <= ERK_MEKPP))) U (ERK + 1 <= ERKP_Phase3)))))))",
"processed_size": 100,
"rewrites": 123
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"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": 425
},
"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 ((1 <= MEK_RafP)))",
"processed_size": 23,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (F ((G ((2 <= MEKPP)) OR G ((2 <= MEKPP)))))",
"processed_size": 46,
"rewrites": 123
},
"result":
{
"edges": 321,
"markings": 321,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (F (((1 <= Phase2) OR G (F ((1 <= Phase2))))))",
"processed_size": 48,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 680
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (F (((RafP <= 2) OR F ((Phase3 + 1 <= Phase2))))))",
"processed_size": 55,
"rewrites": 123
},
"result":
{
"edges": 2055104,
"markings": 823858,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 849
},
"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": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((MEKP_Phase2 <= Phase3) OR F (G ((RafP <= 1)))))",
"processed_size": 52,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1601
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1601
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(ERKPP + 1 <= Raf)",
"processed_size": 18,
"rewrites": 125
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20648,
"runtime": 724.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(F((* OR F(*))))) : A(F(G(((** AND G(**)) OR (G((G(**) OR F(**))) AND F((** AND G(**)))))))) : (A(G(F((G(F(*)) OR G((F(**) AND F(*))))))) AND A(G((X(TRUE) OR (G(F(*)) OR G((F(**) AND F(*)))))))) : A((** OR F(G(*)))) : A((** U (X(**) AND G(**)))) : (* AND A(G(*))) : A((** U X(X((* OR X(*)))))) : A(F((G(**) OR G(**)))) : A(G(*)) : A(X(X(X(G(*))))) : A(F((** OR G(F(*))))) : A(((F(**) U G(**)) U X(TRUE))) : TRUE : A(F(G((F(**) AND (X(G(**)) OR **))))) : (A(F(**)) AND A(F(**))) : A(X(X(F((** OR (X(G(**)) U **))))))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no unknown no yes no no no no no yes yes yes unknown no yes ",
"value": "no unknown no yes no no no no no yes yes yes 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: A (G (F (NOT((X ((3 <= RafP)) AND G (X ((Phase2 <= Phase3)))))))) : A (G (F (X (G ((G ((G ((RasGTP <= MEKP)) OR F ((RasGTP <= MEKP)))) U ((ERKP_MEKPP <= ERK) AND G ((RafP <= MEK))))))))) : A (G ((X ((0 <= RafP)) U (G (X (F ((Raf <= Phase2)))) U G (NOT(X (G ((ERK <= 1))))))))) : A (((MEKP_Phase2 <= Phase3) OR X (NOT(F (G (F ((2 <= RafP)))))))) : A (((MEK_RafP + 1 <= Phase2) U (X ((Phase2 <= MEK_RafP)) AND G ((RafP_Phase1 + 1 <= MEK_RafP))))) : A (NOT(((3 <= Raf_RasGTP) OR NOT(G (NOT((((ERK_MEKPP + 1 <= MEKPP_Phase2) OR (3 <= Raf_RasGTP)) U (MEK <= ERKP_Phase3)))))))) : A (((MEK_RafP <= Phase1) U X (X (NOT((((RafP <= ERKP_Phase3) AND (MEK_RafP <= Phase1)) AND X ((MEK_RafP <= Phase1)))))))) : A ((F (G (X ((2 <= MEKPP)))) OR F ((G ((2 <= MEKPP)) AND F ((0 <= ERK_MEKPP)))))) : A (NOT((X ((0 <= ERK_MEKPP)) AND F ((MEK_RafP <= 0))))) : A (X ((G (NOT(X (X ((ERKP_MEKPP <= Raf_RasGTP))))) AND F (X (X (())))))) : A (F (((1 <= Phase2) OR G (F (NOT(G ((Phase2 <= 0)))))))) : A (((F ((1 <= ERKPP)) U G ((1 <= ERKPP))) U G (X (G (X (())))))) : A (G ((0 <= ERKP))) : A (F (NOT(F (X (NOT(F (G ((G (X ((MEK <= Raf))) U (MEKPP_Phase2 <= 0)))))))))) : A ((F ((RasGTP <= ERKP)) AND F (((RasGTP <= ERKP) U (Raf <= ERKPP))))) : A (((0 <= MEKP_RafP) U X (X (((ERKPP <= MEK) OR (G (X (G ((ERKPP_Phase3 <= ERK_MEKPP)))) U (ERK + 1 <= ERKP_Phase3)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((MEK_RafP + 1 <= Phase2) U (X ((Phase2 <= MEK_RafP)) AND 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 (((MEK_RafP + 1 <= Phase2) U (X ((Phase2 <= MEK_RafP)) AND G ((RafP_Phase1 + 1 <= MEK_RafP)))))
lola: processed formula length: 97
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((MEK_RafP <= Phase1) U X (X ((((ERKP_Phase3 + 1 <= RafP) OR (Phase1 + 1 <= MEK_RafP)) OR X ((Phase1 + 1 <= MEK_RafP)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((MEK_RafP <= Phase1) U X (X ((((ERKP_Phase3 + 1 <= RafP) OR (Phase1 + 1 <= MEK_RafP)) OR X ((Phase1 + 1 <= MEK_RafP)))))))
lola: processed formula length: 127
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((Raf_RasGTP + 1 <= ERKP_MEKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((Raf_RasGTP + 1 <= ERKP_MEKPP))))))
lola: processed formula length: 50
lola: 123 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F ((1 <= ERKPP)) U G ((1 <= ERKPP))) U X (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((1 <= ERKPP)) U G ((1 <= ERKPP))) U X (TRUE)))
lola: processed formula length: 54
lola: 123 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: 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((G (F ((2 <= ERK))) OR G ((F ((Raf <= Phase2)) AND F ((2 <= ERK)))))))) AND A (G ((X (TRUE) OR (G (F ((2 <= ERK))) OR G ((F ((Raf <= Phase2)) AND F ((2 <= ERK)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((G (F ((2 <= ERK))) OR G ((F ((Raf <= Phase2)) AND F ((2 <= ERK))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G (F ((2 <= ERK))) OR G ((F ((Raf <= Phase2)) AND F ((2 <= ERK))))))))
lola: processed formula length: 80
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 921618 markings, 2299713 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((MEKPP_Phase2 <= 0)) AND (X (G ((MEK <= Raf))) OR (MEKPP_Phase2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((MEKPP_Phase2 <= 0)) AND (X (G ((MEK <= Raf))) OR (MEKPP_Phase2 <= 0))))))
lola: processed formula length: 87
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 2691295 markings, 6716978 edges, 538259 markings/sec, 0 secs
lola: 5151457 markings, 12860441 edges, 492032 markings/sec, 5 secs
lola: 7545789 markings, 18843387 edges, 478866 markings/sec, 10 secs
lola: 9897313 markings, 24721343 edges, 470305 markings/sec, 15 secs
lola: 12518586 markings, 31269013 edges, 524255 markings/sec, 20 secs
lola: 14976306 markings, 37401206 edges, 491544 markings/sec, 25 secs
lola: 17621494 markings, 44005434 edges, 529038 markings/sec, 30 secs
lola: 20061769 markings, 50103417 edges, 488055 markings/sec, 35 secs
lola: 22498702 markings, 56194801 edges, 487387 markings/sec, 40 secs
lola: 24873280 markings, 62117159 edges, 474916 markings/sec, 45 secs
lola: 27025629 markings, 67750106 edges, 430470 markings/sec, 50 secs
lola: 29490162 markings, 74048727 edges, 492907 markings/sec, 55 secs
lola: 31955052 markings, 80207000 edges, 492978 markings/sec, 60 secs
lola: 34222458 markings, 85902792 edges, 453481 markings/sec, 65 secs
lola: 36736486 markings, 92347593 edges, 502806 markings/sec, 70 secs
lola: 39065754 markings, 98166733 edges, 465854 markings/sec, 75 secs
lola: 40899443 markings, 102746917 edges, 366738 markings/sec, 80 secs
lola: 42981198 markings, 107947289 edges, 416351 markings/sec, 85 secs
lola: 44759833 markings, 112389988 edges, 355727 markings/sec, 90 secs
lola: 46690025 markings, 117213337 edges, 386038 markings/sec, 95 secs
lola: 49096451 markings, 123224194 edges, 481285 markings/sec, 100 secs
lola: 51531676 markings, 129308531 edges, 487045 markings/sec, 105 secs
lola: 53948520 markings, 135343515 edges, 483369 markings/sec, 110 secs
lola: 56454602 markings, 141604381 edges, 501216 markings/sec, 115 secs
lola: 59033004 markings, 148045761 edges, 515680 markings/sec, 120 secs
lola: 61640524 markings, 154558082 edges, 521504 markings/sec, 125 secs
lola: 63885795 markings, 160162839 edges, 449054 markings/sec, 130 secs
lola: 65990798 markings, 165423447 edges, 421001 markings/sec, 135 secs
lola: 68127699 markings, 170763226 edges, 427380 markings/sec, 140 secs
lola: 69969010 markings, 175366849 edges, 368262 markings/sec, 145 secs
lola: 72096356 markings, 180676939 edges, 425469 markings/sec, 150 secs
lola: 74505466 markings, 186697439 edges, 481822 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (((ERKPP <= MEK) OR (X (G ((ERKPP_Phase3 <= ERK_MEKPP))) U (ERK + 1 <= ERKP_Phase3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (((ERKPP <= MEK) OR (X (G ((ERKPP_Phase3 <= ERK_MEKPP))) U (ERK + 1 <= ERKP_Phase3)))))))
lola: processed formula length: 100
lola: 123 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= MEK_RafP)))
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 ((1 <= MEK_RafP)))
lola: processed formula length: 23
lola: 125 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (MEK_RafP <= 0)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= MEKPP)) OR G ((2 <= MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((2 <= MEKPP)) OR G ((2 <= MEKPP)))))
lola: processed formula length: 46
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 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: 321 markings, 321 edges
lola: ========================================
lola: subprocess 10 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= Phase2) OR G (F ((1 <= Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((1 <= Phase2) OR G (F ((1 <= Phase2))))))
lola: processed formula length: 48
lola: 123 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 11 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((RafP <= 2) OR F ((Phase3 + 1 <= Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((RafP <= 2) OR F ((Phase3 + 1 <= Phase2))))))
lola: processed formula length: 55
lola: 123 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: 823858 markings, 2055104 edges
lola: ========================================
lola: subprocess 12 will run for 849 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((MEKP_Phase2 <= Phase3) OR F (G ((RafP <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((MEKP_Phase2 <= Phase3) OR F (G ((RafP <= 1)))))
lola: processed formula length: 52
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 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 13 will run for 1132 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((((ERKP_MEKPP <= ERK) AND G ((RafP <= MEK))) OR (G ((G ((RasGTP <= MEKP)) OR F ((RasGTP <= MEKP)))) AND F (((ERKP_MEKPP <= ERK) AND G ((RafP <= MEK)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((((ERKP_MEKPP <= ERK) AND G ((RafP <= MEK))) OR (G ((G ((RasGTP <= MEKP)) OR F ((RasGTP <= MEKP)))) AND F (((ERKP_MEKPP <= ERK) AND G ((RafP <= MEK)))))))))
lola: processed formula length: 165
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 82 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: 2020375 markings, 5747131 edges, 404075 markings/sec, 0 secs
lola: 4020272 markings, 11402416 edges, 399979 markings/sec, 5 secs
lola: 6042802 markings, 17117124 edges, 404506 markings/sec, 10 secs
lola: 8079656 markings, 22868923 edges, 407371 markings/sec, 15 secs
lola: 10108717 markings, 28592823 edges, 405812 markings/sec, 20 secs
lola: 11981676 markings, 33877019 edges, 374592 markings/sec, 25 secs
lola: 13804745 markings, 39018762 edges, 364614 markings/sec, 30 secs
lola: 15613190 markings, 44120597 edges, 361689 markings/sec, 35 secs
lola: 17425339 markings, 49227061 edges, 362430 markings/sec, 40 secs
lola: 19267590 markings, 54422299 edges, 368450 markings/sec, 45 secs
lola: 21068337 markings, 59498490 edges, 360149 markings/sec, 50 secs
lola: 22998887 markings, 64938355 edges, 386110 markings/sec, 55 secs
lola: 24858812 markings, 70181958 edges, 371985 markings/sec, 60 secs
lola: 26738841 markings, 75477390 edges, 376006 markings/sec, 65 secs
lola: 28620134 markings, 80780808 edges, 376259 markings/sec, 70 secs
lola: 30558172 markings, 86239991 edges, 387608 markings/sec, 75 secs
lola: 32423730 markings, 91496083 edges, 373112 markings/sec, 80 secs
lola: 34345631 markings, 96910892 edges, 384380 markings/sec, 85 secs
lola: 36231714 markings, 102221055 edges, 377217 markings/sec, 90 secs
lola: 38135998 markings, 107587062 edges, 380857 markings/sec, 95 secs
lola: 39936080 markings, 112655146 edges, 360016 markings/sec, 100 secs
lola: 41834989 markings, 118196345 edges, 379782 markings/sec, 105 secs
lola: 43804068 markings, 123734168 edges, 393816 markings/sec, 110 secs
lola: 45735821 markings, 129167259 edges, 386351 markings/sec, 115 secs
lola: 47740619 markings, 134806666 edges, 400960 markings/sec, 120 secs
lola: 49704844 markings, 140330394 edges, 392845 markings/sec, 125 secs
lola: 51676014 markings, 145875751 edges, 394234 markings/sec, 130 secs
lola: 53631352 markings, 151373606 edges, 391068 markings/sec, 135 secs
lola: 55579327 markings, 156853726 edges, 389595 markings/sec, 140 secs
lola: 57504101 markings, 162267906 edges, 384955 markings/sec, 145 secs
lola: 59420765 markings, 167659140 edges, 383333 markings/sec, 150 secs
lola: 61240777 markings, 172777928 edges, 364002 markings/sec, 155 secs
lola: 63053750 markings, 177876381 edges, 362595 markings/sec, 160 secs
lola: 64780550 markings, 182734526 edges, 345360 markings/sec, 165 secs
lola: 66606030 markings, 187866815 edges, 365096 markings/sec, 170 secs
lola: 68387599 markings, 192879190 edges, 356314 markings/sec, 175 secs
lola: 70022193 markings, 198367309 edges, 326919 markings/sec, 180 secs
lola: 71505133 markings, 203584880 edges, 296588 markings/sec, 185 secs
lola: 73066690 markings, 209132140 edges, 312311 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: Cannot launch process for handling subproblem
lola: subprocess 14 will run for 1601 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((RasGTP <= ERKP))) AND A (F ((Raf <= ERKPP))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1601 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Raf <= ERKPP)))
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: (ERKPP + 1 <= Raf)
lola: processed formula length: 18
lola: 125 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((MEKPP_Phase2 <= 0)) AND (X (G ((MEK <= Raf))) OR (MEKPP_Phase2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((MEKPP_Phase2 <= 0)) AND (X (G ((MEK <= Raf))) OR (MEKPP_Phase2 <= 0))))))
lola: processed formula length: 87
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 2449921 markings, 6115359 edges, 489984 markings/sec, 0 secs
lola: 4787471 markings, 11950940 edges, 467510 markings/sec, 5 secs
lola: 7111344 markings, 17758409 edges, 464775 markings/sec, 10 secs
lola: 9530967 markings, 23805528 edges, 483925 markings/sec, 15 secs
lola: 12115973 markings, 30262957 edges, 517001 markings/sec, 20 secs
lola: 14591075 markings, 36441884 edges, 495020 markings/sec, 25 secs
lola: 17184446 markings, 42913582 edges, 518674 markings/sec, 30 secs
lola: 19611305 markings, 48977200 edges, 485372 markings/sec, 35 secs
lola: 21979095 markings, 54895765 edges, 473558 markings/sec, 40 secs
lola: 24382334 markings, 60890376 edges, 480648 markings/sec, 45 secs
lola: 26610200 markings, 66612174 edges, 445573 markings/sec, 50 secs
lola: 28997135 markings, 72816793 edges, 477387 markings/sec, 55 secs
lola: 31585510 markings, 79283548 edges, 517675 markings/sec, 60 secs
lola: 33787360 markings, 84781807 edges, 440370 markings/sec, 65 secs
lola: 36347044 markings, 91374410 edges, 511937 markings/sec, 70 secs
lola: 38929856 markings, 97827174 edges, 516562 markings/sec, 75 secs
lola: 40922045 markings, 102803097 edges, 398438 markings/sec, 80 secs
lola: 43228706 markings, 108564481 edges, 461332 markings/sec, 85 secs
lola: 45041915 markings, 113095047 edges, 362642 markings/sec, 90 secs
lola: 47218607 markings, 118534763 edges, 435338 markings/sec, 95 secs
lola: 49818255 markings, 125027638 edges, 519930 markings/sec, 100 secs
lola: 52209814 markings, 131002691 edges, 478312 markings/sec, 105 secs
lola: 54760977 markings, 137373602 edges, 510233 markings/sec, 110 secs
lola: 57501497 markings, 144218366 edges, 548104 markings/sec, 115 secs
lola: 60142106 markings, 150815440 edges, 528122 markings/sec, 120 secs
lola: 62737772 markings, 157296360 edges, 519133 markings/sec, 125 secs
lola: 64770039 markings, 162372427 edges, 406453 markings/sec, 130 secs
lola: 66813041 markings, 167477609 edges, 408600 markings/sec, 135 secs
lola: 68713893 markings, 172228866 edges, 380170 markings/sec, 140 secs
lola: 70550096 markings, 176816889 edges, 367241 markings/sec, 145 secs
lola: 72752702 markings, 182316784 edges, 440521 markings/sec, 150 secs
lola: 75254625 markings, 188569042 edges, 500385 markings/sec, 155 secs
lola: 75863230 markings, 190090569 edges, 121721 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (G ((((ERKP_MEKPP <= ERK) AND G ((RafP <= MEK))) OR (G ((G ((RasGTP <= MEKP)) OR F ((RasGTP <= MEKP)))) AND F (((ERKP_MEKPP <= ERK) AND G ((RafP <= MEK)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((((ERKP_MEKPP <= ERK) AND G ((RafP <= MEK))) OR (G ((G ((RasGTP <= MEKP)) OR F ((RasGTP <= MEKP)))) AND F (((ERKP_MEKPP <= ERK) AND G ((RafP <= MEK)))))))))
lola: processed formula length: 165
lola: 123 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 82 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: 2078631 markings, 5910589 edges, 415726 markings/sec, 0 secs
lola: 4077335 markings, 11564673 edges, 399741 markings/sec, 5 secs
lola: 6159076 markings, 17446667 edges, 416348 markings/sec, 10 secs
lola: 8191827 markings, 23183591 edges, 406550 markings/sec, 15 secs
lola: 10210214 markings, 28880750 edges, 403677 markings/sec, 20 secs
lola: 12258552 markings, 34657266 edges, 409668 markings/sec, 25 secs
lola: 14282621 markings, 40367449 edges, 404814 markings/sec, 30 secs
lola: 16308133 markings, 46079995 edges, 405102 markings/sec, 35 secs
lola: 18368717 markings, 51887618 edges, 412117 markings/sec, 40 secs
lola: 20359595 markings, 57500591 edges, 398176 markings/sec, 45 secs
lola: 22381661 markings, 63200953 edges, 404413 markings/sec, 50 secs
lola: 24384987 markings, 68846889 edges, 400665 markings/sec, 55 secs
lola: 26377617 markings, 74462200 edges, 398526 markings/sec, 60 secs
lola: 28370204 markings, 80075259 edges, 398517 markings/sec, 65 secs
lola: 30339882 markings, 85623145 edges, 393936 markings/sec, 70 secs
lola: 32367099 markings, 91337239 edges, 405443 markings/sec, 75 secs
lola: 34365401 markings, 96966417 edges, 399660 markings/sec, 80 secs
lola: 36373045 markings, 102622294 edges, 401529 markings/sec, 85 secs
lola: 38382660 markings, 108279370 edges, 401923 markings/sec, 90 secs
lola: 40334057 markings, 113778274 edges, 390279 markings/sec, 95 secs
lola: 42335641 markings, 119604446 edges, 400317 markings/sec, 100 secs
lola: 44317892 markings, 125179232 edges, 396450 markings/sec, 105 secs
lola: 46308584 markings, 130778854 edges, 398138 markings/sec, 110 secs
lola: 48347613 markings, 136513068 edges, 407806 markings/sec, 115 secs
lola: 50368921 markings, 142198358 edges, 404262 markings/sec, 120 secs
lola: 52360672 markings, 147800897 edges, 398350 markings/sec, 125 secs
lola: 54336988 markings, 153360281 edges, 395263 markings/sec, 130 secs
lola: 56336288 markings, 158983319 edges, 399860 markings/sec, 135 secs
lola: 58316826 markings, 164553409 edges, 396108 markings/sec, 140 secs
lola: 60249203 markings, 169989092 edges, 386475 markings/sec, 145 secs
lola: 62233670 markings, 175569682 edges, 396893 markings/sec, 150 secs
lola: 64178938 markings, 181042613 edges, 389054 markings/sec, 155 secs
lola: 66141004 markings, 186561369 edges, 392413 markings/sec, 160 secs
lola: 68077938 markings, 192007089 edges, 387387 markings/sec, 165 secs
lola: 69885154 markings, 197906969 edges, 361443 markings/sec, 170 secs
lola: 71462052 markings, 203441375 edges, 315380 markings/sec, 175 secs
lola: 72914548 markings, 208602316 edges, 290499 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no yes no no no no no yes yes yes unknown no yes
lola:
preliminary result: no unknown no yes no no no no no yes yes yes unknown no yes
lola: memory consumption: 20648 KB
lola: time consumption: 724 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590336985426

--------------------
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-01280"
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-01280, 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-158961292400015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-01280.tgz
mv MAPK-PT-01280 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 ;