Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 4.6K Feb 12 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 9 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 9 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 123 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 361 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.9K Feb 5 01:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 4 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 1 20:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 1 20:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 13 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 8.1K Mar 10 17:31 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1552951729960

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA SmallOperatingSystem-PT-MT1024DC0256-LTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3164
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": "Mon Mar 18 23:28:50 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (X (F ((TaskOnDisk <= TaskSuspended))))))",
"processed_size": 49,
"rewrites": 15
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"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": 259
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F ((TransferToDisk <= TaskReady))))",
"processed_size": 41,
"rewrites": 15
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 281
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"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 (X ((X ((2 <= TaskReady)) U G ((TaskReady <= DiskControllerUnit)))))",
"processed_size": 70,
"rewrites": 15
},
"result":
{
"edges": 1032,
"markings": 776,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (G ((TransferToDisk <= DiskControllerUnit))))",
"processed_size": 50,
"rewrites": 15
},
"result":
{
"edges": 614342,
"markings": 369350,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (X (G ((LoadingMem <= TaskSuspended))))))",
"processed_size": 49,
"rewrites": 15
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 374
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (X (F ((DiskControllerUnit <= LoadingMem))))))",
"processed_size": 54,
"rewrites": 15
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 421
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= TaskSuspended)))",
"processed_size": 28,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 481
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(TransferToDisk <= 0)",
"processed_size": 21,
"rewrites": 17
},
"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": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 561
},
"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 ((2 <= TaskReady))))",
"processed_size": 28,
"rewrites": 15
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 674
},
"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 ((3 <= DiskControllerUnit))))",
"processed_size": 37,
"rewrites": 15
},
"result":
{
"edges": 1780,
"markings": 1272,
"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": 842
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((TaskSuspended <= ExecutingTask))))",
"processed_size": 44,
"rewrites": 15
},
"result":
{
"edges": 4105,
"markings": 3079,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1123
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((LoadingMem <= ExecutingTask))))",
"processed_size": 41,
"rewrites": 15
},
"result":
{
"edges": 3679764,
"markings": 2629129,
"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": 1684
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 3,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((TaskReady <= TaskSuspended) U (FreeMemSegment <= TaskReady)) U ((1 <= TaskSuspended) U (1 <= ExecutingTask))))",
"processed_size": 116,
"rewrites": 15
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 3368
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "A (((TaskReady <= LoadingMem) U (2 <= CPUUnit)))",
"processed_size": 48,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until"
}
}
],
"exit":
{
"error": null,
"memory": 17176,
"runtime": 405.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(F(**))) : A(X((X(**) U G(**)))) : A(G(**)) : A(F(**)) : A(G(F(**))) : A(X(X(X(F(**))))) : A(X(X(G(**)))) : A(X(F(**))) : ** : A(G(F(**))) : A(X(G(**))) : A((** U **)) : A(X(X(X(G(**))))) : A(X(X(X(F(**))))) : A(F(G(**))) : A(((** U **) U (** U **)))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no no no no no no unknown yes no no no yes no no no no ",
"value": "no no no no no no unknown yes no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: A (F (G (F (X ((LoadingMem <= ExecutingTask)))))) : A (X ((X ((2 <= TaskReady)) U G ((TaskReady <= DiskControllerUnit))))) : A (G ((1 <= TaskSuspended))) : A (F ((1 <= TransferToDisk))) : A (G (F (G (F ((TaskSuspended <= ExecutingTask)))))) : A (X (F (X (X ((TaskOnDisk <= TaskSuspended)))))) : A (G (X (X ((TaskSuspended <= CPUUnit))))) : A (X ((X ((DiskControllerUnit <= ExecutingTask)) U F ((TransferToDisk <= TaskReady))))) : A ((3 <= TaskSuspended)) : A (G (G (F (F ((2 <= TaskReady)))))) : A (X (G ((TransferToDisk <= DiskControllerUnit)))) : A (((TaskReady <= LoadingMem) U (2 <= CPUUnit))) : A (X (X (X (G ((LoadingMem <= TaskSuspended)))))) : A (X (X (F (X ((DiskControllerUnit <= LoadingMem)))))) : A (F (G ((3 <= DiskControllerUnit)))) : A ((((TaskReady <= TaskSuspended) U (FreeMemSegment <= TaskReady)) U ((1 <= TaskSuspended) U (1 <= ExecutingTask))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= TaskSuspended)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= TaskSuspended)
lola: processed formula length: 20
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((TaskOnDisk <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((TaskOnDisk <= TaskSuspended))))))
lola: processed formula length: 49
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((TaskSuspended <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((TaskSuspended <= CPUUnit)))))
lola: processed formula length: 42
lola: 15 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: ========================================
lola: 3499913 markings, 7016686 edges, 699983 markings/sec, 0 secs
lola: 6693542 markings, 13885742 edges, 638726 markings/sec, 5 secs
lola: 9369448 markings, 20509613 edges, 535181 markings/sec, 10 secs
lola: 12105228 markings, 26904632 edges, 547156 markings/sec, 15 secs
lola: 15040143 markings, 33542257 edges, 586983 markings/sec, 20 secs
lola: 17571567 markings, 39713716 edges, 506285 markings/sec, 25 secs
lola: 20009606 markings, 46159202 edges, 487608 markings/sec, 30 secs
lola: 22508148 markings, 52274562 edges, 499708 markings/sec, 35 secs
lola: 25127956 markings, 58652618 edges, 523962 markings/sec, 40 secs
lola: 27769999 markings, 65049091 edges, 528409 markings/sec, 45 secs
lola: 30079406 markings, 70880286 edges, 461881 markings/sec, 50 secs
lola: 32373948 markings, 76634656 edges, 458908 markings/sec, 55 secs
lola: 34735307 markings, 82517920 edges, 472272 markings/sec, 60 secs
lola: 36992845 markings, 88199619 edges, 451508 markings/sec, 65 secs
lola: 39331522 markings, 93914056 edges, 467735 markings/sec, 70 secs
lola: 41460257 markings, 99653975 edges, 425747 markings/sec, 75 secs
lola: 43805787 markings, 105520591 edges, 469106 markings/sec, 80 secs
lola: 45934020 markings, 111115769 edges, 425647 markings/sec, 85 secs
lola: 48334094 markings, 116929676 edges, 480015 markings/sec, 90 secs
lola: 50616352 markings, 122749830 edges, 456452 markings/sec, 95 secs
lola: 52820209 markings, 128280589 edges, 440771 markings/sec, 100 secs
lola: 54778531 markings, 133634718 edges, 391664 markings/sec, 105 secs
lola: 56627957 markings, 138811283 edges, 369885 markings/sec, 110 secs
lola: 58706554 markings, 144174683 edges, 415719 markings/sec, 115 secs
lola: 60660517 markings, 149768930 edges, 390793 markings/sec, 120 secs
lola: 62944389 markings, 155337290 edges, 456774 markings/sec, 125 secs
lola: 65232296 markings, 160875232 edges, 457581 markings/sec, 130 secs
lola: 67399543 markings, 166187971 edges, 433449 markings/sec, 135 secs
lola: 69467564 markings, 171779154 edges, 413604 markings/sec, 140 secs
lola: 71438320 markings, 176960515 edges, 394151 markings/sec, 145 secs
lola: 73266247 markings, 181951321 edges, 365585 markings/sec, 150 secs
lola: 75392177 markings, 187305633 edges, 425186 markings/sec, 155 secs
lola: 77259104 markings, 192378758 edges, 373385 markings/sec, 160 secs
lola: 79441261 markings, 197790580 edges, 436431 markings/sec, 165 secs
lola: 81233388 markings, 202676818 edges, 358425 markings/sec, 170 secs
lola: 83072535 markings, 207631231 edges, 367829 markings/sec, 175 secs
lola: 84745336 markings, 212448665 edges, 334560 markings/sec, 180 secs
lola: 85175937 markings, 213658036 edges, 86120 markings/sec, 185 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 (X (F ((TransferToDisk <= TaskReady))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((TransferToDisk <= TaskReady))))
lola: processed formula length: 41
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((2 <= TaskReady)) U G ((TaskReady <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((2 <= TaskReady)) U G ((TaskReady <= DiskControllerUnit)))))
lola: processed formula length: 70
lola: 15 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 776 markings, 1032 edges
lola: ========================================
lola: subprocess 5 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((TransferToDisk <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((TransferToDisk <= DiskControllerUnit))))
lola: processed formula length: 50
lola: 15 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: 369350 markings, 614342 edges
lola: ========================================
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((LoadingMem <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((LoadingMem <= TaskSuspended))))))
lola: processed formula length: 49
lola: 15 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: 8 markings, 8 edges
lola: subprocess 7 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((DiskControllerUnit <= LoadingMem))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((DiskControllerUnit <= LoadingMem))))))
lola: processed formula length: 54
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= TaskSuspended)))
lola: processed formula length: 28
lola: 17 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (TaskSuspended <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= TransferToDisk)))
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: (TransferToDisk <= 0)
lola: processed formula length: 21
lola: 17 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 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= TaskReady))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= TaskReady))))
lola: processed formula length: 28
lola: 15 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, 4 edges
lola: ========================================
lola: subprocess 11 will run for 674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= DiskControllerUnit))))
lola: processed formula length: 37
lola: 15 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 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: 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: 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: 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: 1272 markings, 1780 edges
lola: ========================================
lola: subprocess 12 will run for 842 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((TaskSuspended <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((TaskSuspended <= ExecutingTask))))
lola: processed formula length: 44
lola: 15 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: 3079 markings, 4105 edges
lola: ========================================
lola: subprocess 13 will run for 1123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((LoadingMem <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((LoadingMem <= ExecutingTask))))
lola: processed formula length: 41
lola: 15 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: 2629129 markings, 3679764 edges
lola: ========================================
lola: subprocess 14 will run for 1684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((TaskReady <= TaskSuspended) U (FreeMemSegment <= TaskReady)) U ((1 <= TaskSuspended) U (1 <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((TaskReady <= TaskSuspended) U (FreeMemSegment <= TaskReady)) U ((1 <= TaskSuspended) U (1 <= ExecutingTask))))
lola: processed formula length: 116
lola: 15 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 15 will run for 3368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((TaskReady <= LoadingMem) U (2 <= CPUUnit)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((TaskReady <= LoadingMem) U (2 <= CPUUnit)))
lola: processed formula length: 48
lola: 19 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((TaskSuspended <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((TaskSuspended <= CPUUnit)))))
lola: processed formula length: 42
lola: 15 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: 3405865 markings, 6825763 edges, 681173 markings/sec, 0 secs
lola: 6531407 markings, 13505109 edges, 625108 markings/sec, 5 secs
lola: 9175421 markings, 19994475 edges, 528803 markings/sec, 10 secs
lola: 11632897 markings, 25927705 edges, 491495 markings/sec, 15 secs
lola: 14367189 markings, 32005539 edges, 546858 markings/sec, 20 secs
lola: 16761080 markings, 37551324 edges, 478778 markings/sec, 25 secs
lola: 18863314 markings, 43162113 edges, 420447 markings/sec, 30 secs
lola: 21149619 markings, 48862345 edges, 457261 markings/sec, 35 secs
lola: 23423771 markings, 54519437 edges, 454830 markings/sec, 40 secs
lola: 25802384 markings, 60456850 edges, 475723 markings/sec, 45 secs
lola: 28373796 markings, 66513756 edges, 514282 markings/sec, 50 secs
lola: 30663388 markings, 72327638 edges, 457918 markings/sec, 55 secs
lola: 32975787 markings, 77898400 edges, 462480 markings/sec, 60 secs
lola: 35122787 markings, 83471570 edges, 429400 markings/sec, 65 secs
lola: 37338246 markings, 89051881 edges, 443092 markings/sec, 70 secs
lola: 39607286 markings, 94681244 edges, 453808 markings/sec, 75 secs
lola: 41753843 markings, 100378566 edges, 429311 markings/sec, 80 secs
lola: 44000329 markings, 106050523 edges, 449297 markings/sec, 85 secs
lola: 46057525 markings, 111445174 edges, 411439 markings/sec, 90 secs
lola: 48401229 markings, 117118013 edges, 468741 markings/sec, 95 secs
lola: 50634629 markings, 122792388 edges, 446680 markings/sec, 100 secs
lola: 52803030 markings, 128229483 edges, 433680 markings/sec, 105 secs
lola: 54743642 markings, 133538341 edges, 388122 markings/sec, 110 secs
lola: 56610950 markings, 138761452 edges, 373462 markings/sec, 115 secs
lola: 58667274 markings, 144082968 edges, 411265 markings/sec, 120 secs
lola: 60115171 markings, 148132037 edges, 289579 markings/sec, 125 secs
lola: 62223527 markings, 153561172 edges, 421671 markings/sec, 130 secs
lola: 64563767 markings, 159320271 edges, 468048 markings/sec, 135 secs
lola: 66728542 markings, 164566612 edges, 432955 markings/sec, 140 secs
lola: 68820571 markings, 169993288 edges, 418406 markings/sec, 145 secs
lola: 70828472 markings, 175243747 edges, 401580 markings/sec, 150 secs
lola: 72459773 markings, 179833449 edges, 326260 markings/sec, 155 secs
lola: 74439670 markings, 184836591 edges, 395979 markings/sec, 160 secs
lola: 76344855 markings, 189846203 edges, 381037 markings/sec, 165 secs
lola: 78139134 markings, 194740924 edges, 358856 markings/sec, 170 secs
lola: 80202567 markings, 199865349 edges, 412687 markings/sec, 175 secs
lola: 81974512 markings, 204525204 edges, 354389 markings/sec, 180 secs
lola: 83626710 markings, 209172428 edges, 330440 markings/sec, 185 secs
lola: 84926542 markings, 212945909 edges, 259966 markings/sec, 190 secs
lola: 85302314 markings, 214028602 edges, 75154 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no unknown yes no no no yes no no no no
lola:
preliminary result: no no no no no no unknown yes no no no yes no no no no
lola: memory consumption: 17176 KB
lola: time consumption: 405 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552952135266

--------------------
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="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is 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 r159-csrt-155286431100438"
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" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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