About the Execution of LoLA for CircadianClock-PT-100000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15918.840 | 789338.00 | 783775.00 | 4827.10 | F?TTFFTFFFTT?FFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r027-smll-155225120900159.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is CircadianClock-PT-100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-155225120900159
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.4K Feb 9 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 9 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 5 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K Feb 4 23:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.1K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 2 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 2 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jan 29 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jan 29 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 11K 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 CircadianClock-PT-100000-LTLCardinality-00
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-01
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-02
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-03
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-04
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-05
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-06
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-07
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-08
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-09
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-10
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-11
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-12
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-13
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-14
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552535178497
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CircadianClock-PT-100000 @ 3570 seconds
FORMULA CircadianClock-PT-100000-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-100000-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2781
rslt: Output for LTLCardinality @ CircadianClock-PT-100000
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Mar 14 03:46:18 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": "(da_a <= c)",
"processed_size": 11,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": "(a <= r_cap)",
"processed_size": 12,
"rewrites": 29
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(a <= r)",
"processed_size": 8,
"rewrites": 29
},
"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": "(mr_cap <= r)",
"processed_size": 13,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 <= a)",
"processed_size": 8,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (F ((2 <= r))))",
"processed_size": 20,
"rewrites": 29
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X ((2 <= ma_cap)))",
"processed_size": 21,
"rewrites": 29
},
"result":
{
"edges": 2,
"markings": 3,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (F ((3 <= ma_cap))))",
"processed_size": 25,
"rewrites": 29
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 509
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((mr_cap <= ma))))",
"processed_size": 26,
"rewrites": 29
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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 ((1 <= dr_a))))",
"processed_size": 23,
"rewrites": 29
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((dr_a <= mr_cap))))",
"processed_size": 28,
"rewrites": 29
},
"result":
{
"edges": 200011,
"markings": 100009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((mr_cap <= mr))))",
"processed_size": 26,
"rewrites": 29
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1678
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((ma_cap <= a))))",
"processed_size": 25,
"rewrites": 29
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"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": 16624,
"runtime": 789.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(F(**))) : A(G(F(**))) : ** : ** : A(G(F(**))) : A(G(F(**))) : ** : ** : FALSE : ** : A(X(**)) : A(X(F(**))) : A((G(F(**)) OR (G(F(**)) AND F(G(**))))) : A(F(G(**))) : (A(G(F(**))) AND A(G((** OR X(**))))) : A(F(G(**)))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no unknown yes yes no no yes no no no yes yes unknown no no no ",
"value": "no unknown yes yes no no yes no no no yes yes unknown no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 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: (3 <= dr_a)
lola: A (X (F ((2 <= r)))) : A ((((2 <= c) U (dr <= r_cap)) U G (F ((c <= da))))) : A ((da_a <= c)) : A ((a <= r_cap)) : A (F (F (G (F ((ma_cap <= a)))))) : A (X (G (F (F ((dr_a <= mr_cap)))))) : A ((a <= r)) : A ((mr_cap <= r)) : A (F (G ((3 <= dr_a)))) : A ((1 <= a)) : A (X ((2 <= ma_cap))) : A (F (F (X (F ((3 <= ma_cap)))))) : A ((F (G ((3 <= r))) U G (F ((dr <= r_cap))))) : A (F ((X ((1 <= a_cap)) U G ((mr_cap <= mr))))) : A (G (((da_a <= mr) U X ((mr_cap <= ma))))) : A (X (G (F (G ((1 <= dr_a))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (da_a <= c)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (da_a <= c)
lola: processed formula length: 11
lola: 29 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (a <= r_cap)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a <= r_cap)
lola: processed formula length: 12
lola: 29 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: (a <= r)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a <= r)
lola: processed formula length: 8
lola: 29 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: (mr_cap <= r)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (mr_cap <= r)
lola: processed formula length: 13
lola: 29 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 4 will run for 297 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: 29 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= a)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= a)
lola: processed formula length: 8
lola: 29 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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= r))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= r))))
lola: processed formula length: 20
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= ma_cap)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= ma_cap)))
lola: processed formula length: 21
lola: 29 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= ma_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= ma_cap))))
lola: processed formula length: 25
lola: 29 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((mr_cap <= ma)))) AND A (G (((da_a <= mr) OR X ((mr_cap <= ma))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((mr_cap <= ma))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((mr_cap <= ma))))
lola: processed formula length: 26
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= dr_a))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= dr_a))))
lola: processed formula length: 23
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 13
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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((dr_a <= mr_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((dr_a <= mr_cap))))
lola: processed formula length: 28
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 100009 markings, 200011 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((mr_cap <= mr))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((mr_cap <= mr))))
lola: processed formula length: 26
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 13
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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((c <= da))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((c <= da))))
lola: processed formula length: 21
lola: 29 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: 3074411 markings, 5623085 edges, 614882 markings/sec, 0 secs
lola: 5674936 markings, 10824204 edges, 520105 markings/sec, 5 secs
lola: 8215522 markings, 15845168 edges, 508117 markings/sec, 10 secs
lola: 10655424 markings, 20763844 edges, 487980 markings/sec, 15 secs
lola: 13042749 markings, 25524496 edges, 477465 markings/sec, 20 secs
lola: 15451089 markings, 30347908 edges, 481668 markings/sec, 25 secs
lola: 17823412 markings, 35062982 edges, 474465 markings/sec, 30 secs
lola: 20101490 markings, 39695226 edges, 455616 markings/sec, 35 secs
lola: 22441372 markings, 44312424 edges, 467976 markings/sec, 40 secs
lola: 24672840 markings, 48804329 edges, 446294 markings/sec, 45 secs
lola: 26886051 markings, 53241225 edges, 442642 markings/sec, 50 secs
lola: 29228719 markings, 57865966 edges, 468534 markings/sec, 55 secs
lola: 31445498 markings, 62313058 edges, 443356 markings/sec, 60 secs
lola: 33655323 markings, 66739044 edges, 441965 markings/sec, 65 secs
lola: 35846737 markings, 71109556 edges, 438283 markings/sec, 70 secs
lola: 38003942 markings, 75440385 edges, 431441 markings/sec, 75 secs
lola: 40144951 markings, 79785717 edges, 428202 markings/sec, 80 secs
lola: 42331622 markings, 84151988 edges, 437334 markings/sec, 85 secs
lola: 44488093 markings, 88416728 edges, 431294 markings/sec, 90 secs
lola: 46593839 markings, 92648556 edges, 421149 markings/sec, 95 secs
lola: 48697626 markings, 96835729 edges, 420757 markings/sec, 100 secs
lola: 50751037 markings, 100991082 edges, 410682 markings/sec, 105 secs
lola: 52838206 markings, 105108392 edges, 417434 markings/sec, 110 secs
lola: 55066827 markings, 109542964 edges, 445724 markings/sec, 115 secs
lola: 57225711 markings, 113908041 edges, 431777 markings/sec, 120 secs
lola: 59346497 markings, 118154198 edges, 424157 markings/sec, 125 secs
lola: 61452668 markings, 122347494 edges, 421234 markings/sec, 130 secs
lola: 63520383 markings, 126463153 edges, 413543 markings/sec, 135 secs
lola: 65538055 markings, 130509807 edges, 403534 markings/sec, 140 secs
lola: 67663460 markings, 134778343 edges, 425081 markings/sec, 145 secs
lola: 69723338 markings, 138851650 edges, 411976 markings/sec, 150 secs
lola: 71683000 markings, 142811843 edges, 391932 markings/sec, 155 secs
lola: 73731740 markings, 146867862 edges, 409748 markings/sec, 160 secs
lola: 75671535 markings, 150815138 edges, 387959 markings/sec, 165 secs
lola: 77554797 markings, 154517675 edges, 376652 markings/sec, 170 secs
lola: 79643671 markings, 158776537 edges, 417775 markings/sec, 175 secs
lola: 81769600 markings, 162945557 edges, 425186 markings/sec, 180 secs
lola: 83738031 markings, 166913554 edges, 393686 markings/sec, 185 secs
lola: 84587359 markings, 168587323 edges, 169866 markings/sec, 190 secs
lola: 84587419 markings, 168587503 edges, 12 markings/sec, 195 secs
lola: 84593604 markings, 168606061 edges, 1237 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((ma_cap <= a))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((ma_cap <= a))))
lola: processed formula length: 25
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 15 will run for 3356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((dr <= r_cap))) OR (G (F ((dr <= r_cap))) AND F (G ((3 <= r))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((dr <= r_cap))) OR (G (F ((dr <= r_cap))) AND F (G ((3 <= r))))))
lola: processed formula length: 75
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 2823867 markings, 6171580 edges, 564773 markings/sec, 0 secs
lola: 5428964 markings, 12015743 edges, 521019 markings/sec, 5 secs
lola: 7869567 markings, 17578110 edges, 488121 markings/sec, 10 secs
lola: 10272927 markings, 22991511 edges, 480672 markings/sec, 15 secs
lola: 12397462 markings, 27697797 edges, 424907 markings/sec, 20 secs
lola: 14541984 markings, 32542379 edges, 428904 markings/sec, 25 secs
lola: 16877489 markings, 37832411 edges, 467101 markings/sec, 30 secs
lola: 19205531 markings, 43016529 edges, 465608 markings/sec, 35 secs
lola: 21491324 markings, 48264901 edges, 457159 markings/sec, 40 secs
lola: 23815038 markings, 53359716 edges, 464743 markings/sec, 45 secs
lola: 26081191 markings, 58543495 edges, 453231 markings/sec, 50 secs
lola: 28434797 markings, 63804307 edges, 470721 markings/sec, 55 secs
lola: 30708417 markings, 69009258 edges, 454724 markings/sec, 60 secs
lola: 33046905 markings, 74187023 edges, 467698 markings/sec, 65 secs
lola: 35299745 markings, 79299134 edges, 450568 markings/sec, 70 secs
lola: 37521826 markings, 84322853 edges, 444416 markings/sec, 75 secs
lola: 39850919 markings, 89502957 edges, 465819 markings/sec, 80 secs
lola: 42093513 markings, 94580420 edges, 448519 markings/sec, 85 secs
lola: 44281952 markings, 99527015 edges, 437688 markings/sec, 90 secs
lola: 46569973 markings, 104571248 edges, 457604 markings/sec, 95 secs
lola: 48716086 markings, 109517422 edges, 429223 markings/sec, 100 secs
lola: 50939175 markings, 114440571 edges, 444618 markings/sec, 105 secs
lola: 53266355 markings, 119698917 edges, 465436 markings/sec, 110 secs
lola: 55535320 markings, 124836845 edges, 453793 markings/sec, 115 secs
lola: 57808966 markings, 129834835 edges, 454729 markings/sec, 120 secs
lola: 60040778 markings, 134922169 edges, 446362 markings/sec, 125 secs
lola: 62249844 markings, 139898268 edges, 441813 markings/sec, 130 secs
lola: 64451553 markings, 144854485 edges, 440342 markings/sec, 135 secs
lola: 66683799 markings, 149934014 edges, 446449 markings/sec, 140 secs
lola: 68912430 markings, 154914323 edges, 445726 markings/sec, 145 secs
lola: 71081788 markings, 159825890 edges, 433872 markings/sec, 150 secs
lola: 73247290 markings, 164641674 edges, 433100 markings/sec, 155 secs
lola: 75423137 markings, 169491209 edges, 435169 markings/sec, 160 secs
lola: 77593263 markings, 174395393 edges, 434025 markings/sec, 165 secs
lola: 79836195 markings, 179443366 edges, 448586 markings/sec, 170 secs
lola: 82009214 markings, 184327425 edges, 434604 markings/sec, 175 secs
lola: 84206209 markings, 189223343 edges, 439399 markings/sec, 180 secs
lola: 86290944 markings, 194062248 edges, 416947 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F ((c <= da))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((c <= da))))
lola: processed formula length: 21
lola: 29 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: 3040376 markings, 5520980 edges, 608075 markings/sec, 0 secs
lola: 5682478 markings, 10846831 edges, 528420 markings/sec, 5 secs
lola: 8260931 markings, 15981399 edges, 515691 markings/sec, 10 secs
lola: 10775325 markings, 20978313 edges, 502879 markings/sec, 15 secs
lola: 13209262 markings, 25823918 edges, 486787 markings/sec, 20 secs
lola: 15661724 markings, 30779668 edges, 490492 markings/sec, 25 secs
lola: 18063927 markings, 35584356 edges, 480441 markings/sec, 30 secs
lola: 20430891 markings, 40283045 edges, 473393 markings/sec, 35 secs
lola: 22770427 markings, 44983615 edges, 467907 markings/sec, 40 secs
lola: 25058668 markings, 49561336 edges, 457648 markings/sec, 45 secs
lola: 27372345 markings, 54191352 edges, 462735 markings/sec, 50 secs
lola: 29718124 markings, 58933610 edges, 469156 markings/sec, 55 secs
lola: 32044052 markings, 63507793 edges, 465186 markings/sec, 60 secs
lola: 34307638 markings, 68095001 edges, 452717 markings/sec, 65 secs
lola: 36537548 markings, 72571367 edges, 445982 markings/sec, 70 secs
lola: 38728897 markings, 76950946 edges, 438270 markings/sec, 75 secs
lola: 41004039 markings, 81446438 edges, 455028 markings/sec, 80 secs
lola: 43223594 markings, 85870646 edges, 443911 markings/sec, 85 secs
lola: 45363265 markings, 90215211 edges, 427934 markings/sec, 90 secs
lola: 47557489 markings, 94614573 edges, 438845 markings/sec, 95 secs
lola: 49712109 markings, 98876765 edges, 430924 markings/sec, 100 secs
lola: 51800773 markings, 103068337 edges, 417733 markings/sec, 105 secs
lola: 54082320 markings, 107576179 edges, 456309 markings/sec, 110 secs
lola: 56328977 markings, 112110176 edges, 449331 markings/sec, 115 secs
lola: 58507129 markings, 116438418 edges, 435630 markings/sec, 120 secs
lola: 60726594 markings, 120890353 edges, 443893 markings/sec, 125 secs
lola: 62871409 markings, 125170597 edges, 428963 markings/sec, 130 secs
lola: 64923919 markings, 129269329 edges, 410502 markings/sec, 135 secs
lola: 67142984 markings, 133719365 edges, 443813 markings/sec, 140 secs
lola: 69270187 markings, 137990558 edges, 425441 markings/sec, 145 secs
lola: 71295602 markings, 142023014 edges, 405083 markings/sec, 150 secs
lola: 73398971 markings, 146265844 edges, 420674 markings/sec, 155 secs
lola: 75415117 markings, 150306940 edges, 403229 markings/sec, 160 secs
lola: 77377704 markings, 154187161 edges, 392517 markings/sec, 165 secs
lola: 79498866 markings, 158457232 edges, 424232 markings/sec, 170 secs
lola: 81637491 markings, 162750038 edges, 427725 markings/sec, 175 secs
lola: 83658623 markings, 166805274 edges, 404226 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((G (F ((dr <= r_cap))) OR (G (F ((dr <= r_cap))) AND F (G ((3 <= r))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((dr <= r_cap))) OR (G (F ((dr <= r_cap))) AND F (G ((3 <= r))))))
lola: processed formula length: 75
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 2688903 markings, 5955546 edges, 537781 markings/sec, 0 secs
lola: 5301749 markings, 11801891 edges, 522569 markings/sec, 5 secs
lola: 7831257 markings, 17424872 edges, 505902 markings/sec, 10 secs
lola: 10241955 markings, 22867621 edges, 482140 markings/sec, 15 secs
lola: 12614609 markings, 28158195 edges, 474531 markings/sec, 20 secs
lola: 15020235 markings, 33580658 edges, 481125 markings/sec, 25 secs
lola: 17352599 markings, 38853071 edges, 466473 markings/sec, 30 secs
lola: 19664441 markings, 44093260 edges, 462368 markings/sec, 35 secs
lola: 21937395 markings, 49237994 edges, 454591 markings/sec, 40 secs
lola: 24241794 markings, 54366732 edges, 460880 markings/sec, 45 secs
lola: 26568503 markings, 59569227 edges, 465342 markings/sec, 50 secs
lola: 28877007 markings, 64830935 edges, 461701 markings/sec, 55 secs
lola: 31170513 markings, 69971364 edges, 458701 markings/sec, 60 secs
lola: 33469382 markings, 75176923 edges, 459774 markings/sec, 65 secs
lola: 35740308 markings, 80241286 edges, 454185 markings/sec, 70 secs
lola: 37944829 markings, 85245867 edges, 440904 markings/sec, 75 secs
lola: 40256827 markings, 90426584 edges, 462400 markings/sec, 80 secs
lola: 42493686 markings, 95480938 edges, 447372 markings/sec, 85 secs
lola: 44681481 markings, 100425123 edges, 437559 markings/sec, 90 secs
lola: 46932895 markings, 105434181 edges, 450283 markings/sec, 95 secs
lola: 49095299 markings, 110380320 edges, 432481 markings/sec, 100 secs
lola: 51345833 markings, 115347240 edges, 450107 markings/sec, 105 secs
lola: 53658570 markings, 120575561 edges, 462547 markings/sec, 110 secs
lola: 55907640 markings, 125709174 edges, 449814 markings/sec, 115 secs
lola: 58201791 markings, 130706124 edges, 458830 markings/sec, 120 secs
lola: 60417333 markings, 135751833 edges, 443108 markings/sec, 125 secs
lola: 62628777 markings, 140713994 edges, 442289 markings/sec, 130 secs
lola: 64839821 markings, 145719286 edges, 442209 markings/sec, 135 secs
lola: 67070179 markings, 150779525 edges, 446072 markings/sec, 140 secs
lola: 69275044 markings, 155724943 edges, 440973 markings/sec, 145 secs
lola: 71458594 markings, 160633105 edges, 436710 markings/sec, 150 secs
lola: 73616244 markings, 165448534 edges, 431530 markings/sec, 155 secs
lola: 75778898 markings, 170280976 edges, 432531 markings/sec, 160 secs
lola: 77974945 markings, 175277084 edges, 439209 markings/sec, 165 secs
lola: 80232096 markings, 180326960 edges, 451430 markings/sec, 170 secs
lola: 82404656 markings, 185213749 edges, 434512 markings/sec, 175 secs
lola: 84596484 markings, 190098804 edges, 438366 markings/sec, 180 secs
lola: 86682371 markings, 194927950 edges, 417177 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown yes yes no no yes no no no yes yes unknown no no no
lola:
preliminary result: no unknown yes yes no no yes no no no yes yes unknown no no no
lola: memory consumption: 16624 KB
lola: time consumption: 789 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1552535967835
--------------------
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="CircadianClock-PT-100000"
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-3957"
echo " Executing tool lola"
echo " Input is CircadianClock-PT-100000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r027-smll-155225120900159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-100000.tgz
mv CircadianClock-PT-100000 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 ;