fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r105-oct2-158940199600061
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for HouseConstruction-PT-32000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.310 1384249.00 1359426.00 2265.20 ?F?FFFFFTFFFFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r105-oct2-158940199600061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 HouseConstruction-PT-32000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-oct2-158940199600061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.5K Apr 4 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 4 10:31 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.5K Apr 8 14:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 3 21:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 3 21:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 3 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 3 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 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 13K 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 HouseConstruction-PT-32000-00
FORMULA_NAME HouseConstruction-PT-32000-01
FORMULA_NAME HouseConstruction-PT-32000-02
FORMULA_NAME HouseConstruction-PT-32000-03
FORMULA_NAME HouseConstruction-PT-32000-04
FORMULA_NAME HouseConstruction-PT-32000-05
FORMULA_NAME HouseConstruction-PT-32000-06
FORMULA_NAME HouseConstruction-PT-32000-07
FORMULA_NAME HouseConstruction-PT-32000-08
FORMULA_NAME HouseConstruction-PT-32000-09
FORMULA_NAME HouseConstruction-PT-32000-10
FORMULA_NAME HouseConstruction-PT-32000-11
FORMULA_NAME HouseConstruction-PT-32000-12
FORMULA_NAME HouseConstruction-PT-32000-13
FORMULA_NAME HouseConstruction-PT-32000-14
FORMULA_NAME HouseConstruction-PT-32000-15

=== Now, execution of the tool begins

BK_START 1589718831154

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ HouseConstruction-PT-32000 @ 3570 seconds

FORMULA HouseConstruction-PT-32000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-32000-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2186
rslt: Output for LTLCardinality @ HouseConstruction-PT-32000

{
"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 17 12:33:51 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": 95
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((p20 <= p4)))",
"processed_size": 19,
"rewrites": 95
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X ((p8 <= p21))))",
"processed_size": 23,
"rewrites": 95
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"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": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((p22 + 1 <= p23) AND X (X (X ((p18 <= p23))))) OR ((1 <= p27) U X (F ((p23 <= p22))))))",
"processed_size": 92,
"rewrites": 95
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"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": 4,
"visible_transitions": 0
},
"processed": "A (X (((p8 <= 1) OR X ((G ((p20 + 1 <= p16)) OR ((p8 <= 1) AND G ((p27 <= 0))))))))",
"processed_size": 83,
"rewrites": 95
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 8,
"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": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p7 <= p11)))",
"processed_size": 19,
"rewrites": 97
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"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": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p2)",
"processed_size": 9,
"rewrites": 97
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (F ((3 <= p26))))",
"processed_size": 22,
"rewrites": 95
},
"result":
{
"edges": 576001,
"markings": 576001,
"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": 810
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((p7 + 1 <= p5))))",
"processed_size": 26,
"rewrites": 95
},
"result":
{
"edges": 576003,
"markings": 576002,
"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": 1081
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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 (F (G ((F ((1 <= p2)) AND ((p4 <= p19) OR (1 <= p2))))))",
"processed_size": 58,
"rewrites": 95
},
"result":
{
"edges": 576003,
"markings": 576002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3009
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p14)",
"processed_size": 10,
"rewrites": 95
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22756,
"runtime": 1360.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(((F(**) U **) U G((** OR F(**))))) : A(F(G((F(**) AND (** OR **))))) : A(X(G((G(*) OR X(F(*)))))) : (A(G(**)) AND A(X(F(**)))) : A(X(G(**))) : A(G(**)) : A(X(F(**))) : FALSE : (A(X(**)) AND A(X(X(**)))) : A(F(G(**))) : (** AND A(F(**))) : A(G(F(**))) : (A(G(**)) AND (A(G(F(**))) AND (A(G((** OR **))) AND A(X((** OR F(**))))))) : A(((** AND X(X(X(**)))) OR (** U X(F(**))))) : A(X((* OR X((G(*) OR (* AND G(*))))))) : A(F(*))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 18,
"places": 26,
"places_significant": 18,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "unknown no unknown no no no no no yes no no no no yes yes yes ",
"value": "unknown no unknown no no no no no yes no no no no yes yes 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: 44/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 18 transitions, 18 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 (((F ((p8 <= p25)) U ((p15 <= p3) OR (p8 <= p25))) U G (((p15 <= p3) OR F ((p16 + 1 <= p20)))))) : A ((((0 <= p23) OR X (((3 <= p23) OR X ((1 <= p2))))) U G (((p4 <= p19) U (1 <= p2))))) : A (G (NOT(X ((F ((p6 <= p21)) AND X (G ((3 <= p19)))))))) : A ((G ((p2 <= p22)) AND X ((((p1 <= p4) OR F ((p7 <= p27))) U F ((p2 <= p9)))))) : A (G (X ((3 <= p11)))) : A (G (((p7 <= p11) AND F ((((p14 <= p12) OR F ((0 <= p6))) OR G (X (G ((p7 <= p11))))))))) : A (X ((((1 <= p5) OR G ((((3 <= p4) OR (3 <= p9)) OR X ((2 <= p22))))) U F ((3 <= p9))))) : A (NOT(X (X ((((2 <= p3) U X ((0 <= p13))) U X (G (F (((0 <= p13) OR F ((0 <= p13))))))))))) : A (X ((((p20 <= p4) AND X ((p8 <= p21))) AND (G ((0 <= p9)) OR F (((p4 <= p19) U X ((p20 <= p4)))))))) : A (F (G ((p7 + 1 <= p5)))) : A (((1 <= p14) AND F ((2 <= p16)))) : A (X ((G (NOT(((2 <= p8) OR G ((0 <= p23))))) U G (((3 <= p26) U F ((3 <= p26))))))) : A ((G (((1 <= p10) AND ((p22 <= p17) U (1 <= p10)))) AND X (((p17 + 1 <= p22) OR F ((2 <= p15)))))) : A ((((p22 + 1 <= p23) AND X (X (X ((p18 <= p23))))) OR ((1 <= p27) U X (F ((p23 <= p22)))))) : A (NOT((X ((2 <= p8)) AND X (X ((F (((p3 <= p23) U (p16 <= p20))) AND ((2 <= p8) OR F ((1 <= p27))))))))) : A (F (NOT((F (X (F (X (F ((p8 + 1 <= 0)))))) U (3 <= p2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:191
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:188
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:545
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: 95 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: (A (G ((p2 <= p22))) AND A (X (F ((p2 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p2 <= p22)))
lola: processed formula length: 19
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: formula 0: (p22 + 1 <= p2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= p11))))
lola: processed formula length: 22
lola: 95 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: 576001 markings, 576001 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= p9))))
lola: processed formula length: 21
lola: 95 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: 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: 576001 markings, 576001 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((G ((p21 + 1 <= p6)) OR X (F ((p19 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((G ((p21 + 1 <= p6)) OR X (F ((p19 <= 2)))))))
lola: processed formula length: 55
lola: 95 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: 3070701 markings, 9821107 edges, 614140 markings/sec, 0 secs
lola: 4592790 markings, 19515102 edges, 304418 markings/sec, 5 secs
lola: 6014207 markings, 28626937 edges, 284283 markings/sec, 10 secs
lola: 7104054 markings, 36521682 edges, 217969 markings/sec, 15 secs
lola: 8223550 markings, 44624739 edges, 223899 markings/sec, 20 secs
lola: 9473201 markings, 53362994 edges, 249930 markings/sec, 25 secs
lola: 10726710 markings, 62127145 edges, 250702 markings/sec, 30 secs
lola: 11981416 markings, 70827391 edges, 250941 markings/sec, 35 secs
lola: 13161850 markings, 79656917 edges, 236087 markings/sec, 40 secs
lola: 14411427 markings, 87884108 edges, 249915 markings/sec, 45 secs
lola: 15499305 markings, 95414066 edges, 217576 markings/sec, 50 secs
lola: 16426101 markings, 102756464 edges, 185359 markings/sec, 55 secs
lola: 17480895 markings, 110669563 edges, 210959 markings/sec, 60 secs
lola: 18624963 markings, 119252886 edges, 228814 markings/sec, 65 secs
lola: 19767895 markings, 127186142 edges, 228586 markings/sec, 70 secs
lola: 20931607 markings, 135297196 edges, 232742 markings/sec, 75 secs
lola: 22174865 markings, 143341281 edges, 248652 markings/sec, 80 secs
lola: 23173813 markings, 150659264 edges, 199790 markings/sec, 85 secs
lola: 24179630 markings, 158081869 edges, 201163 markings/sec, 90 secs
lola: 25137821 markings, 165680100 edges, 191638 markings/sec, 95 secs
lola: 26030483 markings, 173154959 edges, 178532 markings/sec, 100 secs
lola: 27010793 markings, 180543383 edges, 196062 markings/sec, 105 secs
lola: 28027388 markings, 188745571 edges, 203319 markings/sec, 110 secs
lola: 28978520 markings, 196766533 edges, 190226 markings/sec, 115 secs
lola: 29859796 markings, 204189061 edges, 176255 markings/sec, 120 secs
lola: 30826900 markings, 211338563 edges, 193421 markings/sec, 125 secs
lola: 31714022 markings, 218444451 edges, 177424 markings/sec, 130 secs
lola: 32531154 markings, 225889087 edges, 163426 markings/sec, 135 secs
lola: 33414544 markings, 233309478 edges, 176678 markings/sec, 140 secs
lola: 34227805 markings, 240980831 edges, 162652 markings/sec, 145 secs
lola: 35308894 markings, 249154468 edges, 216218 markings/sec, 150 secs
lola: 36277640 markings, 257378242 edges, 193749 markings/sec, 155 secs
lola: 37409697 markings, 265362546 edges, 226411 markings/sec, 160 secs
lola: 38380544 markings, 272283144 edges, 194169 markings/sec, 165 secs
lola: 39243343 markings, 278919433 edges, 172560 markings/sec, 170 secs
lola: 40009304 markings, 284460366 edges, 153192 markings/sec, 175 secs
lola: 40882402 markings, 291222390 edges, 174620 markings/sec, 180 secs
lola: 41703142 markings, 298068555 edges, 164148 markings/sec, 185 secs
lola: 42389434 markings, 304375335 edges, 137258 markings/sec, 190 secs
lola: 43232818 markings, 310934864 edges, 168677 markings/sec, 195 secs
lola: 44161605 markings, 318403118 edges, 185757 markings/sec, 200 secs
lola: 45044221 markings, 325694140 edges, 176523 markings/sec, 205 secs
lola: 45847236 markings, 333349439 edges, 160603 markings/sec, 210 secs
lola: 46840527 markings, 341128055 edges, 198658 markings/sec, 215 secs
lola: 47846842 markings, 349325589 edges, 201263 markings/sec, 220 secs
lola: 48879987 markings, 356206531 edges, 206629 markings/sec, 225 secs
lola: 49863687 markings, 363180029 edges, 196740 markings/sec, 230 secs
lola: 50849059 markings, 370092460 edges, 197074 markings/sec, 235 secs
lola: 51909654 markings, 377404533 edges, 212119 markings/sec, 240 secs
lola: 53091990 markings, 385901867 edges, 236467 markings/sec, 245 secs
lola: 53986908 markings, 393676293 edges, 178984 markings/sec, 250 secs
lola: 55000028 markings, 401661583 edges, 202624 markings/sec, 255 secs
lola: 55920451 markings, 409851827 edges, 184085 markings/sec, 260 secs
lola: 56952228 markings, 418208953 edges, 206355 markings/sec, 265 secs
lola: 58013338 markings, 426270501 edges, 212222 markings/sec, 270 secs
lola: 59005033 markings, 434041496 edges, 198339 markings/sec, 275 secs
lola: 59844744 markings, 441700108 edges, 167942 markings/sec, 280 secs
lola: 60695390 markings, 449248514 edges, 170129 markings/sec, 285 secs
lola: 61472470 markings, 456862338 edges, 155416 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no no unknown no no unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8629232 KB
lola: time consumption: 302 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown no no unknown no no unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8701568 KB
lola: time consumption: 305 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p20 <= p4))) AND A (X (X ((p8 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p20 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p20 <= p4)))
lola: processed formula length: 19
lola: 95 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p8 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p8 <= p21))))
lola: processed formula length: 23
lola: 95 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= p10))) AND (A (G (F ((1 <= p10)))) AND (A (G (((p22 <= p17) OR (1 <= p10)))) AND A (X (((p17 + 1 <= p22) OR F ((2 <= p15))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p10)))
lola: processed formula length: 18
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p10 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p22 + 1 <= p23) AND X (X (X ((p18 <= p23))))) OR ((1 <= p27) U X (F ((p23 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p22 + 1 <= p23) AND X (X (X ((p18 <= p23))))) OR ((1 <= p27) U X (F ((p23 <= p22))))))
lola: processed formula length: 92
lola: 95 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 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p8 <= 1) OR X ((G ((p20 + 1 <= p16)) OR ((p8 <= 1) AND G ((p27 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p8 <= 1) OR X ((G ((p20 + 1 <= p16)) OR ((p8 <= 1) AND G ((p27 <= 0))))))))
lola: processed formula length: 83
lola: 95 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p7 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p7 <= p11)))
lola: processed formula length: 19
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p11 + 1 <= p7)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= p2)
lola: processed formula length: 9
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= p26))))
lola: processed formula length: 22
lola: 95 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: 576001 markings, 576001 edges
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p7 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p7 + 1 <= p5))))
lola: processed formula length: 26
lola: 95 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: 576002 markings, 576003 edges
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((1 <= p2)) AND ((p4 <= p19) OR (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((1 <= p2)) AND ((p4 <= p19) OR (1 <= p2))))))
lola: processed formula length: 58
lola: 95 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: 576002 markings, 576003 edges
lola: ========================================
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F ((p8 <= p25)) U ((p15 <= p3) OR (p8 <= p25))) U G (((p15 <= p3) OR F ((p16 + 1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((p8 <= p25)) U ((p15 <= p3) OR (p8 <= p25))) U G (((p15 <= p3) OR F ((p16 + 1 <= p20))))))
lola: processed formula length: 99
lola: 95 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 4513034 markings, 6720981 edges, 902607 markings/sec, 0 secs
lola: 8240665 markings, 13236370 edges, 745526 markings/sec, 5 secs
lola: 11975130 markings, 19570382 edges, 746893 markings/sec, 10 secs
lola: 15388369 markings, 25706396 edges, 682648 markings/sec, 15 secs
lola: 18496663 markings, 32166751 edges, 621659 markings/sec, 20 secs
lola: 21414599 markings, 38563765 edges, 583587 markings/sec, 25 secs
lola: 24010688 markings, 44984312 edges, 519218 markings/sec, 30 secs
lola: 26345097 markings, 51032530 edges, 466882 markings/sec, 35 secs
lola: 29012236 markings, 57364157 edges, 533428 markings/sec, 40 secs
lola: 31762321 markings, 63619627 edges, 550017 markings/sec, 45 secs
lola: 34255271 markings, 69994351 edges, 498590 markings/sec, 50 secs
lola: 36633242 markings, 76260613 edges, 475594 markings/sec, 55 secs
lola: 39579095 markings, 82603964 edges, 589171 markings/sec, 60 secs
lola: 42470803 markings, 88669903 edges, 578342 markings/sec, 65 secs
lola: 45196994 markings, 94926071 edges, 545238 markings/sec, 70 secs
lola: 47653222 markings, 101159795 edges, 491246 markings/sec, 75 secs
lola: 50392553 markings, 107602146 edges, 547866 markings/sec, 80 secs
lola: 53104041 markings, 113838571 edges, 542298 markings/sec, 85 secs
lola: 56012396 markings, 120060301 edges, 581671 markings/sec, 90 secs
lola: 59062342 markings, 127120880 edges, 609989 markings/sec, 95 secs
lola: 61976987 markings, 133868302 edges, 582929 markings/sec, 100 secs
lola: 64805291 markings, 140415900 edges, 565661 markings/sec, 105 secs
lola: 67611832 markings, 146913128 edges, 561308 markings/sec, 110 secs
lola: 70310750 markings, 153160957 edges, 539784 markings/sec, 115 secs
lola: 73010659 markings, 159411312 edges, 539982 markings/sec, 120 secs
lola: 75684934 markings, 165602601 edges, 534855 markings/sec, 125 secs
lola: 78381802 markings, 171845869 edges, 539374 markings/sec, 130 secs
lola: 80985856 markings, 177874075 edges, 520811 markings/sec, 135 secs
lola: 83585692 markings, 183892966 edges, 519967 markings/sec, 140 secs
lola: 86192088 markings, 189926704 edges, 521279 markings/sec, 145 secs
lola: 88818543 markings, 196007072 edges, 525291 markings/sec, 150 secs
lola: 91451632 markings, 202102568 edges, 526618 markings/sec, 155 secs
lola: 94089174 markings, 208208411 edges, 527508 markings/sec, 160 secs
lola: 96738036 markings, 214340702 edges, 529772 markings/sec, 165 secs
lola: 99390474 markings, 220481135 edges, 530488 markings/sec, 170 secs
lola: 101983193 markings, 226483507 edges, 518544 markings/sec, 175 secs
lola: 104527834 markings, 232374326 edges, 508928 markings/sec, 180 secs
lola: 107080486 markings, 238283728 edges, 510530 markings/sec, 185 secs
lola: 109645407 markings, 244221471 edges, 512984 markings/sec, 190 secs
lola: 112222107 markings, 250186551 edges, 515340 markings/sec, 195 secs
lola: 114788413 markings, 256127601 edges, 513261 markings/sec, 200 secs
lola: 117384316 markings, 262137094 edges, 519181 markings/sec, 205 secs
lola: 119951881 markings, 268081390 edges, 513513 markings/sec, 210 secs
lola: 121919567 markings, 272636435 edges, 393537 markings/sec, 215 secs
lola: 122361940 markings, 273660621 edges, 88475 markings/sec, 220 secs
lola: 122361990 markings, 273660749 edges, 10 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3010 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p14) AND A (F ((2 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3009 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p14)
lola: processed formula length: 10
lola: 95 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (G ((G ((p21 + 1 <= p6)) OR X (F ((p19 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((G ((p21 + 1 <= p6)) OR X (F ((p19 <= 2)))))))
lola: processed formula length: 55
lola: 95 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: 3068801 markings, 9809347 edges, 613760 markings/sec, 0 secs
lola: 4584019 markings, 19460976 edges, 303044 markings/sec, 5 secs
lola: 6042118 markings, 28802824 edges, 291620 markings/sec, 10 secs
lola: 7208914 markings, 37280926 edges, 233359 markings/sec, 15 secs
lola: 8484589 markings, 46337738 edges, 255135 markings/sec, 20 secs
lola: 9693785 markings, 55112074 edges, 241839 markings/sec, 25 secs
lola: 10936189 markings, 63548770 edges, 248481 markings/sec, 30 secs
lola: 12253770 markings, 72769106 edges, 263516 markings/sec, 35 secs
lola: 13428986 markings, 81708320 edges, 235043 markings/sec, 40 secs
lola: 14724881 markings, 90056826 edges, 259179 markings/sec, 45 secs
lola: 15879556 markings, 98296339 edges, 230935 markings/sec, 50 secs
lola: 16918463 markings, 106259885 edges, 207781 markings/sec, 55 secs
lola: 18008254 markings, 115051147 edges, 217958 markings/sec, 60 secs
lola: 19301505 markings, 123929552 edges, 258650 markings/sec, 65 secs
lola: 20559053 markings, 132760071 edges, 251510 markings/sec, 70 secs
lola: 21941098 markings, 141780576 edges, 276409 markings/sec, 75 secs
lola: 23072160 markings, 149845646 edges, 226212 markings/sec, 80 secs
lola: 24154859 markings, 157922842 edges, 216540 markings/sec, 85 secs
lola: 25191601 markings, 166153707 edges, 207348 markings/sec, 90 secs
lola: 26119057 markings, 173955096 edges, 185491 markings/sec, 95 secs
lola: 27131893 markings, 181438259 edges, 202567 markings/sec, 100 secs
lola: 28180813 markings, 190010114 edges, 209784 markings/sec, 105 secs
lola: 29144116 markings, 198228368 edges, 192661 markings/sec, 110 secs
lola: 30153134 markings, 206052016 edges, 201804 markings/sec, 115 secs
lola: 31071588 markings, 213261459 edges, 183691 markings/sec, 120 secs
lola: 31957141 markings, 220654633 edges, 177111 markings/sec, 125 secs
lola: 32782516 markings, 227840949 edges, 165075 markings/sec, 130 secs
lola: 33668694 markings, 235542213 edges, 177236 markings/sec, 135 secs
lola: 34542592 markings, 243171250 edges, 174780 markings/sec, 140 secs
lola: 35593529 markings, 251501001 edges, 210187 markings/sec, 145 secs
lola: 36639903 markings, 259875049 edges, 209275 markings/sec, 150 secs
lola: 37879481 markings, 268586429 edges, 247916 markings/sec, 155 secs
lola: 38936951 markings, 276641541 edges, 211494 markings/sec, 160 secs
lola: 39994767 markings, 284347592 edges, 211563 markings/sec, 165 secs
lola: 41044069 markings, 292662661 edges, 209860 markings/sec, 170 secs
lola: 42026325 markings, 300916854 edges, 196451 markings/sec, 175 secs
lola: 42906019 markings, 308840879 edges, 175939 markings/sec, 180 secs
lola: 43976067 markings, 316822910 edges, 214010 markings/sec, 185 secs
lola: 44887139 markings, 324246774 edges, 182214 markings/sec, 190 secs
lola: 45727334 markings, 332059126 edges, 168039 markings/sec, 195 secs
lola: 46689394 markings, 339986099 edges, 192412 markings/sec, 200 secs
lola: 47683875 markings, 348158743 edges, 198896 markings/sec, 205 secs
lola: 48821811 markings, 355850263 edges, 227587 markings/sec, 210 secs
lola: 49874525 markings, 363243095 edges, 210543 markings/sec, 215 secs
lola: 50860155 markings, 370187037 edges, 197126 markings/sec, 220 secs
lola: 51953739 markings, 377664568 edges, 218717 markings/sec, 225 secs
lola: 53166251 markings, 386494535 edges, 242502 markings/sec, 230 secs
lola: 54106115 markings, 394729774 edges, 187973 markings/sec, 235 secs
lola: 55179682 markings, 403094566 edges, 214713 markings/sec, 240 secs
lola: 56048825 markings, 411073909 edges, 173829 markings/sec, 245 secs
lola: 57119502 markings, 419542949 edges, 214135 markings/sec, 250 secs
lola: 58189811 markings, 427599256 edges, 214062 markings/sec, 255 secs
lola: 59184534 markings, 435492995 edges, 198945 markings/sec, 260 secs
lola: 60016271 markings, 443590155 edges, 166347 markings/sec, 265 secs
lola: 60887042 markings, 451331097 edges, 174154 markings/sec, 270 secs
lola: 61741656 markings, 459102996 edges, 170923 markings/sec, 275 secs
lola: 62629802 markings, 466510140 edges, 177629 markings/sec, 280 secs
lola: 63876230 markings, 474403353 edges, 249286 markings/sec, 285 secs
lola: 65052166 markings, 482043975 edges, 235187 markings/sec, 290 secs
lola: 66050740 markings, 489468540 edges, 199715 markings/sec, 295 secs
lola: 67009123 markings, 496610093 edges, 191677 markings/sec, 300 secs
lola: 67973229 markings, 504348058 edges, 192821 markings/sec, 305 secs
lola: 68958749 markings, 511734496 edges, 197104 markings/sec, 310 secs
lola: 69868648 markings, 519160345 edges, 181980 markings/sec, 315 secs
lola: 70835036 markings, 526802830 edges, 193278 markings/sec, 320 secs
lola: 71877640 markings, 534729372 edges, 208521 markings/sec, 325 secs
lola: 72773901 markings, 542006950 edges, 179252 markings/sec, 330 secs
lola: 73641038 markings, 549872752 edges, 173427 markings/sec, 335 secs
lola: 74504934 markings, 557546605 edges, 172779 markings/sec, 340 secs
lola: 75329737 markings, 565117072 edges, 164961 markings/sec, 345 secs
lola: 76219338 markings, 572948287 edges, 177920 markings/sec, 350 secs
lola: 77118664 markings, 579599171 edges, 179865 markings/sec, 355 secs
lola: 78069915 markings, 586754524 edges, 190250 markings/sec, 360 secs
lola: 79017543 markings, 595084224 edges, 189526 markings/sec, 365 secs
lola: 79920478 markings, 603193658 edges, 180587 markings/sec, 370 secs
lola: 80862214 markings, 611179960 edges, 188347 markings/sec, 375 secs
lola: 81676611 markings, 618882443 edges, 162879 markings/sec, 380 secs
lola: 82430366 markings, 626351427 edges, 150751 markings/sec, 385 secs
lola: 83299828 markings, 633566101 edges, 173892 markings/sec, 390 secs
lola: 84635756 markings, 642450059 edges, 267186 markings/sec, 395 secs
lola: 85826477 markings, 651025200 edges, 238144 markings/sec, 400 secs
lola: 86951878 markings, 659464802 edges, 225080 markings/sec, 405 secs
lola: 87942984 markings, 667768130 edges, 198221 markings/sec, 410 secs
lola: 88955048 markings, 675551165 edges, 202413 markings/sec, 415 secs
lola: 90007705 markings, 684119102 edges, 210531 markings/sec, 420 secs
lola: 90934614 markings, 692225167 edges, 185382 markings/sec, 425 secs
lola: 92214166 markings, 700825514 edges, 255910 markings/sec, 430 secs
lola: 93392976 markings, 709491413 edges, 235762 markings/sec, 435 secs
lola: 94731954 markings, 718383595 edges, 267796 markings/sec, 440 secs
lola: 95892898 markings, 726581142 edges, 232189 markings/sec, 445 secs
lola: 96885859 markings, 734009964 edges, 198592 markings/sec, 450 secs
lola: 97994048 markings, 742154767 edges, 221638 markings/sec, 455 secs
lola: 98884238 markings, 749681423 edges, 178038 markings/sec, 460 secs
lola: 99849492 markings, 757352381 edges, 193051 markings/sec, 465 secs
lola: 100825424 markings, 764857757 edges, 195186 markings/sec, 470 secs
lola: 101780510 markings, 772622550 edges, 191017 markings/sec, 475 secs
lola: 102598350 markings, 780120575 edges, 163568 markings/sec, 480 secs
lola: 103586159 markings, 787326388 edges, 197562 markings/sec, 485 secs
lola: 104453645 markings, 794293553 edges, 173497 markings/sec, 490 secs
lola: 105288034 markings, 801311253 edges, 166878 markings/sec, 495 secs
lola: 106077419 markings, 808116449 edges, 157877 markings/sec, 500 secs
lola: 106892085 markings, 815230479 edges, 162933 markings/sec, 505 secs
lola: 107672446 markings, 822149056 edges, 156072 markings/sec, 510 secs
lola: 108696526 markings, 830264074 edges, 204816 markings/sec, 515 secs
lola: 109662999 markings, 838073884 edges, 193295 markings/sec, 520 secs
lola: 110791322 markings, 846394979 edges, 225665 markings/sec, 525 secs
lola: 111703319 markings, 853995123 edges, 182399 markings/sec, 530 secs
lola: 112574441 markings, 861520047 edges, 174224 markings/sec, 535 secs
lola: 113390298 markings, 868341300 edges, 163171 markings/sec, 540 secs
lola: 114238781 markings, 876115439 edges, 169697 markings/sec, 545 secs
lola: 114869264 markings, 881902188 edges, 126097 markings/sec, 550 secs
lola: 115194918 markings, 885078074 edges, 65131 markings/sec, 555 secs
lola: 115451249 markings, 887890430 edges, 51266 markings/sec, 560 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (((F ((p8 <= p25)) U ((p15 <= p3) OR (p8 <= p25))) U G (((p15 <= p3) OR F ((p16 + 1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((p8 <= p25)) U ((p15 <= p3) OR (p8 <= p25))) U G (((p15 <= p3) OR F ((p16 + 1 <= p20))))))
lola: processed formula length: 99
lola: 95 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 4675569 markings, 7005089 edges, 935114 markings/sec, 0 secs
lola: 8472161 markings, 13641003 edges, 759318 markings/sec, 5 secs
lola: 12355482 markings, 20114518 edges, 776664 markings/sec, 10 secs
lola: 15664253 markings, 26215056 edges, 661754 markings/sec, 15 secs
lola: 18771261 markings, 32768774 edges, 621402 markings/sec, 20 secs
lola: 21682795 markings, 39148656 edges, 582307 markings/sec, 25 secs
lola: 24259964 markings, 45630165 edges, 515434 markings/sec, 30 secs
lola: 26661588 markings, 51852546 edges, 480325 markings/sec, 35 secs
lola: 29500780 markings, 58475426 edges, 567838 markings/sec, 40 secs
lola: 32289002 markings, 64867185 edges, 557644 markings/sec, 45 secs
lola: 34774710 markings, 71363132 edges, 497142 markings/sec, 50 secs
lola: 37158611 markings, 77645039 edges, 476780 markings/sec, 55 secs
lola: 40282007 markings, 84078468 edges, 624679 markings/sec, 60 secs
lola: 43217561 markings, 90236382 edges, 587111 markings/sec, 65 secs
lola: 45899680 markings, 96709438 edges, 536424 markings/sec, 70 secs
lola: 48379289 markings, 103002516 edges, 495922 markings/sec, 75 secs
lola: 51245208 markings, 109563250 edges, 573184 markings/sec, 80 secs
lola: 53944665 markings, 115771999 edges, 539891 markings/sec, 85 secs
lola: 57014374 markings, 122379907 edges, 613942 markings/sec, 90 secs
lola: 60013222 markings, 129321984 edges, 599770 markings/sec, 95 secs
lola: 62905678 markings, 136018379 edges, 578491 markings/sec, 100 secs
lola: 65752655 markings, 142609080 edges, 569395 markings/sec, 105 secs
lola: 68544395 markings, 149071829 edges, 558348 markings/sec, 110 secs
lola: 71282236 markings, 155410063 edges, 547568 markings/sec, 115 secs
lola: 74020908 markings, 161750010 edges, 547734 markings/sec, 120 secs
lola: 76752044 markings, 168072981 edges, 546227 markings/sec, 125 secs
lola: 79446715 markings, 174311180 edges, 538934 markings/sec, 130 secs
lola: 82089489 markings, 180429265 edges, 528555 markings/sec, 135 secs
lola: 84724608 markings, 186529444 edges, 527024 markings/sec, 140 secs
lola: 87374536 markings, 192664234 edges, 529986 markings/sec, 145 secs
lola: 90035838 markings, 198824968 edges, 532260 markings/sec, 150 secs
lola: 92703824 markings, 205001627 edges, 533597 markings/sec, 155 secs
lola: 95382277 markings, 211202200 edges, 535691 markings/sec, 160 secs
lola: 98058399 markings, 217397297 edges, 535224 markings/sec, 165 secs
lola: 100739016 markings, 223603038 edges, 536123 markings/sec, 170 secs
lola: 103299405 markings, 229530461 edges, 512078 markings/sec, 175 secs
lola: 105883284 markings, 235512089 edges, 516776 markings/sec, 180 secs
lola: 108467757 markings, 241495194 edges, 516895 markings/sec, 185 secs
lola: 111069278 markings, 247517800 edges, 520304 markings/sec, 190 secs
lola: 113662793 markings, 253521829 edges, 518703 markings/sec, 195 secs
lola: 116275182 markings, 259569615 edges, 522478 markings/sec, 200 secs
lola: 118883964 markings, 265609054 edges, 521756 markings/sec, 205 secs
lola: 121485378 markings, 271631202 edges, 520283 markings/sec, 210 secs
lola: 122222302 markings, 273337220 edges, 147385 markings/sec, 215 secs
lola: 122480001 markings, 273934005 edges, 51540 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no unknown no no no no no yes no no no no yes yes yes
lola:
preliminary result: unknown no unknown no no no no no yes no no no no yes yes yes
lola: memory consumption: 22756 KB
lola: time consumption: 1360 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589720215403

--------------------
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="HouseConstruction-PT-32000"
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 HouseConstruction-PT-32000, 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 r105-oct2-158940199600061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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