Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r075-tajo-158922839800231.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is ERK-PT-100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tajo-158922839800231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.3K Mar 31 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 31 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 31 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 31 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 31 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 31 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 31 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 31 14:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 31 14:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-100000-00
FORMULA_NAME ERK-PT-100000-01
FORMULA_NAME ERK-PT-100000-02
FORMULA_NAME ERK-PT-100000-03
FORMULA_NAME ERK-PT-100000-04
FORMULA_NAME ERK-PT-100000-05
FORMULA_NAME ERK-PT-100000-06
FORMULA_NAME ERK-PT-100000-07
FORMULA_NAME ERK-PT-100000-08
FORMULA_NAME ERK-PT-100000-09
FORMULA_NAME ERK-PT-100000-10
FORMULA_NAME ERK-PT-100000-11
FORMULA_NAME ERK-PT-100000-12
FORMULA_NAME ERK-PT-100000-13
FORMULA_NAME ERK-PT-100000-14
FORMULA_NAME ERK-PT-100000-15

=== Now, execution of the tool begins

BK_START 1589553714892

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ERK-PT-100000 @ 3570 seconds

FORMULA ERK-PT-100000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2831
rslt: Output for LTLCardinality @ ERK-PT-100000

{
"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": "Fri May 15 14:41:54 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": "FALSE",
"processed_size": 5,
"rewrites": 87
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 87
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((X ((RKIPP <= MEKPP_ERK)) U ((RKIPP <= MEKPP_ERK) AND X ((1 <= Raf1Star)))) OR X ((Raf1Star <= 0))))",
"processed_size": 104,
"rewrites": 87
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (((3 <= ERKPP) U (ERK <= RKIPP))))",
"processed_size": 39,
"rewrites": 87
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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 ((((RKIP + 1 <= ERKPP)) OR X (X (G ((RKIPP + 1 <= RKIPP_RP))))))",
"processed_size": 66,
"rewrites": 87
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 381
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (G (((Raf1Star <= RKIPP_RP) OR X (X (X (((Raf1Star <= RKIPP_RP) AND G ((2 <= RP))))))))))",
"processed_size": 94,
"rewrites": 87
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 429
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 429
},
"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": "(Raf1Star_RKIP <= 1)",
"processed_size": 20,
"rewrites": 89
},
"result":
{
"edges": 200007,
"markings": 200007,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 550
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F ((X (G ((2 <= RKIPP_RP))) AND G (((3 <= ERK) OR (X ((3 <= ERK)) OR F ((MEKPP <= ERK))))))))",
"processed_size": 96,
"rewrites": 87
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 10,
"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": 660
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"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 (((2 <= RP) OR G (F ((2 <= RP)))))",
"processed_size": 36,
"rewrites": 87
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 825
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F (G ((MEKPP_ERK <= 0))))",
"processed_size": 28,
"rewrites": 87
},
"result":
{
"edges": 100012,
"markings": 100008,
"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": 1599
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((F ((2 <= RKIP)) AND G ((RKIP <= MEKPP_ERK))))))",
"processed_size": 57,
"rewrites": 87
},
"result":
{
"edges": 200003,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 3198
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (G (((ERKPP <= MEKPP_ERK) OR (MEKPP <= RKIP)))))",
"processed_size": 54,
"rewrites": 87
},
"result":
{
"edges": 200007,
"markings": 200006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 22220,
"runtime": 739.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G((G(*) R *)))) : A(F(G(*))) : A((* OR X(X(G(*))))) : A(F(G(**))) : A((** OR G(F(**)))) : FALSE : A(((X(**) U (** AND X(**))) OR X(**))) : (A(X((** U **))) AND A(X(X(G(**))))) : A(G(F(**))) : FALSE : FALSE : A(X(G((** OR X(X(X((** AND G(**))))))))) : (A(X(G(**))) AND A(F(**))) : A(G((X(G(*)) OR G(**)))) : A(F((X(G(**)) AND G((** OR (X(**) OR F(*))))))) : A(G(F((F(**) AND G(**)))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "unknown no no no yes no yes no unknown no no no no unknown no no ",
"value": "unknown no no no yes no yes no unknown no no no no unknown no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 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: (ERK <= MEKPP)
lola: LP says that atomic proposition is always true: (ERK <= MEKPP)
lola: LP says that atomic proposition is always true: (RKIPP <= RP)
lola: A (G (NOT((F (X ((RKIP <= MEKPP_ERK))) U X ((RKIP <= MEKPP_ERK)))))) : A (F ((NOT(F ((1 <= MEKPP_ERK))) AND ((1 <= MEKPP_ERK) U (0 <= MEKPP_ERK))))) : A (NOT((((ERKPP <= RKIP)) AND X (X ((((0 <= Raf1Star_RKIP) AND G ((0 <= Raf1Star_RKIP))) U (RKIPP_RP <= RKIPP))))))) : A (F (G (X (X (((ERKPP <= MEKPP_ERK) OR (MEKPP <= RKIP))))))) : A (((2 <= RP) OR G (X (X (F ((2 <= RP))))))) : A (F ((NOT(X (G (((ERK <= MEKPP) AND X (X ((ERK <= MEKPP))))))) AND X ((0 <= RKIP))))) : A (((X ((RKIPP <= MEKPP_ERK)) U ((RKIPP <= MEKPP_ERK) AND X ((1 <= Raf1Star)))) OR X ((Raf1Star <= 0)))) : A (X ((((3 <= ERKPP) U (ERK <= RKIPP)) AND X (G ((3 <= ERKPP)))))) : A (G ((F (NOT(X (((1 <= Raf1Star) AND G ((RKIP + 1 <= Raf1Star_RKIP_ERKPP)))))) U F ((1 <= Raf1Star))))) : A (((RKIPP <= ERK) U (F ((MEKPP_ERK + 1 <= 0)) OR (X ((RKIPP <= ERK)) AND X ((MEKPP_ERK + 1 <= 0)))))) : A ((((3 <= MEKPP) U ((1 <= Raf1Star_RKIP) AND G ((MEKPP_ERK + 1 <= 0)))) AND X (((1 <= Raf1Star_RKIP) AND F (G ((3 <= MEKPP))))))) : A (G (X (((Raf1Star <= RKIPP_RP) OR X (X (X (((Raf1Star <= RKIPP_RP) AND G ((2 <= RP)))))))))) : A ((X (G ((Raf1Star_RKIP_ERKPP <= ERK))) AND F ((2 <= Raf1Star_RKIP)))) : A (G ((G (X (G (NOT(F (((0 <= ERKPP) U (RP <= RKIP))))))) OR G ((3 <= MEKPP))))) : A (F ((G (X ((2 <= RKIPP_RP))) AND G ((((3 <= ERK) OR X ((3 <= ERK))) OR NOT(G ((ERK + 1 <= MEKPP)))))))) : A (G (F ((F ((((MEKPP_ERK + 1 <= RKIP) U (RKIP <= MEKPP_ERK)) U (2 <= RKIP))) AND ((RP + 1 <= RKIPP) OR G ((RKIP <= MEKPP_ERK)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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: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:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:551
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((X ((RKIPP <= MEKPP_ERK)) U ((RKIPP <= MEKPP_ERK) AND X ((1 <= Raf1Star)))) OR X ((Raf1Star <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X ((RKIPP <= MEKPP_ERK)) U ((RKIPP <= MEKPP_ERK) AND X ((1 <= Raf1Star)))) OR X ((Raf1Star <= 0))))
lola: processed formula length: 104
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((3 <= ERKPP) U (ERK <= RKIPP)))) AND A (X (X (G ((3 <= ERKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= ERKPP) U (ERK <= RKIPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((3 <= ERKPP) U (ERK <= RKIPP))))
lola: processed formula length: 39
lola: 87 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: 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: 200005 markings, 200005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((RKIP + 1 <= ERKPP)) OR X (X (G ((RKIPP + 1 <= RKIPP_RP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((RKIP + 1 <= ERKPP)) OR X (X (G ((RKIPP + 1 <= RKIPP_RP))))))
lola: processed formula length: 66
lola: 87 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: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((G ((MEKPP_ERK + 1 <= RKIP)) R (MEKPP_ERK + 1 <= RKIP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((G ((MEKPP_ERK + 1 <= RKIP)) R (MEKPP_ERK + 1 <= RKIP)))))
lola: processed formula length: 67
lola: 87 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4270702 markings, 10370507 edges, 854140 markings/sec, 0 secs
lola: 8381487 markings, 20644621 edges, 822157 markings/sec, 5 secs
lola: 12401581 markings, 30691963 edges, 804019 markings/sec, 10 secs
lola: 16409543 markings, 40710169 edges, 801592 markings/sec, 15 secs
lola: 20388881 markings, 50657360 edges, 795868 markings/sec, 20 secs
lola: 24272115 markings, 60364725 edges, 776647 markings/sec, 25 secs
lola: 28122033 markings, 69987246 edges, 769984 markings/sec, 30 secs
lola: 31980078 markings, 79632588 edges, 771609 markings/sec, 35 secs
lola: 35838149 markings, 89275857 edges, 771614 markings/sec, 40 secs
lola: 39749555 markings, 99052861 edges, 782281 markings/sec, 45 secs
lola: 43363145 markings, 108085749 edges, 722718 markings/sec, 50 secs
lola: 46552983 markings, 116060665 edges, 637968 markings/sec, 55 secs
lola: 50045479 markings, 124789894 edges, 698499 markings/sec, 60 secs
lola: 53302135 markings, 132930685 edges, 651331 markings/sec, 65 secs
lola: 56953421 markings, 142060822 edges, 730257 markings/sec, 70 secs
lola: 60277153 markings, 150366181 edges, 664746 markings/sec, 75 secs
lola: 63580249 markings, 158624093 edges, 660619 markings/sec, 80 secs
lola: 66985709 markings, 167137702 edges, 681092 markings/sec, 85 secs
lola: 70516159 markings, 175964986 edges, 706090 markings/sec, 90 secs
lola: 74004242 markings, 184681060 edges, 697617 markings/sec, 95 secs
lola: 77207444 markings, 192691277 edges, 640640 markings/sec, 100 secs
lola: 80578849 markings, 201119527 edges, 674281 markings/sec, 105 secs
lola: 84139800 markings, 210018658 edges, 712190 markings/sec, 110 secs
lola: 87512986 markings, 218451055 edges, 674637 markings/sec, 115 secs
lola: 90863883 markings, 226828685 edges, 670179 markings/sec, 120 secs
lola: 91347582 markings, 228037219 edges, 96740 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((Raf1Star <= RKIPP_RP) OR X (X (X (((Raf1Star <= RKIPP_RP) AND G ((2 <= RP))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((Raf1Star <= RKIPP_RP) OR X (X (X (((Raf1Star <= RKIPP_RP) AND G ((2 <= RP))))))))))
lola: processed formula length: 94
lola: 87 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: 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: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G ((Raf1Star_RKIP_ERKPP <= ERK)))) AND A (F ((2 <= Raf1Star_RKIP))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= Raf1Star_RKIP)))
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: (Raf1Star_RKIP <= 1)
lola: processed formula length: 20
lola: 89 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: 200007 markings, 200007 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X (G ((RKIP + 1 <= RP))) OR G ((3 <= MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (G ((RKIP + 1 <= RP))) OR G ((3 <= MEKPP)))))
lola: processed formula length: 54
lola: 87 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: 4488672 markings, 10914619 edges, 897734 markings/sec, 0 secs
lola: 8638621 markings, 21286592 edges, 829990 markings/sec, 5 secs
lola: 12680764 markings, 31390210 edges, 808429 markings/sec, 10 secs
lola: 16721146 markings, 41490183 edges, 808076 markings/sec, 15 secs
lola: 20678449 markings, 51381665 edges, 791461 markings/sec, 20 secs
lola: 24567404 markings, 61102858 edges, 777791 markings/sec, 25 secs
lola: 28430845 markings, 70759924 edges, 772688 markings/sec, 30 secs
lola: 32245121 markings, 80293893 edges, 762855 markings/sec, 35 secs
lola: 36124331 markings, 89991705 edges, 775842 markings/sec, 40 secs
lola: 39958716 markings, 99577538 edges, 766877 markings/sec, 45 secs
lola: 43712541 markings, 108960899 edges, 750765 markings/sec, 50 secs
lola: 47135296 markings, 117514717 edges, 684551 markings/sec, 55 secs
lola: 50588429 markings, 126149612 edges, 690627 markings/sec, 60 secs
lola: 53954263 markings, 134561980 edges, 673167 markings/sec, 65 secs
lola: 57636212 markings, 143766521 edges, 736390 markings/sec, 70 secs
lola: 61245064 markings, 152786330 edges, 721770 markings/sec, 75 secs
lola: 64650550 markings, 161299131 edges, 681097 markings/sec, 80 secs
lola: 68047120 markings, 169789522 edges, 679314 markings/sec, 85 secs
lola: 71383522 markings, 178129522 edges, 667280 markings/sec, 90 secs
lola: 75025300 markings, 187234344 edges, 728356 markings/sec, 95 secs
lola: 78557706 markings, 196063386 edges, 706481 markings/sec, 100 secs
lola: 82236970 markings, 205264556 edges, 735853 markings/sec, 105 secs
lola: 85787494 markings, 214139574 edges, 710105 markings/sec, 110 secs
lola: 88997924 markings, 222164297 edges, 642086 markings/sec, 115 secs
lola: 91147285 markings, 227538379 edges, 429872 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X (G ((2 <= RKIPP_RP))) AND G (((3 <= ERK) OR (X ((3 <= ERK)) OR F ((MEKPP <= ERK))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X (G ((2 <= RKIPP_RP))) AND G (((3 <= ERK) OR (X ((3 <= ERK)) OR F ((MEKPP <= ERK))))))))
lola: processed formula length: 96
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= RP) OR G (F ((2 <= RP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= RP) OR G (F ((2 <= RP)))))
lola: processed formula length: 36
lola: 87 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 12 will run for 825 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((MEKPP_ERK <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((MEKPP_ERK <= 0))))
lola: processed formula length: 28
lola: 87 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 0
lola: add low 2
lola: add low 4
lola: add low 8
lola: add low 10
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: 100008 markings, 100012 edges
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= Raf1Star))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= Raf1Star))))
lola: processed formula length: 27
lola: 87 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: 5383713 markings, 8408529 edges, 1076743 markings/sec, 0 secs
lola: 11001972 markings, 17305212 edges, 1123652 markings/sec, 5 secs
lola: 16554826 markings, 26096929 edges, 1110571 markings/sec, 10 secs
lola: 21978740 markings, 34685208 edges, 1084783 markings/sec, 15 secs
lola: 27433000 markings, 43321300 edges, 1090852 markings/sec, 20 secs
lola: 32802582 markings, 51823069 edges, 1073916 markings/sec, 25 secs
lola: 38128689 markings, 60257869 edges, 1065221 markings/sec, 30 secs
lola: 43099130 markings, 68127706 edges, 994088 markings/sec, 35 secs
lola: 47867257 markings, 75676916 edges, 953625 markings/sec, 40 secs
lola: 52703482 markings, 83334914 edges, 967245 markings/sec, 45 secs
lola: 58050732 markings, 91801321 edges, 1069450 markings/sec, 50 secs
lola: 63443920 markings, 100341037 edges, 1078638 markings/sec, 55 secs
lola: 68785442 markings, 108798563 edges, 1068304 markings/sec, 60 secs
lola: 74237066 markings, 117430820 edges, 1090325 markings/sec, 65 secs
lola: 79623456 markings, 125958955 edges, 1077278 markings/sec, 70 secs
lola: 84954463 markings, 134399556 edges, 1066201 markings/sec, 75 secs
lola: 90323544 markings, 142900130 edges, 1073816 markings/sec, 80 secs
lola: 95630207 markings, 151303346 edges, 1061333 markings/sec, 85 secs
lola: 100868166 markings, 159595390 edges, 1047592 markings/sec, 90 secs
lola: 106391876 markings, 168343764 edges, 1104742 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((F ((2 <= RKIP)) AND G ((RKIP <= MEKPP_ERK))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((F ((2 <= RKIP)) AND G ((RKIP <= MEKPP_ERK))))))
lola: processed formula length: 57
lola: 87 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: 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: 200003 markings, 200003 edges
lola: ========================================
lola: subprocess 15 will run for 3198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((ERKPP <= MEKPP_ERK) OR (MEKPP <= RKIP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((ERKPP <= MEKPP_ERK) OR (MEKPP <= RKIP)))))
lola: processed formula length: 54
lola: 87 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: 200006 markings, 200007 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (G ((G ((MEKPP_ERK + 1 <= RKIP)) R (MEKPP_ERK + 1 <= RKIP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((G ((MEKPP_ERK + 1 <= RKIP)) R (MEKPP_ERK + 1 <= RKIP)))))
lola: processed formula length: 67
lola: 87 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4175613 markings, 10132269 edges, 835123 markings/sec, 0 secs
lola: 7845614 markings, 19304522 edges, 734000 markings/sec, 5 secs
lola: 11652025 markings, 28818472 edges, 761282 markings/sec, 10 secs
lola: 15621885 markings, 38741215 edges, 793972 markings/sec, 15 secs
lola: 19721174 markings, 48988667 edges, 819858 markings/sec, 20 secs
lola: 23696218 markings, 58924954 edges, 795009 markings/sec, 25 secs
lola: 27610174 markings, 68709556 edges, 782791 markings/sec, 30 secs
lola: 31515340 markings, 78468793 edges, 781033 markings/sec, 35 secs
lola: 35024627 markings, 87242297 edges, 701857 markings/sec, 40 secs
lola: 38605208 markings, 96192500 edges, 716116 markings/sec, 45 secs
lola: 42292316 markings, 105409000 edges, 737422 markings/sec, 50 secs
lola: 46175772 markings, 115118794 edges, 776691 markings/sec, 55 secs
lola: 50108189 markings, 124948809 edges, 786483 markings/sec, 60 secs
lola: 53941578 markings, 134529281 edges, 766678 markings/sec, 65 secs
lola: 57515022 markings, 143463569 edges, 714689 markings/sec, 70 secs
lola: 60776059 markings, 151613362 edges, 652207 markings/sec, 75 secs
lola: 64156208 markings, 160064600 edges, 676030 markings/sec, 80 secs
lola: 67665525 markings, 168837203 edges, 701863 markings/sec, 85 secs
lola: 71441275 markings, 178277455 edges, 755150 markings/sec, 90 secs
lola: 74975679 markings, 187111435 edges, 706881 markings/sec, 95 secs
lola: 78227691 markings, 195241183 edges, 650402 markings/sec, 100 secs
lola: 81608432 markings, 203692551 edges, 676148 markings/sec, 105 secs
lola: 85032941 markings, 212254508 edges, 684902 markings/sec, 110 secs
lola: 88605877 markings, 221185891 edges, 714587 markings/sec, 115 secs
lola: 91133539 markings, 227501354 edges, 505532 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G ((X (G ((RKIP + 1 <= RP))) OR G ((3 <= MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (G ((RKIP + 1 <= RP))) OR G ((3 <= MEKPP)))))
lola: processed formula length: 54
lola: 87 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: 4519150 markings, 10991105 edges, 903830 markings/sec, 0 secs
lola: 8667647 markings, 21359161 edges, 829699 markings/sec, 5 secs
lola: 12689426 markings, 31411301 edges, 804356 markings/sec, 10 secs
lola: 16758125 markings, 41581720 edges, 813740 markings/sec, 15 secs
lola: 20721446 markings, 51488003 edges, 792664 markings/sec, 20 secs
lola: 24511865 markings, 60963855 edges, 758084 markings/sec, 25 secs
lola: 28091566 markings, 69911704 edges, 715940 markings/sec, 30 secs
lola: 31822382 markings, 79238369 edges, 746163 markings/sec, 35 secs
lola: 35593245 markings, 88663582 edges, 754173 markings/sec, 40 secs
lola: 39396702 markings, 98171555 edges, 760691 markings/sec, 45 secs
lola: 43143482 markings, 107536575 edges, 749356 markings/sec, 50 secs
lola: 46766227 markings, 116592062 edges, 724549 markings/sec, 55 secs
lola: 50472011 markings, 125857138 edges, 741157 markings/sec, 60 secs
lola: 53843318 markings, 134283802 edges, 674261 markings/sec, 65 secs
lola: 57056271 markings, 142316593 edges, 642591 markings/sec, 70 secs
lola: 60281244 markings, 150377572 edges, 644995 markings/sec, 75 secs
lola: 63892310 markings, 159404869 edges, 722213 markings/sec, 80 secs
lola: 67505017 markings, 168434132 edges, 722541 markings/sec, 85 secs
lola: 71097420 markings, 177414557 edges, 718481 markings/sec, 90 secs
lola: 74241462 markings, 185275823 edges, 628808 markings/sec, 95 secs
lola: 77296339 markings, 192914055 edges, 610975 markings/sec, 100 secs
lola: 80305481 markings, 200433838 edges, 601828 markings/sec, 105 secs
lola: 83835915 markings, 209260193 edges, 706087 markings/sec, 110 secs
lola: 87212786 markings, 217699887 edges, 675374 markings/sec, 115 secs
lola: 90546974 markings, 226035111 edges, 666838 markings/sec, 120 secs
lola: 91366153 markings, 228082859 edges, 163836 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= Raf1Star))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= Raf1Star))))
lola: processed formula length: 27
lola: 87 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: 5420150 markings, 8466404 edges, 1084030 markings/sec, 0 secs
lola: 10967776 markings, 17250362 edges, 1109525 markings/sec, 5 secs
lola: 16473934 markings, 25969102 edges, 1101232 markings/sec, 10 secs
lola: 21917206 markings, 34587519 edges, 1088654 markings/sec, 15 secs
lola: 27199736 markings, 42952601 edges, 1056506 markings/sec, 20 secs
lola: 32079642 markings, 50679639 edges, 975981 markings/sec, 25 secs
lola: 36676683 markings, 57957580 edges, 919408 markings/sec, 30 secs
lola: 41767090 markings, 66017673 edges, 1018081 markings/sec, 35 secs
lola: 47190092 markings, 74605533 edges, 1084600 markings/sec, 40 secs
lola: 52338278 markings, 82755462 edges, 1029637 markings/sec, 45 secs
lola: 57680710 markings, 91215293 edges, 1068486 markings/sec, 50 secs
lola: 62986968 markings, 99616097 edges, 1061252 markings/sec, 55 secs
lola: 68245614 markings, 107942338 edges, 1051729 markings/sec, 60 secs
lola: 73602297 markings, 116424116 edges, 1071337 markings/sec, 65 secs
lola: 78897817 markings, 124810565 edges, 1059104 markings/sec, 70 secs
lola: 84095744 markings, 133039635 edges, 1039585 markings/sec, 75 secs
lola: 89358726 markings, 141374065 edges, 1052596 markings/sec, 80 secs
lola: 94532214 markings, 149565414 edges, 1034698 markings/sec, 85 secs
lola: 99676764 markings, 157709541 edges, 1028910 markings/sec, 90 secs
lola: 104975383 markings, 166101005 edges, 1059724 markings/sec, 95 secs
lola: 110178646 markings, 174345115 edges, 1040653 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no no no yes no yes no unknown no no no no unknown no no
lola:
preliminary result: unknown no no no yes no yes no unknown no no no no unknown no no
lola: memory consumption: 22220 KB
lola: time consumption: 739 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589554454025

--------------------
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="ERK-PT-100000"
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 ERK-PT-100000, 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 r075-tajo-158922839800231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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