About the Execution of 2019-Gold for SmallOperatingSystem-PT-MT0128DC0064
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15918.900 | 650726.00 | 691556.00 | 843.00 | FFT?TTTFFFFFTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r204-csrt-159033411600013.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-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-4028
Executing tool win2019
Input is SmallOperatingSystem-PT-MT0128DC0064, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411600013
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.8K Apr 12 17:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 17:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 20:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 20:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 14 12:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 10 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 24 05:38 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 SmallOperatingSystem-PT-MT0128DC0064-00
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-01
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-02
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-03
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-04
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-05
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-06
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-07
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-08
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-09
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-10
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-11
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-12
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-13
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-14
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-15
=== Now, execution of the tool begins
BK_START 1590644056423
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmallOperatingSystem-PT-MT0128DC0064 @ 3570 seconds
FORMULA SmallOperatingSystem-PT-MT0128DC0064-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0064-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2919
rslt: Output for LTLCardinality @ SmallOperatingSystem-PT-MT0128DC0064
{
"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 May 28 05:34:16 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 117
},
"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": 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": 117
},
"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": 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": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 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": 117
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (F (((FreeMemSegment <= ExecutingTask) OR G (((2 <= DiskControllerUnit) AND X ((FreeMemSegment <= ExecutingTask))))))))",
"processed_size": 124,
"rewrites": 117
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"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": 117
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (X (F (((CPUUnit <= ExecutingTask) OR (3 <= LoadingMem))))))",
"processed_size": 66,
"rewrites": 117
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (X (F ((2 <= TransferToDisk)))))",
"processed_size": 37,
"rewrites": 117
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 466
},
"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": 117
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 544
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (((G (((DiskControllerUnit <= 1) AND (TaskReady + 1 <= LoadingMem))) R (TaskReady <= DiskControllerUnit)) OR X (G ((2 <= DiskControllerUnit))))))",
"processed_size": 150,
"rewrites": 117
},
"result":
{
"edges": 632907,
"markings": 195713,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (((TransferToDisk <= 1) OR ((2 <= TransferToDisk) U X (F (((1 <= CPUUnit) OR G ((CPUUnit <= TaskOnDisk)))))))))",
"processed_size": 116,
"rewrites": 117
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((DiskControllerUnit <= CPUUnit) OR G (F ((1 <= TaskReady)))))",
"processed_size": 65,
"rewrites": 117
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1089
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G (((1 <= ExecutingTask) OR (LoadingMem <= DiskControllerUnit)))))",
"processed_size": 73,
"rewrites": 117
},
"result":
{
"edges": 68536,
"markings": 37454,
"produced_by": "LTL model checker",
"value": false
},
"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": 1633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 3,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((DiskControllerUnit <= CPUUnit) U (2 <= TaskReady)) OR ((G ((3 <= TaskReady)) AND F ((2 <= TaskReady))) OR (G ((2 <= TaskReady)) AND F ((((DiskControllerUnit <= CPUUnit) U (2 <= TaskReady)) OR (G ((3 <= TaskReady)) AND F ((2 <= TaskReady)))))))))",
"processed_size": 251,
"rewrites": 117
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 37
},
"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": 3267
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((ExecutingTask <= 0) OR F (G (((2 <= FreeMemSegment) AND F ((CPUUnit <= TaskOnDisk))))))))",
"processed_size": 97,
"rewrites": 117
},
"result":
{
"edges": 527,
"markings": 396,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 21132,
"runtime": 651.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(((** U **) OR ((G(**) AND F(**)) OR (G(**) AND F(((** U **) OR (G(**) AND F(**)))))))) : A(G((** OR F(G((** AND F(**))))))) : A(X(TRUE)) : A(G((** OR X(G(**))))) : TRUE : A(X(TRUE)) : TRUE : A(G(F((** OR G((** AND X(**))))))) : FALSE : A(X(X(F(**)))) : A(X(X(F(**)))) : A(F(G(**))) : A(X(TRUE)) : A((** OR G(F(*)))) : A(F(((G((* AND *)) R *) OR X(G(*))))) : A(X((* OR (** U X(F((** OR G(**))))))))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no no yes unknown yes yes yes no no no no no yes yes no yes ",
"value": "no no yes unknown yes yes yes no no no no no yes yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskReady <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (DiskControllerUnit <= TaskOnDisk)
lola: after: (0 <= 64)
lola: LP says that atomic proposition is always true: (TaskSuspended <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (LoadingMem <= CPUUnit)
lola: LP says that atomic proposition is always true: (FreeMemSegment <= CPUUnit)
lola: A ((G ((2 <= TaskReady)) U ((G ((2 <= TaskOnDisk)) AND G ((3 <= TaskReady))) U ((DiskControllerUnit <= CPUUnit) U (2 <= TaskReady))))) : A (G (((ExecutingTask <= 0) OR G (F (G (((2 <= FreeMemSegment) AND F ((CPUUnit <= TaskOnDisk))))))))) : A ((X ((X ((3 <= TaskReady)) OR X (F ((3 <= TaskReady))))) OR X ((NOT(F ((0 <= TaskOnDisk))) U (0 <= TaskReady))))) : A (G (((DiskControllerUnit <= CPUUnit) OR G (X ((3 <= ExecutingTask)))))) : A (NOT((G ((TaskOnDisk <= 0)) AND G (NOT(F ((1 <= TaskOnDisk))))))) : A ((G (X (X ((TaskReady <= TaskOnDisk)))) OR X (X (F (X (F (((3 <= DiskControllerUnit) OR (TaskSuspended <= LoadingMem))))))))) : A (G ((3 <= TaskOnDisk))) : A (G ((F (X (((FreeMemSegment <= ExecutingTask) OR G (((2 <= DiskControllerUnit) AND X ((FreeMemSegment <= ExecutingTask))))))) OR NOT(((0 <= 64) U (0 <= LoadingMem)))))) : A (G (NOT((() U (0 <= LoadingMem))))) : A (X (X (F (((CPUUnit <= ExecutingTask) OR (3 <= LoadingMem)))))) : A (X (F (X (F ((2 <= TransferToDisk)))))) : A (X (F (G (X (((1 <= ExecutingTask) OR (LoadingMem <= DiskControllerUnit))))))) : A (X (G (F (((TaskSuspended <= TaskOnDisk) OR NOT(F (X (F (X (NOT(((3 <= TaskReady) U (CPUUnit + 1 <= LoadingMem))))))))))))) : A (((DiskControllerUnit <= CPUUnit) OR G (NOT(X (F ((X ((FreeMemSegment <= CPUUnit)) AND G ((TaskReady <= 0))))))))) : A (F (NOT((((F ((2 <= DiskControllerUnit)) OR F ((LoadingMem <= TaskReady))) U (DiskControllerUnit + 1 <= TaskReady)) AND F (X ((DiskControllerUnit <= 1))))))) : A (NOT(X (((2 <= TransferToDisk) AND NOT(((2 <= TransferToDisk) U X (F (((1 <= CPUUnit) OR G ((CPUUnit <= TaskOnDisk)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 117 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 1 will run for 237 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: 117 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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (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: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((DiskControllerUnit <= CPUUnit) OR X (G ((3 <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((DiskControllerUnit <= CPUUnit) OR X (G ((3 <= ExecutingTask))))))
lola: processed formula length: 73
lola: 117 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: 2873395 markings, 7532949 edges, 574679 markings/sec, 0 secs
lola: 4839830 markings, 13018893 edges, 393287 markings/sec, 5 secs
lola: 6496372 markings, 17772933 edges, 331308 markings/sec, 10 secs
lola: 8177846 markings, 22589400 edges, 336295 markings/sec, 15 secs
lola: 9721614 markings, 27069511 edges, 308754 markings/sec, 20 secs
lola: 11226836 markings, 31473554 edges, 301044 markings/sec, 25 secs
lola: 12575921 markings, 35428001 edges, 269817 markings/sec, 30 secs
lola: 13985122 markings, 39593815 edges, 281840 markings/sec, 35 secs
lola: 15414882 markings, 43843960 edges, 285952 markings/sec, 40 secs
lola: 16826851 markings, 48034727 edges, 282394 markings/sec, 45 secs
lola: 18234454 markings, 52226880 edges, 281521 markings/sec, 50 secs
lola: 19554222 markings, 56183320 edges, 263954 markings/sec, 55 secs
lola: 20829674 markings, 60034864 edges, 255090 markings/sec, 60 secs
lola: 22129166 markings, 63949448 edges, 259898 markings/sec, 65 secs
lola: 23379890 markings, 67730678 edges, 250145 markings/sec, 70 secs
lola: 24614690 markings, 71474876 edges, 246960 markings/sec, 75 secs
lola: 25850256 markings, 75219187 edges, 247113 markings/sec, 80 secs
lola: 27109016 markings, 79046820 edges, 251752 markings/sec, 85 secs
lola: 28335475 markings, 82772113 edges, 245292 markings/sec, 90 secs
lola: 29577615 markings, 86550541 edges, 248428 markings/sec, 95 secs
lola: 30727603 markings, 90048723 edges, 229998 markings/sec, 100 secs
lola: 31929167 markings, 93725952 edges, 240313 markings/sec, 105 secs
lola: 33119842 markings, 97367645 edges, 238135 markings/sec, 110 secs
lola: 34278362 markings, 100932021 edges, 231704 markings/sec, 115 secs
lola: 35514971 markings, 104717942 edges, 247322 markings/sec, 120 secs
lola: 36751540 markings, 108505629 edges, 247314 markings/sec, 125 secs
lola: 37993162 markings, 112306403 edges, 248324 markings/sec, 130 secs
lola: 39227106 markings, 116088218 edges, 246789 markings/sec, 135 secs
lola: 40425314 markings, 119758243 edges, 239642 markings/sec, 140 secs
lola: 41623147 markings, 123439195 edges, 239567 markings/sec, 145 secs
lola: 42766266 markings, 126976113 edges, 228624 markings/sec, 150 secs
lola: 43903370 markings, 130489982 edges, 227421 markings/sec, 155 secs
lola: 44991371 markings, 133858237 edges, 217600 markings/sec, 160 secs
lola: 46126325 markings, 137349302 edges, 226991 markings/sec, 165 secs
lola: 47261096 markings, 140863941 edges, 226954 markings/sec, 170 secs
lola: 48430882 markings, 144471140 edges, 233957 markings/sec, 175 secs
lola: 49588001 markings, 148050652 edges, 231424 markings/sec, 180 secs
lola: 50748250 markings, 151641600 edges, 232050 markings/sec, 185 secs
lola: 51883060 markings, 155167115 edges, 226962 markings/sec, 190 secs
lola: 53007618 markings, 158658240 edges, 224912 markings/sec, 195 secs
lola: 54143372 markings, 162166387 edges, 227151 markings/sec, 200 secs
lola: 55225119 markings, 165531254 edges, 216349 markings/sec, 205 secs
lola: 56301431 markings, 168867679 edges, 215262 markings/sec, 210 secs
lola: 57366816 markings, 172185121 edges, 213077 markings/sec, 215 secs
lola: 58370414 markings, 175317817 edges, 200720 markings/sec, 220 secs
lola: 59469096 markings, 178730020 edges, 219736 markings/sec, 225 secs
lola: 60558905 markings, 182111386 edges, 217962 markings/sec, 230 secs
lola: 61630567 markings, 185446299 edges, 214332 markings/sec, 235 secs
lola: 62685029 markings, 188721322 edges, 210892 markings/sec, 240 secs
lola: 63762202 markings, 192074856 edges, 215435 markings/sec, 245 secs
lola: 64875167 markings, 195550199 edges, 222593 markings/sec, 250 secs
lola: 66034957 markings, 199164531 edges, 231958 markings/sec, 255 secs
lola: 67112609 markings, 202533043 edges, 215530 markings/sec, 260 secs
lola: 68246923 markings, 206066287 edges, 226863 markings/sec, 265 secs
lola: 69364800 markings, 209580489 edges, 223575 markings/sec, 270 secs
lola: 70462504 markings, 213011279 edges, 219541 markings/sec, 275 secs
lola: 71574692 markings, 216466874 edges, 222438 markings/sec, 280 secs
lola: 72678724 markings, 219918439 edges, 220806 markings/sec, 285 secs
lola: 73796319 markings, 223428292 edges, 223519 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown yes yes yes unknown no unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((FreeMemSegment <= ExecutingTask) OR G (((2 <= DiskControllerUnit) AND X ((FreeMemSegment <= ExecutingTask))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((FreeMemSegment <= ExecutingTask) OR G (((2 <= DiskControllerUnit) AND X ((FreeMemSegment <= ExecutingTask))))))))
lola: processed formula length: 124
lola: 117 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 326 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: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (((CPUUnit <= ExecutingTask) OR (3 <= LoadingMem))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (((CPUUnit <= ExecutingTask) OR (3 <= LoadingMem))))))
lola: processed formula length: 66
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((2 <= TransferToDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((2 <= TransferToDisk)))))
lola: processed formula length: 37
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 466 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: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((G (((DiskControllerUnit <= 1) AND (TaskReady + 1 <= LoadingMem))) R (TaskReady <= DiskControllerUnit)) OR X (G ((2 <= DiskControllerUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((G (((DiskControllerUnit <= 1) AND (TaskReady + 1 <= LoadingMem))) R (TaskReady <= DiskControllerUnit)) OR X (G ((2 <= DiskControllerUnit))))))
lola: processed formula length: 150
lola: 117 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: 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: 195713 markings, 632907 edges
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((TransferToDisk <= 1) OR ((2 <= TransferToDisk) U X (F (((1 <= CPUUnit) OR G ((CPUUnit <= TaskOnDisk)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((TransferToDisk <= 1) OR ((2 <= TransferToDisk) U X (F (((1 <= CPUUnit) OR G ((CPUUnit <= TaskOnDisk)))))))))
lola: processed formula length: 116
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((DiskControllerUnit <= CPUUnit) OR G (F ((1 <= TaskReady)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((DiskControllerUnit <= CPUUnit) OR G (F ((1 <= TaskReady)))))
lola: processed formula length: 65
lola: 117 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 13 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((1 <= ExecutingTask) OR (LoadingMem <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((1 <= ExecutingTask) OR (LoadingMem <= DiskControllerUnit)))))
lola: processed formula length: 73
lola: 117 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 5
lola: add low 3
lola: add low 6
lola: add low 5
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
lola: add low 3
lola: add low 6
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: 37454 markings, 68536 edges
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((DiskControllerUnit <= CPUUnit) U (2 <= TaskReady)) OR ((G ((3 <= TaskReady)) AND F ((2 <= TaskReady))) OR (G ((2 <= TaskReady)) AND F ((((DiskControllerUnit <= CPUUnit) U (2 <= TaskReady)) OR (G ((3 <= TaskReady)) AND F ((2 <= TaskReady)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((DiskControllerUnit <= CPUUnit) U (2 <= TaskReady)) OR ((G ((3 <= TaskReady)) AND F ((2 <= TaskReady))) OR (G ((2 <= TaskReady)) AND F ((((DiskControllerUnit <= CPUUnit) U (2 <= TaskReady)) OR (G ((3 <= TaskReady)) AND F ((2 <= TaskReady)))))))))
lola: processed formula length: 251
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 37 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 15 will run for 3267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ExecutingTask <= 0) OR F (G (((2 <= FreeMemSegment) AND F ((CPUUnit <= TaskOnDisk))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((ExecutingTask <= 0) OR F (G (((2 <= FreeMemSegment) AND F ((CPUUnit <= TaskOnDisk))))))))
lola: processed formula length: 97
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 396 markings, 527 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((DiskControllerUnit <= CPUUnit) OR X (G ((3 <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((DiskControllerUnit <= CPUUnit) OR X (G ((3 <= ExecutingTask))))))
lola: processed formula length: 73
lola: 117 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: 2888137 markings, 7575339 edges, 577627 markings/sec, 0 secs
lola: 5089432 markings, 13741709 edges, 440259 markings/sec, 5 secs
lola: 7048071 markings, 19353939 edges, 391728 markings/sec, 10 secs
lola: 8903264 markings, 24699356 edges, 371039 markings/sec, 15 secs
lola: 10642248 markings, 29765156 edges, 347797 markings/sec, 20 secs
lola: 12286376 markings, 34590268 edges, 328826 markings/sec, 25 secs
lola: 13802823 markings, 39054560 edges, 303289 markings/sec, 30 secs
lola: 15172034 markings, 43125930 edges, 273842 markings/sec, 35 secs
lola: 16554595 markings, 47220606 edges, 276512 markings/sec, 40 secs
lola: 18031047 markings, 51618436 edges, 295290 markings/sec, 45 secs
lola: 19497333 markings, 56013825 edges, 293257 markings/sec, 50 secs
lola: 20939104 markings, 60367067 edges, 288354 markings/sec, 55 secs
lola: 22371352 markings, 64677534 edges, 286450 markings/sec, 60 secs
lola: 23762227 markings, 68887682 edges, 278175 markings/sec, 65 secs
lola: 25116838 markings, 73003448 edges, 270922 markings/sec, 70 secs
lola: 26472096 markings, 77111607 edges, 271052 markings/sec, 75 secs
lola: 27785240 markings, 81107767 edges, 262629 markings/sec, 80 secs
lola: 29047289 markings, 84932180 edges, 252410 markings/sec, 85 secs
lola: 30303304 markings, 88757384 edges, 251203 markings/sec, 90 secs
lola: 31579828 markings, 92659973 edges, 255305 markings/sec, 95 secs
lola: 32831377 markings, 96496163 edges, 250310 markings/sec, 100 secs
lola: 34043247 markings, 100212595 edges, 242374 markings/sec, 105 secs
lola: 35221467 markings, 103829690 edges, 235644 markings/sec, 110 secs
lola: 36464304 markings, 107630320 edges, 248567 markings/sec, 115 secs
lola: 37721255 markings, 111474862 edges, 251390 markings/sec, 120 secs
lola: 38977905 markings, 115322569 edges, 251330 markings/sec, 125 secs
lola: 40205693 markings, 119079069 edges, 245558 markings/sec, 130 secs
lola: 41425427 markings, 122827530 edges, 243947 markings/sec, 135 secs
lola: 42624536 markings, 126537022 edges, 239822 markings/sec, 140 secs
lola: 43805041 markings, 130187209 edges, 236101 markings/sec, 145 secs
lola: 44946784 markings, 133721052 edges, 228349 markings/sec, 150 secs
lola: 46089718 markings, 137234375 edges, 228587 markings/sec, 155 secs
lola: 47219920 markings, 140737275 edges, 226040 markings/sec, 160 secs
lola: 48359597 markings, 144249858 edges, 227935 markings/sec, 165 secs
lola: 49457432 markings, 147642362 edges, 219567 markings/sec, 170 secs
lola: 50528867 markings, 150965964 edges, 214287 markings/sec, 175 secs
lola: 51650496 markings, 154443419 edges, 224326 markings/sec, 180 secs
lola: 52775270 markings, 157932705 edges, 224955 markings/sec, 185 secs
lola: 53872144 markings, 161324269 edges, 219375 markings/sec, 190 secs
lola: 54938722 markings, 164638689 edges, 213316 markings/sec, 195 secs
lola: 56032585 markings, 168038863 edges, 218773 markings/sec, 200 secs
lola: 57147650 markings, 171500735 edges, 223013 markings/sec, 205 secs
lola: 58211323 markings, 174817272 edges, 212735 markings/sec, 210 secs
lola: 59305800 markings, 178225647 edges, 218895 markings/sec, 215 secs
lola: 60407722 markings, 181641645 edges, 220384 markings/sec, 220 secs
lola: 61490861 markings, 185014115 edges, 216628 markings/sec, 225 secs
lola: 62584912 markings, 188409533 edges, 218810 markings/sec, 230 secs
lola: 63696942 markings, 191870437 edges, 222406 markings/sec, 235 secs
lola: 64776034 markings, 195241101 edges, 215818 markings/sec, 240 secs
lola: 65888006 markings, 198707629 edges, 222394 markings/sec, 245 secs
lola: 66951667 markings, 202039534 edges, 212732 markings/sec, 250 secs
lola: 68060658 markings, 205486473 edges, 221798 markings/sec, 255 secs
lola: 69135946 markings, 208859002 edges, 215058 markings/sec, 260 secs
lola: 70199504 markings, 212194640 edges, 212712 markings/sec, 265 secs
lola: 71278735 markings, 215549395 edges, 215846 markings/sec, 270 secs
lola: 72358894 markings, 218912087 edges, 216032 markings/sec, 275 secs
lola: 73399645 markings, 222191230 edges, 208150 markings/sec, 280 secs
lola: 74416352 markings, 225366378 edges, 203341 markings/sec, 285 secs
lola: 75454334 markings, 228605904 edges, 207596 markings/sec, 290 secs
lola: 76475766 markings, 231800109 edges, 204286 markings/sec, 295 secs
lola: 77534723 markings, 235125222 edges, 211791 markings/sec, 300 secs
lola: 78609019 markings, 238470855 edges, 214859 markings/sec, 305 secs
lola: 79670381 markings, 241786805 edges, 212272 markings/sec, 310 secs
lola: 80727535 markings, 245075271 edges, 211431 markings/sec, 315 secs
lola: 81796975 markings, 248423877 edges, 213888 markings/sec, 320 secs
lola: 82856875 markings, 251745896 edges, 211980 markings/sec, 325 secs
lola: 83919972 markings, 255089161 edges, 212619 markings/sec, 330 secs
lola: 84856287 markings, 258021421 edges, 187263 markings/sec, 335 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no yes unknown yes yes yes no no no no no yes yes no yes
lola:
preliminary result: no no yes unknown yes yes yes no no no no no yes yes no yes
lola: memory consumption: 21132 KB
lola: time consumption: 651 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1590644707149
--------------------
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="SmallOperatingSystem-PT-MT0128DC0064"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is SmallOperatingSystem-PT-MT0128DC0064, 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 r204-csrt-159033411600013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0128DC0064.tgz
mv SmallOperatingSystem-PT-MT0128DC0064 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;