About the Execution of LoLA for BridgeAndVehicles-COL-V20P10N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4328.210 | 564577.00 | 595218.00 | 85.00 | FTTFFFTTTTTTTTTF | 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.r016-csrt-155225065400339.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 BridgeAndVehicles-COL-V20P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-csrt-155225065400339
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 4.2K Feb 9 07:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 9 07:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 5 04:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 5 04:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 118 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 356 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 22:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 2 01:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 2 01:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jan 29 12:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 29 12:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 39K 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 BridgeAndVehicles-COL-V20P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552514961139
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P10N10 @ 3570 seconds
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3006
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V20P10N10
{
"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": "Wed Mar 13 22:09:21 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"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": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"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": "(1 <= p27 + p28)",
"processed_size": 16,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"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": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"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": "(p5 <= p0)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"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": "(p54 <= 1)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"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": "(p54 <= p55)",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((X (G ((p56 <= p1))) U ((p55 <= p29) U (1 <= p29))))",
"processed_size": 55,
"rewrites": 30
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 505
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (F ((p3 + p4 <= p27 + p28))))",
"processed_size": 34,
"rewrites": 30
},
"result":
{
"edges": 1283,
"markings": 884,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 3,
"markings": 4,
"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": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "A ((X (G ((1 <= p2))) U ((1 <= p2) U (1 <= p27 + p28))))",
"processed_size": 56,
"rewrites": 30
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"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": 885
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p54 + 1 <= p29)",
"processed_size": 16,
"rewrites": 32
},
"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": 42
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1180
},
"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 (F (G ((p0 <= 1))))",
"processed_size": 21,
"rewrites": 30
},
"result":
{
"edges": 101266740,
"markings": 12676352,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1702
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"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 (((1 <= p54) U ((2 <= p2) U (p32 <= p1))))",
"processed_size": 44,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3404
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3404
},
"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 (F (G ((p29 <= 1))))",
"processed_size": 22,
"rewrites": 30
},
"result":
{
"edges": 51245310,
"markings": 9279226,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},
{
"child":
[
{
"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 (F (G ((p29 <= 1))))",
"processed_size": 22,
"rewrites": 30
},
"result":
{
"edges": 51245310,
"markings": 9279226,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((F ((p0 <= p27 + p28)) OR G ((p29 <= 1)))))",
"processed_size": 49,
"rewrites": 30
},
"result":
{
"edges": 109035227,
"markings": 19353831,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 79108,
"runtime": 564.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : TRUE : A(X(TRUE)) : A((X(G(**)) U (** U **))) : ** : FALSE : A(F(**)) : A((** U (** U **))) : A(X(F(**))) : A(F(G(**))) : ** : ** : ** : (A(F(G(**))) AND A(G((F(**) OR G(**))))) : A(X(TRUE)) : A((X(G(**)) U (** U **)))"
},
"net":
{
"arcs": 4070,
"conflict_clusters": 5,
"places": 68,
"places_significant": 61,
"singleton_clusters": 0,
"transitions": 548
},
"result":
{
"preliminary_value": "no yes yes no no no yes yes yes yes yes yes yes yes yes no ",
"value": "no yes yes no no no yes yes yes yes yes yes yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: Places: 68, Transitions: 548
lola: @ trans altern_cpt
lola: @ trans timeout_B
lola: @ trans enregistrement_B
lola: @ trans timeout_A
lola: @ trans liberation_B
lola: @ trans enregistrement_A
lola: @ trans liberation_A
lola: @ trans autorisation_B
lola: @ trans basculement
lola: @ trans decision
lola: @ trans autorisation_A
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 616/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p30 + p31)
lola: place invariant simplifies atomic proposition
lola: before: (p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p3 + p4 <= p66 + p65 + p64 + p63 + p62 + p61 + p57 + p58 + p59 + p60 + p67)
lola: after: (p3 + p4 <= 1)
lola: LP says that atomic proposition is always true: (p3 + p4 <= 1)
lola: LP says that atomic proposition is always false: (3 <= p30 + p31)
lola: place invariant simplifies atomic proposition
lola: before: (p0 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)
lola: after: (p0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p54 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)
lola: after: (p54 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p29 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)
lola: after: (p29 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p66 + p65 + p64 + p63 + p62 + p61 + p57 + p58 + p59 + p60 + p67 <= p2)
lola: after: (1 <= p2)
lola: A (G ((2 <= p30 + p31))) : A ((0 <= 0)) : A (X ((p3 + p4 <= 1))) : A ((G (X ((p56 <= p1))) U ((p55 <= p29) U (1 <= p29)))) : A ((1 <= p27 + p28)) : A (G ((X ((p0 <= p32)) U (3 <= p30 + p31)))) : A (F ((p29 <= p54))) : A (((1 <= p54) U ((2 <= p2) U (p32 <= p1)))) : A (F ((X ((1 <= p29)) U X ((p3 + p4 <= p27 + p28))))) : A (F (F (G (G ((p0 <= 1)))))) : A ((p5 <= p0)) : A ((p54 <= 1)) : A ((p54 <= p55)) : A (G ((F ((p0 <= p27 + p28)) U G ((p29 <= 1))))) : A (F (X (G (X ((0 <= 0)))))) : A ((G (X ((1 <= p2))) U ((1 <= p2) U (1 <= p27 + p28))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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: 30 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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p27 + p28)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p27 + p28)
lola: processed formula length: 16
lola: 30 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 3 will run for 272 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: 30 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 <= p0)
lola: processed formula length: 10
lola: 30 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p54 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p54 <= 1)
lola: processed formula length: 10
lola: 30 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p54 <= p55)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p54 <= p55)
lola: processed formula length: 12
lola: 30 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 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 30 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p56 <= p1))) U ((p55 <= p29) U (1 <= p29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((p56 <= p1))) U ((p55 <= p29) U (1 <= p29))))
lola: processed formula length: 55
lola: 30 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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p3 + p4 <= p27 + p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p3 + p4 <= p27 + p28))))
lola: processed formula length: 34
lola: 30 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 884 markings, 1283 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 30 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= p2))) U ((1 <= p2) U (1 <= p27 + p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((1 <= p2))) U ((1 <= p2) U (1 <= p27 + p28))))
lola: processed formula length: 56
lola: 30 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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p29 <= p54)))
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: (p54 + 1 <= p29)
lola: processed formula length: 16
lola: 32 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 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p0 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p0 <= 1))))
lola: processed formula length: 21
lola: 30 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: 512497 markings, 3789597 edges, 102499 markings/sec, 0 secs
lola: 1000034 markings, 7495987 edges, 97507 markings/sec, 5 secs
lola: 1461411 markings, 11038695 edges, 92275 markings/sec, 10 secs
lola: 1929149 markings, 14675860 edges, 93548 markings/sec, 15 secs
lola: 2380261 markings, 18200583 edges, 90222 markings/sec, 20 secs
lola: 2859652 markings, 22018109 edges, 95878 markings/sec, 25 secs
lola: 3317965 markings, 25583953 edges, 91663 markings/sec, 30 secs
lola: 3766131 markings, 29227385 edges, 89633 markings/sec, 35 secs
lola: 4239622 markings, 33048157 edges, 94698 markings/sec, 40 secs
lola: 4685835 markings, 36519518 edges, 89243 markings/sec, 45 secs
lola: 5167050 markings, 40479811 edges, 96243 markings/sec, 50 secs
lola: 5602621 markings, 43885958 edges, 87114 markings/sec, 55 secs
lola: 6089159 markings, 47918665 edges, 97308 markings/sec, 60 secs
lola: 6520785 markings, 51287812 edges, 86325 markings/sec, 65 secs
lola: 6989961 markings, 55230855 edges, 93835 markings/sec, 70 secs
lola: 7425792 markings, 58704561 edges, 87166 markings/sec, 75 secs
lola: 7910429 markings, 62614233 edges, 96927 markings/sec, 80 secs
lola: 8356317 markings, 66247673 edges, 89178 markings/sec, 85 secs
lola: 8811995 markings, 69802753 edges, 91136 markings/sec, 90 secs
lola: 9279896 markings, 73821688 edges, 93580 markings/sec, 95 secs
lola: 9724355 markings, 77361562 edges, 88892 markings/sec, 100 secs
lola: 10201163 markings, 81160830 edges, 95362 markings/sec, 105 secs
lola: 10652684 markings, 84951874 edges, 90304 markings/sec, 110 secs
lola: 11087454 markings, 88378979 edges, 86954 markings/sec, 115 secs
lola: 11591017 markings, 92514674 edges, 100713 markings/sec, 120 secs
lola: 12076100 markings, 96527616 edges, 97017 markings/sec, 125 secs
lola: 12537130 markings, 100144890 edges, 92206 markings/sec, 130 secs
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: 12676352 markings, 101266740 edges
lola: ========================================
lola: subprocess 14 will run for 1702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p54) U ((2 <= p2) U (p32 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p54) U ((2 <= p2) U (p32 <= p1))))
lola: processed formula length: 44
lola: 30 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((p29 <= 1)))) AND A (G ((F ((p0 <= p27 + p28)) OR G ((p29 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p29 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p29 <= 1))))
lola: processed formula length: 22
lola: 30 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: 512765 markings, 2426854 edges, 102553 markings/sec, 0 secs
lola: 998082 markings, 4697093 edges, 97063 markings/sec, 5 secs
lola: 1464333 markings, 7006619 edges, 93250 markings/sec, 10 secs
lola: 1895605 markings, 9434236 edges, 86254 markings/sec, 15 secs
lola: 2351915 markings, 11915950 edges, 91262 markings/sec, 20 secs
lola: 2810210 markings, 14358238 edges, 91659 markings/sec, 25 secs
lola: 3244848 markings, 16722339 edges, 86928 markings/sec, 30 secs
lola: 3660317 markings, 19251260 edges, 83094 markings/sec, 35 secs
lola: 4082330 markings, 21486593 edges, 84403 markings/sec, 40 secs
lola: 4505590 markings, 23837767 edges, 84652 markings/sec, 45 secs
lola: 4918038 markings, 26324616 edges, 82490 markings/sec, 50 secs
lola: 5373906 markings, 28734785 edges, 91174 markings/sec, 55 secs
lola: 5773934 markings, 31260407 edges, 80006 markings/sec, 60 secs
lola: 6220114 markings, 33571647 edges, 89236 markings/sec, 65 secs
lola: 6608199 markings, 36011897 edges, 77617 markings/sec, 70 secs
lola: 7040365 markings, 38298080 edges, 86433 markings/sec, 75 secs
lola: 7427364 markings, 40627500 edges, 77400 markings/sec, 80 secs
lola: 7823717 markings, 43083151 edges, 79271 markings/sec, 85 secs
lola: 8249198 markings, 45263898 edges, 85096 markings/sec, 90 secs
lola: 8611767 markings, 47643316 edges, 72514 markings/sec, 95 secs
lola: 9057465 markings, 49921162 edges, 89140 markings/sec, 100 secs
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: 9279226 markings, 51245310 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (G ((p29 <= 1)))) AND A (G ((F ((p0 <= p27 + p28)) OR G ((p29 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (G ((p29 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p29 <= 1))))
lola: processed formula length: 22
lola: 30 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: 490186 markings, 2323476 edges, 98037 markings/sec, 0 secs
lola: 964342 markings, 4535937 edges, 94831 markings/sec, 5 secs
lola: 1433179 markings, 6857536 edges, 93767 markings/sec, 10 secs
lola: 1869229 markings, 9272155 edges, 87210 markings/sec, 15 secs
lola: 2308806 markings, 11634723 edges, 87915 markings/sec, 20 secs
lola: 2769586 markings, 14087476 edges, 92156 markings/sec, 25 secs
lola: 3221375 markings, 16570219 edges, 90358 markings/sec, 30 secs
lola: 3647098 markings, 19194469 edges, 85145 markings/sec, 35 secs
lola: 4091407 markings, 21547284 edges, 88862 markings/sec, 40 secs
lola: 4547562 markings, 24018630 edges, 91231 markings/sec, 45 secs
lola: 4960335 markings, 26607069 edges, 82555 markings/sec, 50 secs
lola: 5427327 markings, 29079543 edges, 93398 markings/sec, 55 secs
lola: 5835228 markings, 31661073 edges, 81580 markings/sec, 60 secs
lola: 6294845 markings, 34050370 edges, 91923 markings/sec, 65 secs
lola: 6694521 markings, 36586160 edges, 79935 markings/sec, 70 secs
lola: 7159401 markings, 38983456 edges, 92976 markings/sec, 75 secs
lola: 7561031 markings, 41517307 edges, 80326 markings/sec, 80 secs
lola: 8009694 markings, 43880263 edges, 89733 markings/sec, 85 secs
lola: 8406143 markings, 46273286 edges, 79290 markings/sec, 90 secs
lola: 8794185 markings, 48782670 edges, 77608 markings/sec, 95 secs
lola: 9219760 markings, 50917035 edges, 85115 markings/sec, 100 secs
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: 9279226 markings, 51245310 edges
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p0 <= p27 + p28)) OR G ((p29 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((p0 <= p27 + p28)) OR G ((p29 <= 1)))))
lola: processed formula length: 49
lola: 30 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: ========================================
lola: 718239 markings, 2713458 edges, 143648 markings/sec, 0 secs
lola: 1392096 markings, 5273134 edges, 134771 markings/sec, 5 secs
lola: 2057077 markings, 7883385 edges, 132996 markings/sec, 10 secs
lola: 2739444 markings, 10787262 edges, 136473 markings/sec, 15 secs
lola: 3396017 markings, 13534415 edges, 131315 markings/sec, 20 secs
lola: 4037485 markings, 16220111 edges, 128294 markings/sec, 25 secs
lola: 4678482 markings, 18790886 edges, 128199 markings/sec, 30 secs
lola: 5292155 markings, 21475438 edges, 122735 markings/sec, 35 secs
lola: 5934326 markings, 24384924 edges, 128434 markings/sec, 40 secs
lola: 6560691 markings, 26842326 edges, 125273 markings/sec, 45 secs
lola: 7146297 markings, 29531034 edges, 117121 markings/sec, 50 secs
lola: 7763681 markings, 32137399 edges, 123477 markings/sec, 55 secs
lola: 8357590 markings, 34725905 edges, 118782 markings/sec, 60 secs
lola: 8986218 markings, 37487612 edges, 125726 markings/sec, 65 secs
lola: 9577726 markings, 40034422 edges, 118302 markings/sec, 70 secs
lola: 10192748 markings, 42707506 edges, 123004 markings/sec, 75 secs
lola: 10783838 markings, 45366915 edges, 118218 markings/sec, 80 secs
lola: 11437488 markings, 48077557 edges, 130730 markings/sec, 85 secs
lola: 12054997 markings, 50993730 edges, 123502 markings/sec, 90 secs
lola: 12681087 markings, 53659745 edges, 125218 markings/sec, 95 secs
lola: 13114986 markings, 56984202 edges, 86780 markings/sec, 100 secs
lola: 13527832 markings, 60158998 edges, 82569 markings/sec, 105 secs
lola: 13932773 markings, 63390076 edges, 80988 markings/sec, 110 secs
lola: 14345510 markings, 66708023 edges, 82547 markings/sec, 115 secs
lola: 14743361 markings, 70012789 edges, 79570 markings/sec, 120 secs
lola: 15139213 markings, 73281662 edges, 79170 markings/sec, 125 secs
lola: 15525520 markings, 76522858 edges, 77261 markings/sec, 130 secs
lola: 15908616 markings, 79835205 edges, 76619 markings/sec, 135 secs
lola: 16292847 markings, 83147273 edges, 76846 markings/sec, 140 secs
lola: 16694663 markings, 86359882 edges, 80363 markings/sec, 145 secs
lola: 17061081 markings, 89585692 edges, 73284 markings/sec, 150 secs
lola: 17445004 markings, 92894554 edges, 76785 markings/sec, 155 secs
lola: 17835018 markings, 96053274 edges, 78003 markings/sec, 160 secs
lola: 18220531 markings, 99585005 edges, 77103 markings/sec, 165 secs
lola: 18621419 markings, 102788200 edges, 80178 markings/sec, 170 secs
lola: 18999960 markings, 106203270 edges, 75708 markings/sec, 175 secs
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: 19353831 markings, 109035227 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no no yes yes yes yes yes yes yes yes yes no
lola:
preliminary result: no yes yes no no no yes yes yes yes yes yes yes yes yes no
lola: memory consumption: 79108 KB
lola: time consumption: 564 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1552515525716
--------------------
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="BridgeAndVehicles-COL-V20P10N10"
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 BridgeAndVehicles-COL-V20P10N10, 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 r016-csrt-155225065400339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N10.tgz
mv BridgeAndVehicles-COL-V20P10N10 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 '
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 ;