fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r082-csrt-155246550200924
Last Updated
Apr 15, 2019

About the Execution of LoLA for JoinFreeModules-PT-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.200 870455.00 887245.00 1159.30 FTFFFFTF?TTTTTF? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.0K Feb 11 05:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 11 05:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 7 05:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 7 05:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 3 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 3 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 31 06:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 31 06:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 57K Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552684752299

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-0010 @ 3570 seconds

FORMULA JoinFreeModules-PT-0010-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2700
rslt: Output for LTLCardinality @ JoinFreeModules-PT-0010

{
"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 Mar 15 21:19:12 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(p3 <= p15)",
"processed_size": 11,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (G ((p36 <= p40))))",
"processed_size": 24,
"rewrites": 26
},
"result":
{
"edges": 5,
"markings": 5,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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 (X (G ((F ((2 <= p41)) AND ((p15 <= p28) OR (2 <= p41))))))",
"processed_size": 61,
"rewrites": 26
},
"result":
{
"edges": 4149,
"markings": 3522,
"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": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F ((p47 <= p21)))))",
"processed_size": 28,
"rewrites": 26
},
"result":
{
"edges": 30,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 424
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((X (F ((p25 <= p45))) U ((3 <= p42) U (p14 <= 1))))",
"processed_size": 54,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((F ((3 <= p32)) U X (G ((1 <= p43)))))",
"processed_size": 41,
"rewrites": 26
},
"result":
{
"edges": 9387,
"markings": 7940,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((X (F ((1 <= p32))) U ((p25 <= p42) U (2 <= p31))))",
"processed_size": 54,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 679
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((3 <= p41)))",
"processed_size": 18,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 849
},
"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": "(p32 <= 0)",
"processed_size": 10,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1133
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((F ((1 <= p35)) OR (G ((2 <= p36)) AND F ((1 <= p35))))))",
"processed_size": 63,
"rewrites": 26
},
"result":
{
"edges": 42278,
"markings": 24524,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3134
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "A (((p35 <= p5) OR (G ((p15 <= p48)) AND F ((p35 <= p5)))))",
"processed_size": 59,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 17900,
"runtime": 870.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G(**))) : A(F(**)) : ** : A(X(X(F(**)))) : A(G((F(**) OR (G(**) AND F(**))))) : A((F(**) U X(G(**)))) : ** : A(X(G((F(**) AND (** OR **))))) : A(X(G((F(**) AND (** OR **))))) : ** : A((X(F(**)) U (** U **))) : ** : A((X(F(**)) U (** U **))) : A((** OR (G(**) AND F(**)))) : A(G(**)) : A(G(F(**)))"
},
"net":
{
"arcs": 232,
"conflict_clusters": 41,
"places": 51,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no yes no no no no yes no unknown yes yes yes yes yes no unknown ",
"value": "no yes no no no no yes no unknown yes yes yes yes yes no unknown "
},
"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: 132/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1632
lola: finding significant places
lola: 51 places, 81 transitions, 40 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: place invariant simplifies atomic proposition
lola: before: (p <= p35)
lola: after: (1 <= p35)
lola: place invariant simplifies atomic proposition
lola: before: (p14 <= p)
lola: after: (p14 <= 1)
lola: A (X (G (G ((p36 <= p40))))) : A (F (F (F (F ((1 <= p32)))))) : A ((p3 <= p15)) : A (F (F (X (X ((p47 <= p21)))))) : A (G ((G ((2 <= p36)) U F ((1 <= p35))))) : A ((F ((3 <= p32)) U X (G ((1 <= p43))))) : A ((1 <= p37)) : A (G ((X ((p15 <= p28)) U X ((2 <= p41))))) : A (G (X (((2 <= p41) U (p17 <= p11))))) : A ((1 <= p21)) : A ((X (F ((p25 <= p45))) U ((3 <= p42) U (p14 <= 1)))) : A ((p4 <= p3)) : A ((F (X ((1 <= p32))) U ((p25 <= p42) U (2 <= p31)))) : A ((G (G ((p15 <= p48))) U (p35 <= p5))) : A (G ((3 <= p41))) : A (G (((p47 <= p32) U F ((p5 <= p40)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p3 <= p15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 <= p15)
lola: processed formula length: 11
lola: 26 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: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p37)
lola: processed formula length: 10
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p21)
lola: processed formula length: 10
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p4 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4 <= p3)
lola: processed formula length: 10
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p36 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p36 <= p40))))
lola: processed formula length: 24
lola: 26 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((2 <= p41)) AND ((p15 <= p28) OR (2 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((2 <= p41)) AND ((p15 <= p28) OR (2 <= p41))))))
lola: processed formula length: 61
lola: 26 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: 3522 markings, 4149 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p17 <= p11)) AND ((2 <= p41) OR (p17 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p17 <= p11)) AND ((2 <= p41) OR (p17 <= p11))))))
lola: processed formula length: 63
lola: 26 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: 2992291 markings, 3544896 edges, 598458 markings/sec, 0 secs
lola: 5663718 markings, 6709704 edges, 534285 markings/sec, 5 secs
lola: 8165855 markings, 9673966 edges, 500427 markings/sec, 10 secs
lola: 10410301 markings, 12332974 edges, 448889 markings/sec, 15 secs
lola: 12496493 markings, 14804452 edges, 417238 markings/sec, 20 secs
lola: 14342951 markings, 16991922 edges, 369292 markings/sec, 25 secs
lola: 16220752 markings, 19216571 edges, 375560 markings/sec, 30 secs
lola: 18237123 markings, 21605320 edges, 403274 markings/sec, 35 secs
lola: 20379917 markings, 24143889 edges, 428559 markings/sec, 40 secs
lola: 22786721 markings, 26995209 edges, 481361 markings/sec, 45 secs
lola: 24933443 markings, 29538424 edges, 429344 markings/sec, 50 secs
lola: 27097285 markings, 32101916 edges, 432768 markings/sec, 55 secs
lola: 28964073 markings, 34313489 edges, 373358 markings/sec, 60 secs
lola: 30611643 markings, 36265347 edges, 329514 markings/sec, 65 secs
lola: 32307098 markings, 38273942 edges, 339091 markings/sec, 70 secs
lola: 33998380 markings, 40277609 edges, 338256 markings/sec, 75 secs
lola: 35813269 markings, 42427679 edges, 362978 markings/sec, 80 secs
lola: 37669925 markings, 44627260 edges, 371331 markings/sec, 85 secs
lola: 39414565 markings, 46694113 edges, 348928 markings/sec, 90 secs
lola: 41139758 markings, 48737921 edges, 345039 markings/sec, 95 secs
lola: 43139789 markings, 51107366 edges, 400006 markings/sec, 100 secs
lola: 44942105 markings, 53242548 edges, 360463 markings/sec, 105 secs
lola: 47011654 markings, 55694333 edges, 413910 markings/sec, 110 secs
lola: 49041849 markings, 58099489 edges, 406039 markings/sec, 115 secs
lola: 50675454 markings, 60034823 edges, 326721 markings/sec, 120 secs
lola: 52294705 markings, 61953129 edges, 323850 markings/sec, 125 secs
lola: 53970841 markings, 63938843 edges, 335227 markings/sec, 130 secs
lola: 55756527 markings, 66054341 edges, 357137 markings/sec, 135 secs
lola: 57478402 markings, 68094225 edges, 344375 markings/sec, 140 secs
lola: 59171539 markings, 70100083 edges, 338627 markings/sec, 145 secs
lola: 60901112 markings, 72149078 edges, 345915 markings/sec, 150 secs
lola: 62486739 markings, 74027595 edges, 317125 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p47 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p47 <= p21)))))
lola: processed formula length: 28
lola: 26 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: 29 markings, 30 edges
lola: ========================================
lola: subprocess 8 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p25 <= p45))) U ((3 <= p42) U (p14 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((p25 <= p45))) U ((3 <= p42) U (p14 <= 1))))
lola: processed formula length: 54
lola: 26 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= p32)) U X (G ((1 <= p43)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= p32)) U X (G ((1 <= p43)))))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7940 markings, 9387 edges
lola: ========================================
lola: subprocess 10 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= p32))) U ((p25 <= p42) U (2 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((1 <= p32))) U ((p25 <= p42) U (2 <= p31))))
lola: processed formula length: 54
lola: 26 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p41)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((3 <= p41)))
lola: processed formula length: 18
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: 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: (p41 <= 2)
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: 0 markings, 0 edges
lola: state equation: write sara problem file to LTLCardinality-11-0.sara
lola: subprocess 12 will run for 849 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p32)))
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: (p32 <= 0)
lola: processed formula length: 10
lola: 28 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 13 will run for 1133 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= p35)) OR (G ((2 <= p36)) AND F ((1 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((1 <= p35)) OR (G ((2 <= p36)) AND F ((1 <= p35))))))
lola: processed formula length: 63
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file LTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

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: 24524 markings, 42278 edges
lola: subprocess 14 will run for 1699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p5 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p5 <= p40))))
lola: processed formula length: 23
lola: 26 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: ========================================
lola: 2443097 markings, 4219675 edges, 488619 markings/sec, 0 secs
lola: 4902588 markings, 8468914 edges, 491898 markings/sec, 5 secs
lola: 7431174 markings, 12840498 edges, 505717 markings/sec, 10 secs
lola: 9785568 markings, 16905706 edges, 470879 markings/sec, 15 secs
lola: 12270053 markings, 21197175 edges, 496897 markings/sec, 20 secs
lola: 14629035 markings, 25272412 edges, 471796 markings/sec, 25 secs
lola: 16880256 markings, 29160899 edges, 450244 markings/sec, 30 secs
lola: 19251555 markings, 33260410 edges, 474260 markings/sec, 35 secs
lola: 21492799 markings, 37130593 edges, 448249 markings/sec, 40 secs
lola: 23826111 markings, 41162039 edges, 466662 markings/sec, 45 secs
lola: 26209651 markings, 45282800 edges, 476708 markings/sec, 50 secs
lola: 28413985 markings, 49090011 edges, 440867 markings/sec, 55 secs
lola: 30548004 markings, 52774186 edges, 426804 markings/sec, 60 secs
lola: 32601589 markings, 56320882 edges, 410717 markings/sec, 65 secs
lola: 34602746 markings, 59775283 edges, 400231 markings/sec, 70 secs
lola: 36658121 markings, 63326885 edges, 411075 markings/sec, 75 secs
lola: 38697292 markings, 66852353 edges, 407834 markings/sec, 80 secs
lola: 40779486 markings, 70452005 edges, 416439 markings/sec, 85 secs
lola: 42849442 markings, 74024303 edges, 413991 markings/sec, 90 secs
lola: 45179408 markings, 78047745 edges, 465993 markings/sec, 95 secs
lola: 47444889 markings, 81961630 edges, 453096 markings/sec, 100 secs
lola: 49634412 markings, 85745554 edges, 437905 markings/sec, 105 secs
lola: 51857122 markings, 89588216 edges, 444542 markings/sec, 110 secs
lola: 54217019 markings, 93667913 edges, 471979 markings/sec, 115 secs
lola: 56640578 markings, 97857866 edges, 484712 markings/sec, 120 secs
lola: 59123279 markings, 102149944 edges, 496540 markings/sec, 125 secs
lola: 61469967 markings, 106206926 edges, 469338 markings/sec, 130 secs
lola: 63917923 markings, 110439031 edges, 489591 markings/sec, 135 secs
lola: 66129468 markings, 114262436 edges, 442309 markings/sec, 140 secs
lola: 68452252 markings, 118278036 edges, 464557 markings/sec, 145 secs
lola: 70583548 markings, 121962688 edges, 426259 markings/sec, 150 secs
lola: 72826457 markings, 125840225 edges, 448582 markings/sec, 155 secs
lola: 74979356 markings, 129562166 edges, 430580 markings/sec, 160 secs
lola: 77172841 markings, 133354264 edges, 438697 markings/sec, 165 secs
lola: 79347095 markings, 137113256 edges, 434851 markings/sec, 170 secs
lola: 81448452 markings, 140746036 edges, 420271 markings/sec, 175 secs
lola: 83509746 markings, 144309594 edges, 412259 markings/sec, 180 secs
lola: 85496912 markings, 147745151 edges, 397433 markings/sec, 185 secs
lola: 87471952 markings, 151159599 edges, 395008 markings/sec, 190 secs
lola: 89591888 markings, 154824594 edges, 423987 markings/sec, 195 secs
lola: 91727583 markings, 158516709 edges, 427139 markings/sec, 200 secs
lola: 93979804 markings, 162410511 edges, 450444 markings/sec, 205 secs
lola: 96239829 markings, 166317664 edges, 452005 markings/sec, 210 secs
lola: 98576392 markings, 170357058 edges, 467313 markings/sec, 215 secs
lola: 100995546 markings, 174539345 edges, 483831 markings/sec, 220 secs
lola: 103438031 markings, 178761940 edges, 488497 markings/sec, 225 secs
lola: 105798580 markings, 182842861 edges, 472110 markings/sec, 230 secs
lola: 108070825 markings, 186771186 edges, 454449 markings/sec, 235 secs
lola: 110221009 markings, 190488384 edges, 430037 markings/sec, 240 secs
lola: 112248236 markings, 193993151 edges, 405445 markings/sec, 245 secs
lola: 114516955 markings, 197915379 edges, 453744 markings/sec, 250 secs
lola: 116753796 markings, 201782380 edges, 447368 markings/sec, 255 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p35 <= p5) OR (G ((p15 <= p48)) AND F ((p35 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p35 <= p5) OR (G ((p15 <= p48)) AND F ((p35 <= p5)))))
lola: processed formula length: 59
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: ========================================
lola: ...considering subproblem: A (X (G ((F ((p17 <= p11)) AND ((2 <= p41) OR (p17 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p17 <= p11)) AND ((2 <= p41) OR (p17 <= p11))))))
lola: processed formula length: 63
lola: 26 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: 3062089 markings, 3627566 edges, 612418 markings/sec, 0 secs
lola: 5814451 markings, 6888282 edges, 550472 markings/sec, 5 secs
lola: 8365747 markings, 9910788 edges, 510259 markings/sec, 10 secs
lola: 10768619 markings, 12757443 edges, 480574 markings/sec, 15 secs
lola: 13313700 markings, 15772597 edges, 509016 markings/sec, 20 secs
lola: 15537168 markings, 18406718 edges, 444694 markings/sec, 25 secs
lola: 17707411 markings, 20977786 edges, 434049 markings/sec, 30 secs
lola: 19986185 markings, 23677440 edges, 455755 markings/sec, 35 secs
lola: 22419637 markings, 26560348 edges, 486690 markings/sec, 40 secs
lola: 24627398 markings, 29175855 edges, 441552 markings/sec, 45 secs
lola: 26682384 markings, 31610377 edges, 410997 markings/sec, 50 secs
lola: 28639373 markings, 33928801 edges, 391398 markings/sec, 55 secs
lola: 30419739 markings, 36038010 edges, 356073 markings/sec, 60 secs
lola: 32361178 markings, 38338016 edges, 388288 markings/sec, 65 secs
lola: 34266118 markings, 40594791 edges, 380988 markings/sec, 70 secs
lola: 36409099 markings, 43133566 edges, 428596 markings/sec, 75 secs
lola: 38329403 markings, 45408533 edges, 384061 markings/sec, 80 secs
lola: 40170387 markings, 47589525 edges, 368197 markings/sec, 85 secs
lola: 42145708 markings, 49929678 edges, 395064 markings/sec, 90 secs
lola: 44220333 markings, 52387465 edges, 414925 markings/sec, 95 secs
lola: 46292800 markings, 54842709 edges, 414493 markings/sec, 100 secs
lola: 48575107 markings, 57546548 edges, 456461 markings/sec, 105 secs
lola: 50452161 markings, 59770284 edges, 375411 markings/sec, 110 secs
lola: 52234583 markings, 61881900 edges, 356484 markings/sec, 115 secs
lola: 54087466 markings, 64076998 edges, 370577 markings/sec, 120 secs
lola: 56051621 markings, 66403928 edges, 392831 markings/sec, 125 secs
lola: 57969880 markings, 68676476 edges, 383652 markings/sec, 130 secs
lola: 59941607 markings, 71012355 edges, 394345 markings/sec, 135 secs
lola: 61714433 markings, 73112631 edges, 354565 markings/sec, 140 secs
lola: 63315956 markings, 75009940 edges, 320305 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F ((p5 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p5 <= p40))))
lola: processed formula length: 23
lola: 26 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: 2659983 markings, 4594652 edges, 531997 markings/sec, 0 secs
lola: 4981132 markings, 8604715 edges, 464230 markings/sec, 5 secs
lola: 7237669 markings, 12505900 edges, 451307 markings/sec, 10 secs
lola: 9417895 markings, 16271306 edges, 436045 markings/sec, 15 secs
lola: 11671737 markings, 20163268 edges, 450768 markings/sec, 20 secs
lola: 14003110 markings, 24191165 edges, 466275 markings/sec, 25 secs
lola: 16231725 markings, 28039698 edges, 445723 markings/sec, 30 secs
lola: 18513524 markings, 31984553 edges, 456360 markings/sec, 35 secs
lola: 20811146 markings, 35954453 edges, 459524 markings/sec, 40 secs
lola: 23067240 markings, 39850074 edges, 451219 markings/sec, 45 secs
lola: 25466609 markings, 43998169 edges, 479874 markings/sec, 50 secs
lola: 27769423 markings, 47977747 edges, 460563 markings/sec, 55 secs
lola: 30101556 markings, 52002999 edges, 466427 markings/sec, 60 secs
lola: 32378421 markings, 55935129 edges, 455373 markings/sec, 65 secs
lola: 34600118 markings, 59770793 edges, 444339 markings/sec, 70 secs
lola: 36819346 markings, 63605613 edges, 443846 markings/sec, 75 secs
lola: 39069368 markings, 67495500 edges, 450004 markings/sec, 80 secs
lola: 41300963 markings, 71352347 edges, 446319 markings/sec, 85 secs
lola: 43462016 markings, 75081197 edges, 432211 markings/sec, 90 secs
lola: 45782221 markings, 79089299 edges, 464041 markings/sec, 95 secs
lola: 48025715 markings, 82965249 edges, 448699 markings/sec, 100 secs
lola: 50357529 markings, 86995682 edges, 466363 markings/sec, 105 secs
lola: 52709875 markings, 91062532 edges, 470469 markings/sec, 110 secs
lola: 55294772 markings, 95531196 edges, 516979 markings/sec, 115 secs
lola: 57800018 markings, 99862366 edges, 501049 markings/sec, 120 secs
lola: 60110350 markings, 103856425 edges, 462066 markings/sec, 125 secs
lola: 62333630 markings, 107700061 edges, 444656 markings/sec, 130 secs
lola: 64567291 markings, 111561719 edges, 446732 markings/sec, 135 secs
lola: 66791030 markings, 115406068 edges, 444748 markings/sec, 140 secs
lola: 69054074 markings, 119318477 edges, 452609 markings/sec, 145 secs
lola: 71123997 markings, 122896984 edges, 413985 markings/sec, 150 secs
lola: 73199413 markings, 126485004 edges, 415083 markings/sec, 155 secs
lola: 75426595 markings, 130335352 edges, 445436 markings/sec, 160 secs
lola: 77579231 markings, 134056941 edges, 430527 markings/sec, 165 secs
lola: 79688910 markings, 137704217 edges, 421936 markings/sec, 170 secs
lola: 81736000 markings, 141243160 edges, 409418 markings/sec, 175 secs
lola: 83790133 markings, 144794420 edges, 410827 markings/sec, 180 secs
lola: 85843401 markings, 148344070 edges, 410654 markings/sec, 185 secs
lola: 87858985 markings, 151828650 edges, 403117 markings/sec, 190 secs
lola: 90185425 markings, 155850694 edges, 465288 markings/sec, 195 secs
lola: 92409953 markings, 159696473 edges, 444906 markings/sec, 200 secs
lola: 94648875 markings, 163567182 edges, 447784 markings/sec, 205 secs
lola: 96864747 markings, 167398060 edges, 443174 markings/sec, 210 secs
lola: 99348792 markings, 171692400 edges, 496809 markings/sec, 215 secs
lola: 101917306 markings, 176132916 edges, 513703 markings/sec, 220 secs
lola: 104388000 markings, 180404240 edges, 494139 markings/sec, 225 secs
lola: 106746779 markings, 184482139 edges, 471756 markings/sec, 230 secs
lola: 108995951 markings, 188370570 edges, 449834 markings/sec, 235 secs
lola: 111160003 markings, 192111799 edges, 432810 markings/sec, 240 secs
lola: 113333272 markings, 195869020 edges, 434654 markings/sec, 245 secs
lola: 115678862 markings, 199924117 edges, 469118 markings/sec, 250 secs
lola: 117339224 markings, 202795870 edges, 332072 markings/sec, 255 secs
lola: 117340167 markings, 202796175 edges, 189 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no no no no yes no unknown yes yes yes yes yes no unknown
lola:
preliminary result: no yes no no no no yes no unknown yes yes yes yes yes no unknown
lola: memory consumption: 17900 KB
lola: time consumption: 870 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552685622754

--------------------
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="JoinFreeModules-PT-0010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is JoinFreeModules-PT-0010, 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 r082-csrt-155246550200924"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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
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 ;