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-159033411600023.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-MT1024DC0256, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411600023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.8K Apr 12 17:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 17:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 20:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:04 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 4.1K Apr 14 12:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Apr 10 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 05:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 10 05:24 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.1K 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-MT1024DC0256-00
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-01
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-02
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-03
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-04
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-05
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-06
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-07
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-08
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-09
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-10
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-11
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-12
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-13
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-14
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-15

=== Now, execution of the tool begins

BK_START 1590644056316

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmallOperatingSystem-PT-MT1024DC0256 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT1024DC0256-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0256-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2510
rslt: Output for LTLCardinality @ SmallOperatingSystem-PT-MT1024DC0256

{
"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": "FALSE",
"processed_size": 5,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": 107
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 259
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(DiskControllerUnit <= CPUUnit)",
"processed_size": 31,
"rewrites": 109
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 337
},
"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 <= ExecutingTask))))",
"processed_size": 32,
"rewrites": 107
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"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 ((LoadingMem <= 2)))",
"processed_size": 25,
"rewrites": 107
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 453
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "A (X (F ((F ((LoadingMem <= TaskReady)) OR G ((LoadingMem <= 2))))))",
"processed_size": 68,
"rewrites": 107
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 453
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((TaskSuspended <= 0))",
"processed_size": 22,
"rewrites": 109
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 605
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (F ((1 <= LoadingMem))))",
"processed_size": 29,
"rewrites": 107
},
"result":
{
"edges": 12,
"markings": 9,
"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": 756
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "A ((F ((TransferToDisk <= TaskSuspended)) OR G ((TransferToDisk <= 0))))",
"processed_size": 72,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 1009
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "A (((ExecutingTask + 1 <= TaskSuspended) U G ((1 <= ExecutingTask))))",
"processed_size": 69,
"rewrites": 107
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1513
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((F ((3 <= TaskReady)) OR (G ((TaskOnDisk <= FreeMemSegment)) AND F ((3 <= TaskReady)))))",
"processed_size": 91,
"rewrites": 107
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3027
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 (F ((G (((2 <= TransferToDisk) AND G ((CPUUnit <= 0)))) OR (TaskReady + 1 <= ExecutingTask))))",
"processed_size": 96,
"rewrites": 107
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 21308,
"runtime": 1060.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(**)) AND A(X(TRUE))) : A((** U G(**))) : A((F(**) OR G(**))) : A((X((** OR (X(G(**)) U **))) OR (G(**) AND X(F((** OR (X(G(**)) U **))))))) : A(F(**)) : A((X(G((** OR X(TRUE)))) U **)) : FALSE : A(G(F(**))) : TRUE : A(X((F((** OR (G(**) AND F(**)))) U X(F(**))))) : A((F(**) OR (G(**) AND F(**)))) : (A(F(G(**))) AND A(X(**))) : A(G((X(TRUE) OR (F(**) U X((X(**) AND G(*))))))) : A(G(F(**))) : (A(X(**)) AND A(X(F((F(**) OR G(*)))))) : A(F((G((** AND G(**))) OR *)))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no no yes yes no unknown no no yes yes no no unknown unknown no no ",
"value": "no no yes yes no unknown no no yes yes no no unknown unknown 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: 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: (2 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (CPUUnit <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (DiskControllerUnit <= TaskOnDisk)
lola: after: (0 <= 768)
lola: LP says that atomic proposition is always true: (TaskReady <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskReady <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskSuspended <= TaskOnDisk)
lola: A ((((2 <= TaskOnDisk) U ((2 <= TaskOnDisk) U (CPUUnit + 1 <= DiskControllerUnit))) AND X (G (X ((0 <= CPUUnit)))))) : A ((((ExecutingTask + 1 <= TaskSuspended) U G ((1 <= ExecutingTask))) AND ((TaskSuspended <= ExecutingTask) OR G (F ((CPUUnit <= TaskOnDisk)))))) : A ((F ((TransferToDisk <= TaskSuspended)) OR G ((TransferToDisk <= 0)))) : A ((G ((TransferToDisk <= LoadingMem)) U X (((DiskControllerUnit <= LoadingMem) OR (G (X ((TransferToDisk <= LoadingMem))) U (TransferToDisk <= LoadingMem)))))) : A (F (NOT(G (NOT(F (((1 <= TaskSuspended)))))))) : A ((X (((TaskOnDisk + 1 <= TaskReady) OR G (((3 <= DiskControllerUnit) OR X ((TaskReady <= TaskOnDisk)))))) U (DiskControllerUnit <= ExecutingTask))) : A (G (NOT(X ((F ((0 <= ExecutingTask)) OR F ((DiskControllerUnit <= 0))))))) : A (NOT(G (F (NOT(F (NOT(X (NOT(X ((1 <= LoadingMem))))))))))) : A ((G ((0 <= TransferToDisk)) OR NOT(F (X ((((CPUUnit <= DiskControllerUnit)) OR ((3 <= FreeMemSegment) U (CPUUnit <= DiskControllerUnit)))))))) : A (X ((F ((G ((CPUUnit <= ExecutingTask)) U (ExecutingTask <= FreeMemSegment))) U F (X (((CPUUnit + 1 <= TaskSuspended) U (ExecutingTask <= FreeMemSegment))))))) : A ((G ((TaskOnDisk <= FreeMemSegment)) U F ((3 <= TaskReady)))) : A ((X (F (G ((1 <= ExecutingTask)))) AND X ((3 <= FreeMemSegment)))) : A (G ((X (G ((TaskSuspended <= TaskOnDisk))) OR (F ((3 <= TaskReady)) U X ((X ((1 <= ExecutingTask)) AND NOT(F ((TaskSuspended <= TransferToDisk))))))))) : A (F (G (F (X (NOT(X (NOT(G (((DiskControllerUnit <= CPUUnit) U F ((3 <= CPUUnit)))))))))))) : A ((X ((LoadingMem <= 2)) AND NOT(G (X ((NOT(F ((LoadingMem <= TaskReady))) AND F (((LoadingMem <= TaskReady) U (3 <= LoadingMem))))))))) : A ((F (X (F (G (((2 <= TransferToDisk) AND G ((CPUUnit <= 0))))))) OR NOT(G ((ExecutingTask <= TaskReady)))))
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 107 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: A ((X (G (((3 <= DiskControllerUnit) OR X (TRUE)))) U (DiskControllerUnit <= ExecutingTask)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G (((3 <= DiskControllerUnit) OR X (TRUE)))) U (DiskControllerUnit <= ExecutingTask)))
lola: processed formula length: 93
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3795644 markings, 7643927 edges, 759129 markings/sec, 0 secs
lola: 6821363 markings, 14186201 edges, 605144 markings/sec, 5 secs
lola: 8952244 markings, 19372162 edges, 426176 markings/sec, 10 secs
lola: 10733132 markings, 24084973 edges, 356178 markings/sec, 15 secs
lola: 13556879 markings, 30344337 edges, 564749 markings/sec, 20 secs
lola: 16354780 markings, 36500999 edges, 559580 markings/sec, 25 secs
lola: 18523280 markings, 42202904 edges, 433700 markings/sec, 30 secs
lola: 20993195 markings, 48441562 edges, 493983 markings/sec, 35 secs
lola: 23372164 markings, 54322490 edges, 475794 markings/sec, 40 secs
lola: 25786604 markings, 60367457 edges, 482888 markings/sec, 45 secs
lola: 28462714 markings, 66695992 edges, 535222 markings/sec, 50 secs
lola: 30669966 markings, 72305695 edges, 441450 markings/sec, 55 secs
lola: 33181774 markings, 78288334 edges, 502362 markings/sec, 60 secs
lola: 35475165 markings, 84248489 edges, 458678 markings/sec, 65 secs
lola: 37613211 markings, 89647536 edges, 427609 markings/sec, 70 secs
lola: 39694712 markings, 94844545 edges, 416300 markings/sec, 75 secs
lola: 41756639 markings, 100339584 edges, 412385 markings/sec, 80 secs
lola: 43998718 markings, 105961062 edges, 448416 markings/sec, 85 secs
lola: 45938989 markings, 111056737 edges, 388054 markings/sec, 90 secs
lola: 48349815 markings, 116888943 edges, 482165 markings/sec, 95 secs
lola: 50437590 markings, 122285912 edges, 417555 markings/sec, 100 secs
lola: 52579073 markings, 127497988 edges, 428297 markings/sec, 105 secs
lola: 54304850 markings, 132283341 edges, 345155 markings/sec, 110 secs
lola: 56072266 markings, 137166219 edges, 353483 markings/sec, 115 secs
lola: 57903328 markings, 142150938 edges, 366212 markings/sec, 120 secs
lola: 59753026 markings, 147373887 edges, 369940 markings/sec, 125 secs
lola: 61504113 markings, 152183682 edges, 350217 markings/sec, 130 secs
lola: 63610058 markings, 157764020 edges, 421189 markings/sec, 135 secs
lola: 65753012 markings, 162975934 edges, 428591 markings/sec, 140 secs
lola: 68145719 markings, 168641227 edges, 478541 markings/sec, 145 secs
lola: 70355315 markings, 174053281 edges, 441919 markings/sec, 150 secs
lola: 72055311 markings, 178800998 edges, 339999 markings/sec, 155 secs
lola: 74068806 markings, 183992583 edges, 402699 markings/sec, 160 secs
lola: 76072201 markings, 189118857 edges, 400679 markings/sec, 165 secs
lola: 78110787 markings, 194342482 edges, 407717 markings/sec, 170 secs
lola: 80435858 markings, 200063908 edges, 465014 markings/sec, 175 secs
lola: 82156168 markings, 204824593 edges, 344062 markings/sec, 180 secs
lola: 83938464 markings, 209764023 edges, 356459 markings/sec, 185 secs
lola: 85891151 markings, 214874987 edges, 390537 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((CPUUnit + 1 <= DiskControllerUnit))) AND A (X (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((CPUUnit + 1 <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (DiskControllerUnit <= CPUUnit)
lola: processed formula length: 31
lola: 109 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (((DiskControllerUnit <= LoadingMem) OR (X (G ((TransferToDisk <= LoadingMem))) U (TransferToDisk <= LoadingMem)))) OR (G ((TransferToDisk <= LoadingMem)) AND X (F (((DiskControllerUnit <= LoadingMem) OR (X (G ((TransferToDisk <= LoadingMem))) U (TransferToDisk <= LoadingMem))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (((DiskControllerUnit <= LoadingMem) OR (X (G ((TransferToDisk <= LoadingMem))) U (TransferToDisk <= LoadingMem)))) OR (G ((TransferToDisk <= LoadingMem)) AND X (F (((DiskControllerUnit <= LoadingMem) OR (X (G ((TransferToDisk <= LoadingMem))) U (TransferToDisk <= LoadingMem))))))))
lola: processed formula length: 289
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 19 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 5 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F (((ExecutingTask <= FreeMemSegment) OR (G ((CPUUnit <= ExecutingTask)) AND F ((ExecutingTask <= FreeMemSegment))))) U X (F ((ExecutingTask <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F (((ExecutingTask <= FreeMemSegment) OR (G ((CPUUnit <= ExecutingTask)) AND F ((ExecutingTask <= FreeMemSegment))))) U X (F ((ExecutingTask <= FreeMemSegment))))))
lola: processed formula length: 171
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((1 <= ExecutingTask)))) AND A (X ((3 <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= ExecutingTask))))
lola: processed formula length: 32
lola: 107 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: 4 markings, 5 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X (TRUE) OR (F ((3 <= TaskReady)) U X ((X ((1 <= ExecutingTask)) AND G ((TransferToDisk + 1 <= TaskSuspended))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (TRUE) OR (F ((3 <= TaskReady)) U X ((X ((1 <= ExecutingTask)) AND G ((TransferToDisk + 1 <= TaskSuspended))))))))
lola: processed formula length: 123
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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: 4065540 markings, 7436019 edges, 813108 markings/sec, 0 secs
lola: 7489591 markings, 14701325 edges, 684810 markings/sec, 5 secs
lola: 10428492 markings, 20894826 edges, 587780 markings/sec, 10 secs
lola: 13508230 markings, 27390459 edges, 615948 markings/sec, 15 secs
lola: 16592758 markings, 33565011 edges, 616906 markings/sec, 20 secs
lola: 19280524 markings, 39758438 edges, 537553 markings/sec, 25 secs
lola: 22211298 markings, 46631747 edges, 586155 markings/sec, 30 secs
lola: 24926037 markings, 53010743 edges, 542948 markings/sec, 35 secs
lola: 27189926 markings, 59029665 edges, 452778 markings/sec, 40 secs
lola: 29324339 markings, 64711427 edges, 426883 markings/sec, 45 secs
lola: 31496521 markings, 70498538 edges, 434436 markings/sec, 50 secs
lola: 34613386 markings, 77213401 edges, 623373 markings/sec, 55 secs
lola: 37585125 markings, 84039501 edges, 594348 markings/sec, 60 secs
lola: 40572762 markings, 90872160 edges, 597527 markings/sec, 65 secs
lola: 43869070 markings, 97556885 edges, 659262 markings/sec, 70 secs
lola: 46635835 markings, 104152392 edges, 553353 markings/sec, 75 secs
lola: 49646413 markings, 110857755 edges, 602116 markings/sec, 80 secs
lola: 52015006 markings, 117170257 edges, 473719 markings/sec, 85 secs
lola: 54451318 markings, 123631406 edges, 487262 markings/sec, 90 secs
lola: 56815714 markings, 129973761 edges, 472879 markings/sec, 95 secs
lola: 59239767 markings, 136509615 edges, 484811 markings/sec, 100 secs
lola: 62044745 markings, 143167571 edges, 560996 markings/sec, 105 secs
lola: 64562617 markings, 149429483 edges, 503574 markings/sec, 110 secs
lola: 67040171 markings, 155584091 edges, 495511 markings/sec, 115 secs
lola: 69764679 markings, 162072910 edges, 544902 markings/sec, 120 secs
lola: 72545845 markings, 168603412 edges, 556233 markings/sec, 125 secs
lola: 74925125 markings, 174591721 edges, 475856 markings/sec, 130 secs
lola: 77284979 markings, 180889813 edges, 471971 markings/sec, 135 secs
lola: 80062294 markings, 187020081 edges, 555463 markings/sec, 140 secs
lola: 82315145 markings, 193179561 edges, 450570 markings/sec, 145 secs
lola: 85178314 markings, 199531963 edges, 572634 markings/sec, 150 secs
lola: 87315927 markings, 205289776 edges, 427523 markings/sec, 155 secs
lola: 89948007 markings, 211670976 edges, 526416 markings/sec, 160 secs
lola: 92441171 markings, 217963866 edges, 498633 markings/sec, 165 secs
lola: 95183676 markings, 224483310 edges, 548501 markings/sec, 170 secs
lola: 97438467 markings, 230561662 edges, 450958 markings/sec, 175 secs
lola: 100092276 markings, 236339647 edges, 530762 markings/sec, 180 secs
lola: 102111929 markings, 241728681 edges, 403931 markings/sec, 185 secs
lola: 103832767 markings, 246348314 edges, 344168 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((LoadingMem <= 2))) AND A (X (F ((F ((LoadingMem <= TaskReady)) OR G ((LoadingMem <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((LoadingMem <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((LoadingMem <= 2)))
lola: processed formula length: 25
lola: 107 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 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((F ((LoadingMem <= TaskReady)) OR G ((LoadingMem <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((F ((LoadingMem <= TaskReady)) OR G ((LoadingMem <= 2))))))
lola: processed formula length: 68
lola: 107 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: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= TaskSuspended))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((TaskSuspended <= 0))
lola: processed formula length: 22
lola: 109 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= CPUUnit))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= CPUUnit))))
lola: processed formula length: 26
lola: 107 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: 4277450 markings, 6952695 edges, 855490 markings/sec, 0 secs
lola: 7857167 markings, 13214445 edges, 715943 markings/sec, 5 secs
lola: 11435025 markings, 19473545 edges, 715572 markings/sec, 10 secs
lola: 14980843 markings, 25677363 edges, 709164 markings/sec, 15 secs
lola: 18569293 markings, 31956206 edges, 717690 markings/sec, 20 secs
lola: 22124196 markings, 38176344 edges, 710981 markings/sec, 25 secs
lola: 25610914 markings, 44277550 edges, 697344 markings/sec, 30 secs
lola: 29146323 markings, 50463974 edges, 707082 markings/sec, 35 secs
lola: 32723574 markings, 56723151 edges, 715450 markings/sec, 40 secs
lola: 36290843 markings, 62965457 edges, 713454 markings/sec, 45 secs
lola: 39765559 markings, 69045668 edges, 694943 markings/sec, 50 secs
lola: 43070096 markings, 74828728 edges, 660907 markings/sec, 55 secs
lola: 46316965 markings, 80510605 edges, 649374 markings/sec, 60 secs
lola: 49663002 markings, 86365411 edges, 669207 markings/sec, 65 secs
lola: 52876539 markings, 91989060 edges, 642707 markings/sec, 70 secs
lola: 56088683 markings, 97610475 edges, 642429 markings/sec, 75 secs
lola: 59295532 markings, 103222327 edges, 641370 markings/sec, 80 secs
lola: 62543636 markings, 108906189 edges, 649621 markings/sec, 85 secs
lola: 65833417 markings, 114663243 edges, 657956 markings/sec, 90 secs
lola: 69150410 markings, 120467919 edges, 663399 markings/sec, 95 secs
lola: 72392500 markings, 126141660 edges, 648418 markings/sec, 100 secs
lola: 75636358 markings, 131818588 edges, 648772 markings/sec, 105 secs
lola: 78845317 markings, 137434125 edges, 641792 markings/sec, 110 secs
lola: 81980019 markings, 142919862 edges, 626940 markings/sec, 115 secs
lola: 85275846 markings, 148687598 edges, 659165 markings/sec, 120 secs
lola: 88655497 markings, 154602523 edges, 675930 markings/sec, 125 secs
lola: 92011238 markings, 160474923 edges, 671148 markings/sec, 130 secs
lola: 95371798 markings, 166356067 edges, 672112 markings/sec, 135 secs
lola: 97327273 markings, 169779816 edges, 391095 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= LoadingMem))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= LoadingMem))))
lola: processed formula length: 29
lola: 107 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: 9 markings, 12 edges
lola: ========================================
lola: subprocess 12 will run for 756 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((TransferToDisk <= TaskSuspended)) OR G ((TransferToDisk <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((TransferToDisk <= TaskSuspended)) OR G ((TransferToDisk <= 0))))
lola: processed formula length: 72
lola: 107 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: 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 1009 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((ExecutingTask + 1 <= TaskSuspended) U G ((1 <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((ExecutingTask + 1 <= TaskSuspended) U G ((1 <= ExecutingTask))))
lola: processed formula length: 69
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 14 will run for 1513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= TaskReady)) OR (G ((TaskOnDisk <= FreeMemSegment)) AND F ((3 <= TaskReady)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= TaskReady)) OR (G ((TaskOnDisk <= FreeMemSegment)) AND F ((3 <= TaskReady)))))
lola: processed formula length: 91
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 3027 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((G (((2 <= TransferToDisk) AND G ((CPUUnit <= 0)))) OR (TaskReady + 1 <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G (((2 <= TransferToDisk) AND G ((CPUUnit <= 0)))) OR (TaskReady + 1 <= ExecutingTask))))
lola: processed formula length: 96
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((X (G (((3 <= DiskControllerUnit) OR X (TRUE)))) U (DiskControllerUnit <= ExecutingTask)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G (((3 <= DiskControllerUnit) OR X (TRUE)))) U (DiskControllerUnit <= ExecutingTask)))
lola: processed formula length: 93
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3506633 markings, 7019476 edges, 701327 markings/sec, 0 secs
lola: 6695115 markings, 13871752 edges, 637696 markings/sec, 5 secs
lola: 9371033 markings, 20485813 edges, 535184 markings/sec, 10 secs
lola: 12097524 markings, 26862811 edges, 545298 markings/sec, 15 secs
lola: 15025493 markings, 33483631 edges, 585594 markings/sec, 20 secs
lola: 17610504 markings, 39779439 edges, 517002 markings/sec, 25 secs
lola: 20010593 markings, 46137254 edges, 480018 markings/sec, 30 secs
lola: 22508526 markings, 52228128 edges, 499587 markings/sec, 35 secs
lola: 24995762 markings, 58252372 edges, 497447 markings/sec, 40 secs
lola: 27372797 markings, 64215267 edges, 475407 markings/sec, 45 secs
lola: 29723709 markings, 69861078 edges, 470182 markings/sec, 50 secs
lola: 32054126 markings, 75690431 edges, 466083 markings/sec, 55 secs
lola: 34391302 markings, 81528506 edges, 467435 markings/sec, 60 secs
lola: 36720193 markings, 87371312 edges, 465778 markings/sec, 65 secs
lola: 39070661 markings, 93117189 edges, 470094 markings/sec, 70 secs
lola: 41037858 markings, 98434810 edges, 393439 markings/sec, 75 secs
lola: 43338185 markings, 104215651 edges, 460065 markings/sec, 80 secs
lola: 45412242 markings, 109778568 edges, 414811 markings/sec, 85 secs
lola: 47960262 markings, 115823231 edges, 509604 markings/sec, 90 secs
lola: 50069519 markings, 121337184 edges, 421851 markings/sec, 95 secs
lola: 52387505 markings, 126961602 edges, 463597 markings/sec, 100 secs
lola: 54169064 markings, 131921195 edges, 356312 markings/sec, 105 secs
lola: 55992108 markings, 136941637 edges, 364609 markings/sec, 110 secs
lola: 57732026 markings, 141750550 edges, 347984 markings/sec, 115 secs
lola: 59344467 markings, 146195737 edges, 322488 markings/sec, 120 secs
lola: 61076426 markings, 151095913 edges, 346392 markings/sec, 125 secs
lola: 63265507 markings, 156806784 edges, 437816 markings/sec, 130 secs
lola: 65403143 markings, 161993206 edges, 427527 markings/sec, 135 secs
lola: 67593988 markings, 167390737 edges, 438169 markings/sec, 140 secs
lola: 69871647 markings, 172924840 edges, 455532 markings/sec, 145 secs
lola: 71789679 markings, 178041704 edges, 383606 markings/sec, 150 secs
lola: 73781645 markings, 183283161 edges, 398393 markings/sec, 155 secs
lola: 75882102 markings, 188580489 edges, 420091 markings/sec, 160 secs
lola: 77934465 markings, 193834387 edges, 410473 markings/sec, 165 secs
lola: 79992042 markings, 199028190 edges, 411515 markings/sec, 170 secs
lola: 81867080 markings, 204017088 edges, 375008 markings/sec, 175 secs
lola: 83522626 markings, 208654357 edges, 331109 markings/sec, 180 secs
lola: 85557976 markings, 213959913 edges, 407070 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G ((X (TRUE) OR (F ((3 <= TaskReady)) U X ((X ((1 <= ExecutingTask)) AND G ((TransferToDisk + 1 <= TaskSuspended))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (TRUE) OR (F ((3 <= TaskReady)) U X ((X ((1 <= ExecutingTask)) AND G ((TransferToDisk + 1 <= TaskSuspended))))))))
lola: processed formula length: 123
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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: 3925097 markings, 7155358 edges, 785019 markings/sec, 0 secs
lola: 7215255 markings, 14061042 edges, 658032 markings/sec, 5 secs
lola: 10302036 markings, 20642262 edges, 617356 markings/sec, 10 secs
lola: 13697915 markings, 27771274 edges, 679176 markings/sec, 15 secs
lola: 17073970 markings, 34527631 edges, 675211 markings/sec, 20 secs
lola: 20030280 markings, 41509715 edges, 591262 markings/sec, 25 secs
lola: 23181394 markings, 48571941 edges, 630223 markings/sec, 30 secs
lola: 25723615 markings, 55129207 edges, 508444 markings/sec, 35 secs
lola: 28162766 markings, 61613510 edges, 487830 markings/sec, 40 secs
lola: 30549118 markings, 67972471 edges, 477270 markings/sec, 45 secs
lola: 33184891 markings, 74266761 edges, 527155 markings/sec, 50 secs
lola: 36376738 markings, 80814602 edges, 638369 markings/sec, 55 secs
lola: 39024246 markings, 87453841 edges, 529502 markings/sec, 60 secs
lola: 42172467 markings, 94162882 edges, 629644 markings/sec, 65 secs
lola: 45298115 markings, 101000797 edges, 625130 markings/sec, 70 secs
lola: 48189513 markings, 107786857 edges, 578280 markings/sec, 75 secs
lola: 50965400 markings, 114373036 edges, 555177 markings/sec, 80 secs
lola: 53412768 markings, 120897725 edges, 489474 markings/sec, 85 secs
lola: 55915755 markings, 127555909 edges, 500597 markings/sec, 90 secs
lola: 58481976 markings, 134448555 edges, 513244 markings/sec, 95 secs
lola: 61246598 markings, 141265744 edges, 552924 markings/sec, 100 secs
lola: 63985785 markings, 147890143 edges, 547837 markings/sec, 105 secs
lola: 66498014 markings, 154317083 edges, 502446 markings/sec, 110 secs
lola: 69280815 markings, 160942216 edges, 556560 markings/sec, 115 secs
lola: 72072995 markings, 167656877 edges, 558436 markings/sec, 120 secs
lola: 74777135 markings, 174190172 edges, 540828 markings/sec, 125 secs
lola: 77288031 markings, 180896123 edges, 502179 markings/sec, 130 secs
lola: 80302586 markings, 187698554 edges, 602911 markings/sec, 135 secs
lola: 82995594 markings, 194545248 edges, 538602 markings/sec, 140 secs
lola: 85748274 markings, 201052298 edges, 550536 markings/sec, 145 secs
lola: 88264262 markings, 207509733 edges, 503198 markings/sec, 150 secs
lola: 90767457 markings, 213914874 edges, 500639 markings/sec, 155 secs
lola: 93492600 markings, 220440470 edges, 545029 markings/sec, 160 secs
lola: 96132519 markings, 227012290 edges, 527984 markings/sec, 165 secs
lola: 98748566 markings, 233370034 edges, 523209 markings/sec, 170 secs
lola: 101378298 markings, 239758732 edges, 525946 markings/sec, 175 secs
lola: 103829102 markings, 246339784 edges, 490161 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= CPUUnit))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= CPUUnit))))
lola: processed formula length: 26
lola: 107 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: 4456376 markings, 7265676 edges, 891275 markings/sec, 0 secs
lola: 8435088 markings, 14225802 edges, 795742 markings/sec, 5 secs
lola: 12305504 markings, 20996902 edges, 774083 markings/sec, 10 secs
lola: 16126475 markings, 27682108 edges, 764194 markings/sec, 15 secs
lola: 19826916 markings, 34156846 edges, 740088 markings/sec, 20 secs
lola: 23510501 markings, 40602089 edges, 736717 markings/sec, 25 secs
lola: 27155004 markings, 46979505 edges, 728901 markings/sec, 30 secs
lola: 30806186 markings, 53368341 edges, 730236 markings/sec, 35 secs
lola: 34448491 markings, 59741641 edges, 728461 markings/sec, 40 secs
lola: 38060810 markings, 66063210 edges, 722464 markings/sec, 45 secs
lola: 41706584 markings, 72442459 edges, 729155 markings/sec, 50 secs
lola: 45331128 markings, 78785281 edges, 724909 markings/sec, 55 secs
lola: 48807878 markings, 84869434 edges, 695350 markings/sec, 60 secs
lola: 52333871 markings, 91039535 edges, 705199 markings/sec, 65 secs
lola: 55850482 markings, 97193464 edges, 703322 markings/sec, 70 secs
lola: 59332285 markings, 103286671 edges, 696361 markings/sec, 75 secs
lola: 62824789 markings, 109398146 edges, 698501 markings/sec, 80 secs
lola: 66300819 markings, 115481359 edges, 695206 markings/sec, 85 secs
lola: 69781145 markings, 121571846 edges, 696065 markings/sec, 90 secs
lola: 73242645 markings, 127629478 edges, 692300 markings/sec, 95 secs
lola: 76721963 markings, 133718594 edges, 695864 markings/sec, 100 secs
lola: 80199880 markings, 139804713 edges, 695583 markings/sec, 105 secs
lola: 83632815 markings, 145812436 edges, 686587 markings/sec, 110 secs
lola: 87096787 markings, 151874641 edges, 692794 markings/sec, 115 secs
lola: 90542725 markings, 157904762 edges, 689188 markings/sec, 120 secs
lola: 93931820 markings, 163836106 edges, 677819 markings/sec, 125 secs
lola: 97178042 markings, 169517034 edges, 649244 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no yes yes no unknown no no yes yes no no unknown unknown no no
lola:
preliminary result: no no yes yes no unknown no no yes yes no no unknown unknown no no
lola: memory consumption: 21308 KB
lola: time consumption: 1060 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590645116663

--------------------
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-MT1024DC0256"
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-MT1024DC0256, 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-159033411600023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT1024DC0256.tgz
mv SmallOperatingSystem-PT-MT1024DC0256 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;