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-155286431100445.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-MT1024DC0512, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-csrt-155286431100445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 5.1K Feb 12 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 12 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 9 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K Feb 5 01:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 4 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 1 20:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 1 20:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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-MT1024DC0512-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552952005752

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SmallOperatingSystem-PT-MT1024DC0512 @ 3570 seconds

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

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2949
rslt: Output for CTLCardinality @ SmallOperatingSystem-PT-MT1024DC0512

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon Mar 18 23:33:25 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": 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": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((DiskControllerUnit + 1 <= FreeMemSegment))",
"processed_size": 44,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(ExecutingTask + 1 <= TaskReady)",
"processed_size": 32,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": "AX(EG((TaskReady <= TaskSuspended)))",
"processed_size": 36,
"rewrites": 33
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 1023,
"markings": 1024,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((FreeMemSegment + 1 <= DiskControllerUnit) OR (CPUUnit + 1 <= DiskControllerUnit) OR ((2 <= LoadingMem)))",
"processed_size": 108,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 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 ((ExecutingTask <= FreeMemSegment)))",
"processed_size": 41,
"rewrites": 33
},
"result":
{
"edges": 2050,
"markings": 1795,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(FreeMemSegment <= 2)",
"processed_size": 21,
"rewrites": 34
},
"result":
{
"edges": 1531,
"markings": 1532,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EF((AX((FreeMemSegment <= LoadingMem)) AND ((2 <= CPUUnit) OR (1 <= CPUUnit) OR (ExecutingTask + 1 <= TaskOnDisk))))",
"processed_size": 118,
"rewrites": 33
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 3070,
"markings": 2048,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((DiskControllerUnit <= 0)))",
"processed_size": 33,
"rewrites": 32
},
"result":
{
"edges": 512,
"markings": 513,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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 (((1 <= FreeMemSegment) OR (1 <= CPUUnit))))",
"processed_size": 50,
"rewrites": 33
},
"result":
{
"edges": 9722,
"markings": 7165,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((1 <= CPUUnit) OR (ExecutingTask <= CPUUnit))))",
"processed_size": 55,
"rewrites": 33
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((FreeMemSegment <= TaskSuspended)))",
"processed_size": 41,
"rewrites": 32
},
"result":
{
"edges": 1536,
"markings": 1537,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((((1 <= CPUUnit)) OR (3 <= ExecutingTask)) AND ((ExecutingTask <= 0) OR (TransferToDisk + 1 <= FreeMemSegment)))))",
"processed_size": 123,
"rewrites": 33
},
"result":
{
"edges": 5110,
"markings": 3581,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 649
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((TaskReady <= TransferToDisk)))",
"processed_size": 37,
"rewrites": 32
},
"result":
{
"edges": 512,
"markings": 513,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 811
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "AG(E((TaskReady <= FreeMemSegment) U (2 <= TransferToDisk)))",
"processed_size": 60,
"rewrites": 33
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 7179,
"markings": 3080,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1081
},
"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 <= CPUUnit)))",
"processed_size": 22,
"rewrites": 33
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 13,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1622
},
"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": "(1 <= CPUUnit)",
"processed_size": 14,
"rewrites": 34
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3244
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((LoadingMem <= DiskControllerUnit))",
"processed_size": 36,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3244
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((TaskSuspended + 1 <= DiskControllerUnit)))",
"processed_size": 49,
"rewrites": 33
},
"result":
{
"edges": 512,
"markings": 513,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(1 <= CPUUnit)",
"processed_size": 14,
"rewrites": 34
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((LoadingMem <= DiskControllerUnit))",
"processed_size": 36,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((ExecutingTask + 1 <= TaskOnDisk)))",
"processed_size": 41,
"rewrites": 33
},
"result":
{
"edges": 3581,
"markings": 3071,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22600,
"runtime": 621.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : ((** OR E((** U **))) AND A(G(**))) : A(X(A(G(**)))) : (((A(F(**)) AND **) OR **) AND A(X(E(G(**))))) : (** AND (A(G(**)) AND (A(X(*)) OR **))) : A(G(**)) : FALSE : E(F(A(G(**)))) : E(G(**)) : A(G(**)) : (A((** U **)) AND A(G(**))) : E(F((A(X(**)) AND **))) : A(G(E((** U **)))) : A(G(**)) : E(F(**)) : (* AND (A(F(**)) OR A(G(*))))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "yes no no no no no no unknown no no no yes no no yes no ",
"value": "yes no no no no no no unknown no no no yes no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (FreeMemSegment <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (LoadingMem <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (TaskOnDisk <= DiskControllerUnit)
lola: after: (512 <= 0)
lola: LP says that atomic proposition is always true: (TransferToDisk <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (DiskControllerUnit <= TaskOnDisk)
lola: after: (0 <= 512)
lola: E (F (E (F ((DiskControllerUnit <= 0))))) : ((((((DiskControllerUnit <= ExecutingTask) AND (3 <= FreeMemSegment)) OR (LoadingMem + 1 <= CPUUnit))) OR E (((2 <= TaskSuspended) U (2 <= LoadingMem)))) AND A (G ((TaskSuspended + 1 <= DiskControllerUnit)))) : A (G (A (X ((3 <= FreeMemSegment))))) : (((A (F ((TaskReady <= ExecutingTask))) AND ((DiskControllerUnit + 1 <= FreeMemSegment))) OR (((FreeMemSegment + 1 <= TaskSuspended) AND (FreeMemSegment <= 0)) OR ((TaskReady + 1 <= TransferToDisk) AND (TransferToDisk + 1 <= FreeMemSegment)))) AND A (X (E (G ((TaskReady <= TaskSuspended)))))) : ((((((1 <= DiskControllerUnit)) OR (TaskOnDisk + 1 <= CPUUnit)) AND A (G ((ExecutingTask <= FreeMemSegment)))) AND (FreeMemSegment <= TaskOnDisk)) AND (NOT(E (X ((CPUUnit <= LoadingMem)))) OR ((FreeMemSegment + 1 <= DiskControllerUnit) OR (CPUUnit + 1 <= DiskControllerUnit) OR ((2 <= LoadingMem))))) : A (G (A (G (((1 <= FreeMemSegment) OR (1 <= CPUUnit)))))) : NOT(A (G (E (F ((0 <= 0)))))) : E (F (A (G ((DiskControllerUnit <= 1))))) : E (G (A (((512 <= 0) U (TaskReady <= TransferToDisk))))) : A (G (((((1 <= CPUUnit)) OR (3 <= ExecutingTask)) AND ((ExecutingTask <= 0) OR (TransferToDisk + 1 <= FreeMemSegment))))) : (A (((DiskControllerUnit + 1 <= TaskSuspended) U ((1 <= CPUUnit) OR (2 <= ExecutingTask)))) AND E (G (A (G ((1 <= CPUUnit)))))) : E (F ((A (X ((FreeMemSegment <= LoadingMem))) AND ((2 <= CPUUnit) OR (1 <= CPUUnit) OR (ExecutingTask + 1 <= TaskOnDisk))))) : A (G (E (((TaskReady <= FreeMemSegment) U (2 <= TransferToDisk))))) : A (G (A (G (((1 <= CPUUnit) OR (ExecutingTask <= CPUUnit)))))) : A (F (E (((0 <= 0) U (FreeMemSegment <= TaskSuspended))))) : (NOT((A (F ((0 <= 512))) AND ((DiskControllerUnit + 1 <= LoadingMem)))) AND (A (F ((CPUUnit <= 0))) OR NOT(E (F ((TaskOnDisk <= ExecutingTask))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: 31 rewrites
lola: closed formula file CTLCardinality.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: (((A (F ((TaskReady <= ExecutingTask))) AND ((DiskControllerUnit + 1 <= FreeMemSegment))) OR (((FreeMemSegment + 1 <= TaskSuspended) AND (FreeMemSegment <= 0)) OR ((TaskReady + 1 <= TransferToDisk) AND (TransferToDisk + 1 <= FreeMemSegment)))) AND A (X (E (G ((TaskReady <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((DiskControllerUnit + 1 <= FreeMemSegment))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((DiskControllerUnit + 1 <= FreeMemSegment))
lola: processed formula length: 44
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((TaskReady <= ExecutingTask)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (ExecutingTask + 1 <= TaskReady)
lola: processed formula length: 32
lola: 34 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (TaskReady <= ExecutingTask)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((TaskReady <= TaskSuspended)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((TaskReady <= TaskSuspended)))
lola: processed formula length: 36
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1024 markings, 1023 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= DiskControllerUnit)) OR (TaskOnDisk + 1 <= CPUUnit)) AND (A (G ((ExecutingTask <= FreeMemSegment))) AND (A (X ((LoadingMem + 1 <= CPUUnit))) OR ((FreeMemSegment + 1 <= DiskControllerUnit) OR (CPUUnit + 1 <= DiskControllerUnit) OR ((2 <= LoadingMem))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FreeMemSegment + 1 <= DiskControllerUnit) OR (CPUUnit + 1 <= DiskControllerUnit) OR ((2 <= LoadingMem)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FreeMemSegment + 1 <= DiskControllerUnit) OR (CPUUnit + 1 <= DiskControllerUnit) OR ((2 <= LoadingMem)))
lola: processed formula length: 108
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ExecutingTask <= FreeMemSegment)))
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 ((ExecutingTask <= FreeMemSegment)))
lola: processed formula length: 41
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: (FreeMemSegment + 1 <= ExecutingTask)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1795 markings, 2050 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((3 <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (FreeMemSegment <= 2)
lola: processed formula length: 21
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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: (FreeMemSegment <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 1532 markings, 1531 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((FreeMemSegment <= LoadingMem))) AND ((2 <= CPUUnit) OR (1 <= CPUUnit) OR (ExecutingTask + 1 <= TaskOnDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX((FreeMemSegment <= LoadingMem)) AND ((2 <= CPUUnit) OR (1 <= CPUUnit) OR (ExecutingTask + 1 <= TaskOnDisk))))
lola: processed formula length: 118
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2048 markings, 3070 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((DiskControllerUnit <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((DiskControllerUnit <= 0)))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file CTLCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (DiskControllerUnit <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 513 markings, 512 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= FreeMemSegment) OR (1 <= CPUUnit))))
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 <= FreeMemSegment) OR (1 <= CPUUnit))))
lola: processed formula length: 50
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: ((FreeMemSegment <= 0) AND (CPUUnit <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7165 markings, 9722 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= CPUUnit) OR (ExecutingTask <= CPUUnit))))
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 <= CPUUnit) OR (ExecutingTask <= CPUUnit))))
lola: processed formula length: 55
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: ((CPUUnit <= 0) AND (CPUUnit + 1 <= ExecutingTask))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FreeMemSegment <= TaskSuspended)))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file CTLCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FreeMemSegment <= TaskSuspended)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1537 markings, 1536 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= CPUUnit)) OR (3 <= ExecutingTask)) AND ((ExecutingTask <= 0) OR (TransferToDisk + 1 <= FreeMemSegment)))))
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 <= CPUUnit)) OR (3 <= ExecutingTask)) AND ((ExecutingTask <= 0) OR (TransferToDisk + 1 <= FreeMemSegment)))))
lola: processed formula length: 123
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: ((((CPUUnit <= 0)) AND (ExecutingTask <= 2)) OR ((1 <= ExecutingTask) AND (FreeMemSegment <= TransferToDisk)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3581 markings, 5110 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((DiskControllerUnit <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (2 <= DiskControllerUnit)
lola: processed formula length: 25
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= DiskControllerUnit)
lola: state equation task get result unparse finished id 1
lola: formula 0: (DiskControllerUnit <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3552809 markings, 6714397 edges, 710562 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6810897 markings, 13631790 edges, 651618 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9469394 markings, 20133952 edges, 531699 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12320887 markings, 26563209 edges, 570299 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 14956706 markings, 32810889 edges, 527164 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17828404 markings, 39397254 edges, 574340 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20376797 markings, 45675992 edges, 509679 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 23406790 markings, 52402727 edges, 605999 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 26025868 markings, 58844309 edges, 523816 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28851775 markings, 65161776 edges, 565181 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 31395277 markings, 71352337 edges, 508700 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 33941491 markings, 77582257 edges, 509243 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 36495411 markings, 83625916 edges, 510784 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 39078686 markings, 89729409 edges, 516655 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 41286882 markings, 95637259 edges, 441639 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 43801999 markings, 101952877 edges, 503023 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 46613886 markings, 108374212 edges, 562377 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 49338982 markings, 114528455 edges, 545019 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 51734031 markings, 120674909 edges, 479010 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 54365650 markings, 126803309 edges, 526324 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 56641688 markings, 132726586 edges, 455208 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 59235024 markings, 138759025 edges, 518667 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 61679509 markings, 144892886 edges, 488897 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 64075082 markings, 150891434 edges, 479115 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 66620699 markings, 157051733 edges, 509123 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 68704860 markings, 162618945 edges, 416832 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 71059607 markings, 168595775 edges, 470949 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 73125687 markings, 174111200 edges, 413216 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 75295243 markings, 180006938 edges, 433911 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 77782549 markings, 185928842 edges, 497461 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 80224329 markings, 191971790 edges, 488356 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 82501933 markings, 197906268 edges, 455521 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 84808058 markings, 204040637 edges, 461225 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 86887029 markings, 209974725 edges, 415794 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 89220810 markings, 215631794 edges, 466756 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 91710427 markings, 221446386 edges, 497923 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 93920282 markings, 227203815 edges, 441971 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 96195293 markings, 233132249 edges, 455002 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 98284379 markings, 238849570 edges, 417817 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 100372782 markings, 244575524 edges, 417681 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 102644069 markings, 250583431 edges, 454257 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 105128180 markings, 256514327 edges, 496822 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 107558674 markings, 262346305 edges, 486099 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 109957903 markings, 268139389 edges, 479846 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 112026363 markings, 274131990 edges, 413692 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 114092657 markings, 279766956 edges, 413259 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 116142790 markings, 285349480 edges, 410027 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 118331374 markings, 291050186 edges, 437717 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 120571197 markings, 296893569 edges, 447965 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 122759908 markings, 302509082 edges, 437742 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 125124869 markings, 308505467 edges, 472992 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 127181414 markings, 314134219 edges, 411309 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 129419261 markings, 319766860 edges, 447569 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 131701420 markings, 325563171 edges, 456432 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 133930982 markings, 331466308 edges, 445912 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 135966446 markings, 336911754 edges, 407093 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 138182756 markings, 342462259 edges, 443262 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 140103238 markings, 347774522 edges, 384096 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 142037538 markings, 353355692 edges, 386860 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 143564809 markings, 356754206 edges, 305454 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 143641410 markings, 356935329 edges, 15320 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 143761734 markings, 357216162 edges, 24065 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 143761767 markings, 357216259 edges, 7 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((TaskReady <= TransferToDisk)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((TaskReady <= TransferToDisk)))
lola: processed formula length: 37
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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: (TransferToDisk + 1 <= TaskReady)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 513 markings, 512 edges
lola: ========================================
lola: subprocess 12 will run for 811 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((TaskReady <= FreeMemSegment) U (2 <= TransferToDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((TaskReady <= FreeMemSegment) U (2 <= TransferToDisk)))
lola: processed formula length: 60
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3080 markings, 7179 edges
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((DiskControllerUnit + 1 <= TaskSuspended) U ((1 <= CPUUnit) OR (2 <= ExecutingTask)))) AND A (G ((1 <= CPUUnit))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= CPUUnit)))
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 <= CPUUnit)))
lola: processed formula length: 22
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: (CPUUnit <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1622 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((LoadingMem <= DiskControllerUnit)) AND (A (F ((CPUUnit <= 0))) OR A (G ((ExecutingTask + 1 <= TaskOnDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1622 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((CPUUnit <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (1 <= CPUUnit)
lola: processed formula length: 14
lola: 34 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CPUUnit <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 15 will run for 3244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((LoadingMem <= DiskControllerUnit))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((LoadingMem <= DiskControllerUnit))
lola: processed formula length: 36
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((((DiskControllerUnit <= ExecutingTask) AND (3 <= FreeMemSegment)) OR (LoadingMem + 1 <= CPUUnit))) OR E (((2 <= TaskSuspended) U (2 <= LoadingMem)))) AND A (G ((TaskSuspended + 1 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskSuspended + 1 <= DiskControllerUnit)))
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 ((TaskSuspended + 1 <= DiskControllerUnit)))
lola: processed formula length: 49
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: (DiskControllerUnit <= TaskSuspended)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 513 markings, 512 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((DiskControllerUnit <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (2 <= DiskControllerUnit)
lola: processed formula length: 25
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= DiskControllerUnit)
lola: state equation task get result unparse finished id 1
lola: formula 0: (DiskControllerUnit <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-16-1.sara
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-1.sara.
sara: place or transition ordering is non-deterministic

sara: try reading problem file CTLCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3548850 markings, 6707011 edges, 709770 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6786440 markings, 13582894 edges, 647518 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9482309 markings, 20163858 edges, 539174 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12342584 markings, 26621387 edges, 572055 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 15021302 markings, 32983001 edges, 535744 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17870011 markings, 39480836 edges, 569742 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20393707 markings, 45721004 edges, 504739 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 23306539 markings, 52168158 edges, 582566 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 25829332 markings, 58451446 edges, 504559 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28820992 markings, 65079388 edges, 598332 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 31460946 markings, 71483520 edges, 527991 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 33975423 markings, 77672865 edges, 502895 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 36594503 markings, 83890219 edges, 523816 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 39324710 markings, 90382891 edges, 546041 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 41684495 markings, 96697951 edges, 471957 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 44516976 markings, 103620954 edges, 566496 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 47479990 markings, 110156767 edges, 592603 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 50139718 markings, 116658761 edges, 531946 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 52775379 markings, 123283524 edges, 527132 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 55309643 markings, 129333766 edges, 506853 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 57943083 markings, 135616974 edges, 526688 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 60500202 markings, 141776227 edges, 511424 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 63005511 markings, 148209879 edges, 501062 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 65642764 markings, 154647293 edges, 527451 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 67899473 markings, 160469783 edges, 451342 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 70253267 markings, 166552618 edges, 470759 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 72460694 markings, 172332023 edges, 441485 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 74686984 markings, 178383859 edges, 445258 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 77167251 markings, 184286834 edges, 496053 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 79631719 markings, 190528326 edges, 492894 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 82152344 markings, 196934729 edges, 504125 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 84568871 markings, 203442575 edges, 483305 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 86807342 markings, 209762238 edges, 447694 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 89294030 markings, 215778522 edges, 497338 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 91951404 markings, 222097517 edges, 531475 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 94282101 markings, 228289523 edges, 466139 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 96559337 markings, 234103472 edges, 455447 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 98640016 markings, 239798087 edges, 416136 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 100682458 markings, 245505228 edges, 408488 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 102957333 markings, 251443765 edges, 454975 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 105467791 markings, 257420932 edges, 502092 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 107922189 markings, 263348307 edges, 490880 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 110410145 markings, 269389021 edges, 497591 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 112570515 markings, 275599882 edges, 432074 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 114746795 markings, 281541150 edges, 435256 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 116926528 markings, 287491385 edges, 435947 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 119232653 markings, 293294493 edges, 461225 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 121362664 markings, 299005417 edges, 426002 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 123576037 markings, 304693294 edges, 442675 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 125852661 markings, 310529235 edges, 455325 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 128164914 markings, 316488461 edges, 462451 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 130261616 markings, 322085542 edges, 419340 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 132614655 markings, 327992635 edges, 470608 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 134854159 markings, 333763373 edges, 447901 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 136826284 markings, 339205608 edges, 394425 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 138986608 markings, 344719576 edges, 432065 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 140997788 markings, 350256661 edges, 402236 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 143296741 markings, 356008254 edges, 459791 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 143726513 markings, 357134929 edges, 85954 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((LoadingMem <= DiskControllerUnit)) AND (A (F ((CPUUnit <= 0))) OR A (G ((ExecutingTask + 1 <= TaskOnDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((CPUUnit <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (1 <= CPUUnit)
lola: processed formula length: 14
lola: 34 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CPUUnit <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((LoadingMem <= DiskControllerUnit))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((LoadingMem <= DiskControllerUnit))
lola: processed formula length: 36
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((ExecutingTask + 1 <= TaskOnDisk)))
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:788
lola: processed formula: A (G ((ExecutingTask + 1 <= TaskOnDisk)))
lola: processed formula length: 41
lola: 33 rewrites
lola: closed formula file CTLCardinality.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (TaskOnDisk <= ExecutingTask)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3071 markings, 3581 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no unknown no no no yes no no yes no
lola:
preliminary result: yes no no no no no no unknown no no no yes no no yes no
lola: memory consumption: 22600 KB
lola: time consumption: 621 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552952626970

--------------------
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-MT1024DC0512"
export BK_EXAMINATION="CTLCardinality"
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-MT1024DC0512, examination is CTLCardinality"
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-155286431100445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT1024DC0512.tgz
mv SmallOperatingSystem-PT-MT1024DC0512 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;