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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 5.4K Feb 12 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 12 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 9 02:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 9 02:08 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:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 4 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 1 21:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 1 21:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 13 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 8.1K Mar 10 17:31 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1552952606926

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

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

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

FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT4096DC2048-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2385
rslt: Output for CTLCardinality @ SmallOperatingSystem-PT-MT4096DC2048

{
"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:43:26 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": "TRUE",
"processed_size": 4,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (((ExecutingTask <= TaskSuspended) U (3 <= ExecutingTask)))",
"processed_size": 61,
"rewrites": 52
},
"result":
{
"edges": 18879488,
"markings": 6296577,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "A (((1 <= FreeMemSegment) U ((TaskReady <= ExecutingTask) AND (LoadingMem <= FreeMemSegment))))",
"processed_size": 95,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(((3 <= TransferToDisk) OR (3 <= ExecutingTask)))",
"processed_size": 52,
"rewrites": 50
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"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": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 464
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 (((3 <= CPUUnit) AND (1 <= DiskControllerUnit))))",
"processed_size": 54,
"rewrites": 51
},
"result":
{
"edges": 2048,
"markings": 2049,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 541
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (F (((1 <= TransferToDisk) AND (CPUUnit <= TransferToDisk) AND (TaskSuspended + 1 <= TaskReady))))",
"processed_size": 100,
"rewrites": 50
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 747
},
"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 ((TaskReady <= FreeMemSegment)))",
"processed_size": 37,
"rewrites": 51
},
"result":
{
"edges": 4097,
"markings": 4098,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 997
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(DiskControllerUnit + 1 <= ExecutingTask)",
"processed_size": 41,
"rewrites": 53
},
"result":
{
"edges": 69235710,
"markings": 37767170,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1472
},
"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": "DEADLOCK",
"processed_size": 8,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2945
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= TransferToDisk)",
"processed_size": 21,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"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": 2945
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2945
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((CPUUnit <= DiskControllerUnit)) OR (1 <= FreeMemSegment) OR ((ExecutingTask + 1 <= DiskControllerUnit) AND (FreeMemSegment + 1 <= DiskControllerUnit)))",
"processed_size": 156,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "E (F (((3 <= TransferToDisk) AND (FreeMemSegment <= TaskSuspended))))",
"processed_size": 69,
"rewrites": 50
},
"result":
{
"edges": 47797,
"markings": 33461,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"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": 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": "DEADLOCK",
"processed_size": 8,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= TransferToDisk)",
"processed_size": 21,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 ((TaskOnDisk <= LoadingMem)))",
"processed_size": 34,
"rewrites": 50
},
"result":
{
"edges": 2048,
"markings": 2049,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((CPUUnit <= DiskControllerUnit)) OR (1 <= FreeMemSegment) OR ((ExecutingTask + 1 <= DiskControllerUnit) AND (FreeMemSegment + 1 <= DiskControllerUnit)))",
"processed_size": 156,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((ExecutingTask <= TaskReady) U (TransferToDisk <= TaskSuspended)))",
"processed_size": 70,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "E (F (((3 <= TransferToDisk) AND (FreeMemSegment <= TaskSuspended))))",
"processed_size": 69,
"rewrites": 50
},
"result":
{
"edges": 47797,
"markings": 33461,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22504,
"runtime": 1185.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F((E(F(**)) AND E(X(**))))) : TRUE : E(F(**)) : ** : TRUE : FALSE : ((A(X(**)) OR E((** U **))) AND A((** U **))) : FALSE : (** OR (E(F(**)) OR DEADLOCK)) : A(F(A(G(**)))) : ((E(F(**)) OR E(F(**))) AND (** AND A((** U **)))) : (A(G(**)) AND A(G(**))) : NODEADLOCK : FALSE : A(G(E(F(**))))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no unknown yes no no yes no no no yes no yes no yes no unknown ",
"value": "no unknown yes no no yes no no no yes no yes no yes no unknown "
},
"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: (LoadingMem <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TransferToDisk <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskReady <= CPUUnit)
lola: place invariant simplifies atomic proposition
lola: before: (DiskControllerUnit <= TaskOnDisk)
lola: after: (0 <= 2048)
lola: place invariant simplifies atomic proposition
lola: before: (TaskOnDisk <= DiskControllerUnit)
lola: after: (2048 <= 0)
lola: LP says that atomic proposition is always true: (FreeMemSegment <= CPUUnit)
lola: place invariant simplifies atomic proposition
lola: before: (TaskOnDisk <= DiskControllerUnit)
lola: after: (2048 <= 0)
lola: LP says that atomic proposition is always true: (TaskSuspended <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (DiskControllerUnit <= TaskOnDisk)
lola: after: (0 <= 2048)
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TransferToDisk <= CPUUnit)
lola: E (G (A (G (((3 <= CPUUnit) AND (1 <= DiskControllerUnit)))))) : E (F ((E (F ((ExecutingTask <= TaskSuspended))) AND E (X ((CPUUnit <= ExecutingTask)))))) : A (G ((E (G ((LoadingMem <= TaskOnDisk))) OR E (X ((TransferToDisk <= FreeMemSegment)))))) : E (F (((1 <= TransferToDisk) AND (CPUUnit <= TransferToDisk) AND (TaskSuspended + 1 <= TaskReady)))) : (((TaskOnDisk <= ExecutingTask) AND (1 <= ExecutingTask) AND (TaskSuspended <= 2)) OR E (F ((CPUUnit + 1 <= TaskReady)))) : (A (G (E (F ((0 <= 2048))))) OR ((((DiskControllerUnit + 1 <= ExecutingTask) OR ((3 <= CPUUnit))) AND (3 <= TaskSuspended)) OR (((FreeMemSegment <= 2) OR (TaskReady + 1 <= TaskOnDisk)) AND (3 <= ExecutingTask)))) : E ((() U ())) : ((A (X (((3 <= TransferToDisk) OR (3 <= ExecutingTask)))) OR E (((ExecutingTask <= TaskSuspended) U (3 <= ExecutingTask)))) AND A (((1 <= FreeMemSegment) U ((TaskReady <= ExecutingTask) AND (LoadingMem <= FreeMemSegment))))) : E ((E (F ((TaskReady <= LoadingMem))) U (1 <= 0))) : ((2 <= TaskOnDisk) AND (((2 <= TransferToDisk) OR E (F ((TaskOnDisk <= LoadingMem)))) OR A (X ((2049 <= 0))))) : (A (F (A (G ((ExecutingTask <= DiskControllerUnit))))) AND A (X (E (F ((0 <= 0)))))) : ((E (F (((CPUUnit <= ExecutingTask) AND (LoadingMem <= TaskReady)))) OR E (F (((3 <= TransferToDisk) AND (FreeMemSegment <= TaskSuspended))))) AND ((((CPUUnit <= DiskControllerUnit)) OR (1 <= FreeMemSegment) OR ((ExecutingTask + 1 <= DiskControllerUnit) AND (FreeMemSegment + 1 <= DiskControllerUnit))) AND A (((ExecutingTask <= TaskReady) U (TransferToDisk <= TaskSuspended))))) : A (G (((TaskReady + 1 <= FreeMemSegment) AND E (G ((TaskReady <= FreeMemSegment)))))) : E (X (A (G (())))) : NOT(A (F (A (G ((0 <= 0)))))) : A (G (E (((TransferToDisk <= CPUUnit) U (ExecutingTask <= CPUUnit)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:136
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 49 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((TaskOnDisk <= ExecutingTask) AND (1 <= ExecutingTask) AND (TaskSuspended <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((TaskOnDisk <= ExecutingTask) AND (1 <= ExecutingTask) AND (TaskSuspended <= 2))
lola: processed formula length: 81
lola: 49 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 49 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 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: 49 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 49 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 49 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 6 will run for 356 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: 49 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 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X (((3 <= TransferToDisk) OR (3 <= ExecutingTask)))) OR E (((ExecutingTask <= TaskSuspended) U (3 <= ExecutingTask)))) AND A (((1 <= FreeMemSegment) U ((TaskReady <= ExecutingTask) AND (LoadingMem <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((ExecutingTask <= TaskSuspended) U (3 <= ExecutingTask)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((ExecutingTask <= TaskSuspended) U (3 <= ExecutingTask)))
lola: processed formula length: 61
lola: 52 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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: (3 <= 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-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: sara is running 0 secs || 3547041 markings, 7090640 edges, 709408 markings/sec, 0 secs
lola: sara is running 5 secs || 6296577 markings, 14297525 edges, 549907 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 6296577 markings, 18879488 edges
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= FreeMemSegment) U ((TaskReady <= ExecutingTask) AND (LoadingMem <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((1 <= FreeMemSegment) U ((TaskReady <= ExecutingTask) AND (LoadingMem <= FreeMemSegment))))
lola: processed formula length: 95
lola: 54 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= TransferToDisk) OR (3 <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((3 <= TransferToDisk) OR (3 <= ExecutingTask)))
lola: processed formula length: 52
lola: 50 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((ExecutingTask <= TaskSuspended))) AND E (X ((CPUUnit <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EF((ExecutingTask <= TaskSuspended)) AND EX((CPUUnit <= ExecutingTask))))
lola: processed formula length: 77
lola: 52 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: 2051776 markings, 6151060 edges, 410355 markings/sec, 0 secs
lola: 4010189 markings, 12026128 edges, 391683 markings/sec, 5 secs
lola: 5815320 markings, 17441357 edges, 361026 markings/sec, 10 secs
lola: 7572235 markings, 22705638 edges, 351383 markings/sec, 15 secs
lola: 9303424 markings, 27903021 edges, 346238 markings/sec, 20 secs
lola: 11119005 markings, 33351881 edges, 363116 markings/sec, 25 secs
lola: 12999348 markings, 38992699 edges, 376069 markings/sec, 30 secs
lola: 14832374 markings, 44491552 edges, 366605 markings/sec, 35 secs
lola: 16524555 markings, 49565272 edges, 338436 markings/sec, 40 secs
lola: 18206580 markings, 54610517 edges, 336405 markings/sec, 45 secs
lola: 19924409 markings, 59769669 edges, 343566 markings/sec, 50 secs
lola: 21708274 markings, 65121842 edges, 356773 markings/sec, 55 secs
lola: 23369960 markings, 70107777 edges, 332337 markings/sec, 60 secs
lola: 25025733 markings, 75074206 edges, 331155 markings/sec, 65 secs
lola: 26635652 markings, 79903929 edges, 321984 markings/sec, 70 secs
lola: 28216761 markings, 84648876 edges, 316222 markings/sec, 75 secs
lola: 29753410 markings, 89257121 edges, 307330 markings/sec, 80 secs
lola: 31338840 markings, 94014171 edges, 317086 markings/sec, 85 secs
lola: 32914058 markings, 98740977 edges, 315044 markings/sec, 90 secs
lola: 34505186 markings, 103514600 edges, 318226 markings/sec, 95 secs
lola: 36097474 markings, 108291043 edges, 318458 markings/sec, 100 secs
lola: 37686403 markings, 113057720 edges, 317786 markings/sec, 105 secs
lola: 39543796 markings, 118738632 edges, 371479 markings/sec, 110 secs
lola: 41151521 markings, 123559850 edges, 321545 markings/sec, 115 secs
lola: 42640401 markings, 128026882 edges, 297776 markings/sec, 120 secs
lola: 44088335 markings, 132371397 edges, 289587 markings/sec, 125 secs
lola: 45535240 markings, 136713166 edges, 289381 markings/sec, 130 secs
lola: 46977469 markings, 141040330 edges, 288446 markings/sec, 135 secs
lola: 48408200 markings, 145334129 edges, 286146 markings/sec, 140 secs
lola: 49872964 markings, 149727576 edges, 292953 markings/sec, 145 secs
lola: 51436031 markings, 154417189 edges, 312613 markings/sec, 150 secs
lola: 52891965 markings, 158785727 edges, 291187 markings/sec, 155 secs
lola: 54348304 markings, 163153746 edges, 291268 markings/sec, 160 secs
lola: 55806550 markings, 167528838 edges, 291649 markings/sec, 165 secs
lola: 57437647 markings, 172845251 edges, 326219 markings/sec, 170 secs
lola: 58809796 markings, 177875959 edges, 274430 markings/sec, 175 secs
lola: 59986141 markings, 182189160 edges, 235269 markings/sec, 180 secs
lola: 61121668 markings, 186353515 edges, 227105 markings/sec, 185 secs
lola: 62234895 markings, 190435047 edges, 222645 markings/sec, 190 secs
lola: 63344608 markings, 194504687 edges, 221943 markings/sec, 195 secs
lola: 64325578 markings, 198101574 edges, 196194 markings/sec, 200 secs
lola: 65392997 markings, 202014938 edges, 213484 markings/sec, 205 secs
lola: 66570907 markings, 206334551 edges, 235582 markings/sec, 210 secs
lola: 67766810 markings, 210719382 edges, 239181 markings/sec, 215 secs
lola: 68992076 markings, 215212065 edges, 245053 markings/sec, 220 secs
lola: 70239963 markings, 219787818 edges, 249577 markings/sec, 225 secs
lola: 71484356 markings, 224351185 edges, 248879 markings/sec, 230 secs
lola: 72708092 markings, 228838453 edges, 244747 markings/sec, 235 secs
lola: 73913948 markings, 233259643 edges, 241171 markings/sec, 240 secs
lola: 75135854 markings, 237740179 edges, 244381 markings/sec, 245 secs
lola: 76645083 markings, 242658470 edges, 301846 markings/sec, 250 secs
lola: 78371352 markings, 247836714 edges, 345254 markings/sec, 255 secs
lola: 79947136 markings, 252564978 edges, 315157 markings/sec, 260 secs
lola: 81505198 markings, 257238225 edges, 311612 markings/sec, 265 secs
lola: 83049412 markings, 261872569 edges, 308843 markings/sec, 270 secs
lola: 84570131 markings, 266432705 edges, 304144 markings/sec, 275 secs
lola: 86105100 markings, 271037705 edges, 306994 markings/sec, 280 secs
lola: 87695920 markings, 275810486 edges, 318164 markings/sec, 285 secs
lola: 89245611 markings, 280461200 edges, 309938 markings/sec, 290 secs
lola: 90741737 markings, 284949896 edges, 299225 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= CPUUnit) AND (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 (((3 <= CPUUnit) AND (1 <= DiskControllerUnit))))
lola: processed formula length: 54
lola: 51 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2049 markings, 2048 edges
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 <= 2) OR (DiskControllerUnit <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= TransferToDisk) AND (CPUUnit <= TransferToDisk) AND (TaskSuspended + 1 <= TaskReady))))
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 (((1 <= TransferToDisk) AND (CPUUnit <= TransferToDisk) AND (TaskSuspended + 1 <= TaskReady))))
lola: processed formula length: 100
lola: 50 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: ((1 <= TransferToDisk) AND (CPUUnit <= TransferToDisk) AND (TaskSuspended + 1 <= TaskReady))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
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: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((ExecutingTask <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (ExecutingTask <= CPUUnit)
lola: processed formula length: 26
lola: 52 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: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 started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (CPUUnit + 1 <= ExecutingTask)
lola: state equation task get result unparse finished id 0
lola: formula 1: (ExecutingTask <= CPUUnit)
lola: state equation task get result unparse finished id 1
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-11-0.sara
lola: state equation: write sara problem file to CTLCardinality-11-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLCardinality-11-1.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 || 4361308 markings, 7266995 edges, 872262 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 8447213 markings, 14075045 edges, 817181 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 12381843 markings, 20632417 edges, 786926 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 16138752 markings, 26893391 edges, 751382 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 19893252 markings, 33486181 edges, 750900 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 23253988 markings, 40207742 edges, 672147 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 26316918 markings, 46334049 edges, 612586 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 29342446 markings, 52384970 edges, 605106 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 32307936 markings, 58317514 edges, 593098 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 35151941 markings, 64006042 edges, 568801 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 37947212 markings, 69640889 edges, 559054 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 41240630 markings, 76226266 edges, 658684 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 44142438 markings, 82029547 edges, 580362 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 47033969 markings, 87814743 edges, 578306 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 49903914 markings, 93553614 edges, 573989 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 52764189 markings, 99275001 edges, 572055 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 55624656 markings, 104995752 edges, 572093 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 58690243 markings, 111758905 edges, 613117 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 61447063 markings, 118191247 edges, 551364 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 64086351 markings, 124350173 edges, 527858 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 66559224 markings, 130121718 edges, 494575 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 68902555 markings, 135589584 edges, 468666 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 71177596 markings, 140898839 edges, 455008 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 73339954 markings, 145944550 edges, 432472 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 75198343 markings, 150281243 edges, 371678 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 78390604 markings, 156845222 edges, 638452 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 81342715 markings, 162751122 edges, 590422 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 84156316 markings, 168379436 edges, 562720 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 86942455 markings, 173952202 edges, 557228 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 89739348 markings, 179547461 edges, 559379 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 92532376 markings, 185132680 edges, 558606 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 95559486 markings, 191375067 edges, 605422 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 98709250 markings, 197673965 edges, 629953 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 101582839 markings, 203422474 edges, 574718 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 104278086 markings, 208814526 edges, 539049 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 106912235 markings, 214083170 edges, 526830 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 109511328 markings, 219280783 edges, 519819 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 112118096 markings, 224495978 edges, 521354 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 114957171 markings, 230436062 edges, 567815 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 117891014 markings, 236304181 edges, 586769 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 120729423 markings, 241978818 edges, 567682 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 123502250 markings, 247525398 edges, 554565 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 126338771 markings, 253198055 edges, 567304 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 129129649 markings, 258782898 edges, 558176 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 131858829 markings, 264240568 edges, 545836 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 134927871 markings, 270381430 edges, 613808 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 138032555 markings, 276592614 edges, 620937 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 141051340 markings, 282632887 edges, 603757 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 144020575 markings, 288572606 edges, 593847 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 146982953 markings, 294497688 edges, 592476 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 149918874 markings, 300371816 edges, 587184 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((TaskReady + 1 <= FreeMemSegment))) AND A (G ((TaskReady <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskReady <= 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 ((TaskReady <= FreeMemSegment)))
lola: processed formula length: 37
lola: 51 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 <= TaskReady)
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-12-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: 4098 markings, 4097 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((ExecutingTask <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (DiskControllerUnit + 1 <= ExecutingTask)
lola: processed formula length: 41
lola: 53 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
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 unparse finished++ id 0
lola: formula 0: (ExecutingTask <= DiskControllerUnit)
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 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 1
lola: formula 1: (DiskControllerUnit + 1 <= ExecutingTask)
lola: state equation task get result unparse finished id 1
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: write sara problem file to CTLCardinality-13-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-1.sara.
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 5035281 markings, 8389656 edges, 1007056 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 9999989 markings, 16662541 edges, 992942 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 14840911 markings, 24731598 edges, 968184 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 19508695 markings, 32714817 edges, 933557 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 23449474 markings, 40598690 edges, 788156 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 26991941 markings, 47684427 edges, 708493 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 30460004 markings, 54621421 edges, 693613 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 33888798 markings, 61479529 edges, 685759 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 37015883 markings, 67733653 edges, 625417 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 37767170 markings, 69235710 edges
lola: ========================================
lola: subprocess 14 will run for 1472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= TransferToDisk) OR (E (F ((TaskOnDisk <= LoadingMem))) OR DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 49 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 15 will run for 2945 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= TransferToDisk)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= TransferToDisk)
lola: processed formula length: 21
lola: 49 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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 2945 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F (((CPUUnit <= ExecutingTask) AND (LoadingMem <= TaskReady)))) OR E (F (((3 <= TransferToDisk) AND (FreeMemSegment <= TaskSuspended))))) AND ((((CPUUnit <= DiskControllerUnit)) OR (1 <= FreeMemSegment) OR ((ExecutingTask + 1 <= DiskControllerUnit) AND (FreeMemSegment + 1 <= DiskControllerUnit))) AND A (((ExecutingTask <= TaskReady) U (TransferToDisk <= TaskSuspended)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2945 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((CPUUnit <= DiskControllerUnit)) OR (1 <= FreeMemSegment) OR ((ExecutingTask + 1 <= DiskControllerUnit) AND (FreeMemSegment + 1 <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((CPUUnit <= DiskControllerUnit)) OR (1 <= FreeMemSegment) OR ((ExecutingTask + 1 <= DiskControllerUnit) AND (FreeMemSegment + 1 <= DiskControllerUnit)))
lola: processed formula length: 156
lola: 49 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 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: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= TransferToDisk) AND (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 (((3 <= TransferToDisk) AND (FreeMemSegment <= TaskSuspended))))
lola: processed formula length: 69
lola: 50 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: ((3 <= TransferToDisk) AND (FreeMemSegment <= TaskSuspended))
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-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33461 markings, 47797 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((ExecutingTask <= TaskSuspended))) AND E (X ((CPUUnit <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EF((ExecutingTask <= TaskSuspended)) AND EX((CPUUnit <= ExecutingTask))))
lola: processed formula length: 77
lola: 52 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: 1951857 markings, 5843920 edges, 390371 markings/sec, 0 secs
lola: 3944541 markings, 11829190 edges, 398537 markings/sec, 5 secs
lola: 5716755 markings, 17138915 edges, 354443 markings/sec, 10 secs
lola: 7469300 markings, 22397986 edges, 350509 markings/sec, 15 secs
lola: 9155487 markings, 27461536 edges, 337237 markings/sec, 20 secs
lola: 10916394 markings, 32744071 edges, 352181 markings/sec, 25 secs
lola: 12795405 markings, 38379402 edges, 375802 markings/sec, 30 secs
lola: 14657009 markings, 43965479 edges, 372321 markings/sec, 35 secs
lola: 16522002 markings, 49560215 edges, 372999 markings/sec, 40 secs
lola: 18373747 markings, 55112575 edges, 370349 markings/sec, 45 secs
lola: 20254942 markings, 60759376 edges, 376239 markings/sec, 50 secs
lola: 21918111 markings, 65752300 edges, 332634 markings/sec, 55 secs
lola: 23488904 markings, 70463545 edges, 314159 markings/sec, 60 secs
lola: 25043669 markings, 75126302 edges, 310953 markings/sec, 65 secs
lola: 26522226 markings, 79563255 edges, 295711 markings/sec, 70 secs
lola: 27969796 markings, 83906836 edges, 289514 markings/sec, 75 secs
lola: 29374915 markings, 88123551 edges, 281024 markings/sec, 80 secs
lola: 30782256 markings, 92344271 edges, 281468 markings/sec, 85 secs
lola: 32229531 markings, 96685455 edges, 289455 markings/sec, 90 secs
lola: 33637684 markings, 100911758 edges, 281631 markings/sec, 95 secs
lola: 35100085 markings, 105298688 edges, 292480 markings/sec, 100 secs
lola: 36607464 markings, 109821048 edges, 301476 markings/sec, 105 secs
lola: 38267889 markings, 114911314 edges, 332085 markings/sec, 110 secs
lola: 40098047 markings, 120400858 edges, 366032 markings/sec, 115 secs
lola: 41794479 markings, 125491355 edges, 339286 markings/sec, 120 secs
lola: 43433226 markings, 130406938 edges, 327749 markings/sec, 125 secs
lola: 45013447 markings, 135147551 edges, 316044 markings/sec, 130 secs
lola: 46594505 markings, 139890081 edges, 316212 markings/sec, 135 secs
lola: 48172522 markings, 144627076 edges, 315603 markings/sec, 140 secs
lola: 49761181 markings, 149391412 edges, 317732 markings/sec, 145 secs
lola: 51351194 markings, 154163335 edges, 318003 markings/sec, 150 secs
lola: 52899752 markings, 158809070 edges, 309712 markings/sec, 155 secs
lola: 54461334 markings, 163493723 edges, 312316 markings/sec, 160 secs
lola: 56033893 markings, 168210523 edges, 314512 markings/sec, 165 secs
lola: 57661223 markings, 173664938 edges, 325466 markings/sec, 170 secs
lola: 58978070 markings, 178493652 edges, 263369 markings/sec, 175 secs
lola: 60152576 markings, 182800352 edges, 234901 markings/sec, 180 secs
lola: 61267197 markings, 186887260 edges, 222924 markings/sec, 185 secs
lola: 62383048 markings, 190978554 edges, 223170 markings/sec, 190 secs
lola: 63451270 markings, 194895608 edges, 213644 markings/sec, 195 secs
lola: 64507809 markings, 198770117 edges, 211308 markings/sec, 200 secs
lola: 65568682 markings, 202659691 edges, 212175 markings/sec, 205 secs
lola: 66676839 markings, 206723099 edges, 221631 markings/sec, 210 secs
lola: 67865112 markings, 211079815 edges, 237655 markings/sec, 215 secs
lola: 68994258 markings, 215220019 edges, 225829 markings/sec, 220 secs
lola: 70211759 markings, 219684903 edges, 243500 markings/sec, 225 secs
lola: 71307369 markings, 223701636 edges, 219122 markings/sec, 230 secs
lola: 72475520 markings, 227985665 edges, 233630 markings/sec, 235 secs
lola: 73657168 markings, 232317871 edges, 236330 markings/sec, 240 secs
lola: 74935553 markings, 237005768 edges, 255677 markings/sec, 245 secs
lola: 76402659 markings, 241930791 edges, 293421 markings/sec, 250 secs
lola: 78007185 markings, 246742846 edges, 320905 markings/sec, 255 secs
lola: 79526733 markings, 251301769 edges, 303910 markings/sec, 260 secs
lola: 80979429 markings, 255661576 edges, 290539 markings/sec, 265 secs
lola: 82441658 markings, 260047651 edges, 292446 markings/sec, 270 secs
lola: 83985783 markings, 264680828 edges, 308825 markings/sec, 275 secs
lola: 85512328 markings, 269262073 edges, 305309 markings/sec, 280 secs
lola: 87036268 markings, 273834069 edges, 304788 markings/sec, 285 secs
lola: 88421815 markings, 277989689 edges, 277109 markings/sec, 290 secs
lola: 89778728 markings, 282060904 edges, 271383 markings/sec, 295 secs
lola: 90685829 markings, 284780927 edges, 181420 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((ExecutingTask <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (ExecutingTask <= CPUUnit)
lola: processed formula length: 26
lola: 52 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: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 + 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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (ExecutingTask <= CPUUnit)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
sara: try reading problem file CTLCardinality-17-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-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 || 4428492 markings, 7378843 edges, 885698 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 8641919 markings, 14400830 edges, 842685 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 12760649 markings, 21264832 edges, 823746 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 16721508 markings, 27865666 edges, 792172 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 20627836 markings, 34954899 edges, 781266 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 23973522 markings, 41646671 edges, 669137 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 26999532 markings, 47698347 edges, 605202 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 30014387 markings, 53730474 edges, 602971 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 32972766 markings, 59647785 edges, 591676 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 35977825 markings, 65656836 edges, 601012 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 39342253 markings, 72430120 edges, 672886 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 42544444 markings, 78834386 edges, 640438 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 45496860 markings, 84740415 edges, 590483 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 48427226 markings, 90601627 edges, 586073 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 51334591 markings, 96416930 edges, 581473 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 54118682 markings, 101984432 edges, 556818 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 57043764 markings, 107916980 edges, 585016 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 59651792 markings, 114003102 edges, 521606 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 61636822 markings, 118634314 edges, 397006 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 63561174 markings, 123125476 edges, 384870 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 65843116 markings, 128449632 edges, 456388 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 68211935 markings, 133977993 edges, 473764 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 70698585 markings, 139781167 edges, 497330 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 73196768 markings, 145610631 edges, 499637 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 75716897 markings, 151501434 edges, 504026 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 79110372 markings, 158287723 edges, 678695 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 82160113 markings, 164387884 edges, 609948 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 85129883 markings, 170325332 edges, 593954 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 88070828 markings, 176209571 edges, 588189 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 90964023 markings, 181995225 edges, 578639 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 93826674 markings, 187721124 edges, 572530 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 97267388 markings, 194790103 edges, 688143 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 100365140 markings, 200987480 edges, 619550 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 103276565 markings, 206811331 edges, 582285 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 106190532 markings, 212640302 edges, 582793 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 109048206 markings, 218355534 edges, 571535 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 111931978 markings, 224121819 edges, 576754 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 115061399 markings, 230642004 edges, 625884 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 118194529 markings, 236909541 edges, 626626 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 120914473 markings, 242351293 edges, 543989 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 123549869 markings, 247619919 edges, 527079 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 126161268 markings, 252843692 edges, 522280 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 128913102 markings, 258348952 edges, 550367 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 131721371 markings, 263965258 edges, 561654 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 134857544 markings, 270241186 edges, 627235 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 138131849 markings, 276791243 edges, 654861 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 141285416 markings, 283101351 edges, 630713 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 144358886 markings, 289247924 edges, 614694 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 147375820 markings, 295283452 edges, 603387 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 150379173 markings, 301292989 edges, 600671 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((2 <= TransferToDisk) OR (E (F ((TaskOnDisk <= LoadingMem))) OR DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 49 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: ========================================
lola: ...considering subproblem: (2 <= TransferToDisk)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= TransferToDisk)
lola: processed formula length: 21
lola: 49 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((TaskOnDisk <= LoadingMem)))
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 ((TaskOnDisk <= LoadingMem)))
lola: processed formula length: 34
lola: 50 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2049 markings, 2048 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((E (F (((CPUUnit <= ExecutingTask) AND (LoadingMem <= TaskReady)))) OR E (F (((3 <= TransferToDisk) AND (FreeMemSegment <= TaskSuspended))))) AND ((((CPUUnit <= DiskControllerUnit)) OR (1 <= FreeMemSegment) OR ((ExecutingTask + 1 <= DiskControllerUnit) AND (FreeMemSegment + 1 <= DiskControllerUnit))) AND A (((ExecutingTask <= TaskReady) U (TransferToDisk <= TaskSuspended)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((CPUUnit <= DiskControllerUnit)) OR (1 <= FreeMemSegment) OR ((ExecutingTask + 1 <= DiskControllerUnit) AND (FreeMemSegment + 1 <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((CPUUnit <= DiskControllerUnit)) OR (1 <= FreeMemSegment) OR ((ExecutingTask + 1 <= DiskControllerUnit) AND (FreeMemSegment + 1 <= DiskControllerUnit)))
lola: processed formula length: 156
lola: 49 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 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 (((ExecutingTask <= TaskReady) U (TransferToDisk <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((ExecutingTask <= TaskReady) U (TransferToDisk <= TaskSuspended)))
lola: processed formula length: 70
lola: 54 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: state equation task get result unparse finished++ id 0
lola: formula 0: (ExecutingTask <= TaskReady)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= TransferToDisk) AND (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 (((3 <= TransferToDisk) AND (FreeMemSegment <= TaskSuspended))))
lola: processed formula length: 69
lola: 50 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: ((3 <= TransferToDisk) AND (FreeMemSegment <= TaskSuspended))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-21-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: 33461 markings, 47797 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown yes no no yes no no no yes no yes no yes no unknown
lola:
preliminary result: no unknown yes no no yes no no no yes no yes no yes no unknown
lola: ========================================
lola: memory consumption: 22504 KB
lola: time consumption: 1185 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552953791872

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

tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT4096DC2048.tgz
mv SmallOperatingSystem-PT-MT4096DC2048 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 ;