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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 4.4K Feb 12 18:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 12 18:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 9 02:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.9K Feb 5 01:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K 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.7K 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-MT8192DC4096-ReachabilityCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552953886250

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ SmallOperatingSystem-PT-MT8192DC4096 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2881
rslt: Output for ReachabilityCardinality @ SmallOperatingSystem-PT-MT8192DC4096

{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Mar 19 00:04:46 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": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 12
},
"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": 12
},
"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": 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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((DiskControllerUnit <= 0) AND (FreeMemSegment <= 1))))",
"processed_size": 61,
"rewrites": 13
},
"result":
{
"edges": 12286,
"markings": 12287,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"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 + 1 <= TaskOnDisk)))",
"processed_size": 37,
"rewrites": 14
},
"result":
{
"edges": 12288,
"markings": 12289,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((FreeMemSegment <= TaskReady)))",
"processed_size": 37,
"rewrites": 13
},
"result":
{
"edges": 8192,
"markings": 8193,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((FreeMemSegment + 1 <= DiskControllerUnit)))",
"processed_size": 50,
"rewrites": 13
},
"result":
{
"edges": 8194,
"markings": 8195,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 544
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((1 <= DiskControllerUnit) OR (FreeMemSegment <= TaskReady))))",
"processed_size": 69,
"rewrites": 14
},
"result":
{
"edges": 4096,
"markings": 4097,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((TaskReady <= 2) OR (TransferToDisk + 1 <= DiskControllerUnit))))",
"processed_size": 73,
"rewrites": 14
},
"result":
{
"edges": 4102,
"markings": 4103,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "A (G (((TransferToDisk <= FreeMemSegment) AND (3 <= FreeMemSegment) AND (ExecutingTask <= FreeMemSegment))))",
"processed_size": 108,
"rewrites": 14
},
"result":
{
"edges": 10242,
"markings": 10243,
"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": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1089
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "A (G (((ExecutingTask <= TransferToDisk) OR ((DiskControllerUnit <= FreeMemSegment) AND (LoadingMem <= FreeMemSegment)) OR (2 <= TransferToDisk))))",
"processed_size": 149,
"rewrites": 14
},
"result":
{
"edges": 8195,
"markings": 8196,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 5,
"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": 5,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= ExecutingTask) OR (ExecutingTask <= LoadingMem) OR (CPUUnit <= 0)) AND (((1 <= LoadingMem) AND (FreeMemSegment <= TransferToDisk))))))",
"processed_size": 150,
"rewrites": 13
},
"result":
{
"edges": 12288,
"markings": 12289,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3267
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "E (F (((DiskControllerUnit + 1 <= TaskSuspended) AND (TaskReady + 1 <= TransferToDisk) AND ((ExecutingTask <= TaskSuspended) OR ((1 <= DiskControllerUnit))))))",
"processed_size": 160,
"rewrites": 13
},
"result":
{
"edges": 28679,
"markings": 28680,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((3 <= CPUUnit)))",
"processed_size": 22,
"rewrites": 14
},
"result":
{
"edges": 335310896,
"markings": 192825361,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 16,
"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":
{
"error": null,
"memory": 23164,
"runtime": 689.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : TRUE : E(F(**)) : TRUE : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : TRUE : E(F(**)) : FALSE : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no yes yes yes no no yes no yes yes no yes yes yes no no ",
"value": "no yes yes yes no no yes no yes yes no yes yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (LoadingMem <= CPUUnit)
lola: LP says that atomic proposition is always true: (TaskReady <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskSuspended <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (LoadingMem <= CPUUnit)
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TransferToDisk <= CPUUnit)
lola: LP says that atomic proposition is always true: (TaskReady <= CPUUnit)
lola: LP says that atomic proposition is always true: (FreeMemSegment <= CPUUnit)
lola: A (G (((ExecutingTask <= TransferToDisk) OR ((DiskControllerUnit <= FreeMemSegment) AND (LoadingMem <= FreeMemSegment)) OR (2 <= TransferToDisk)))) : A (G (())) : E (F (((DiskControllerUnit <= 0) AND (FreeMemSegment <= 1)))) : A (G ((TaskSuspended <= TaskOnDisk))) : A (G (((TaskReady <= 2) OR (TransferToDisk + 1 <= DiskControllerUnit)))) : A (G ((TaskReady + 1 <= TaskOnDisk))) : E (F (((FreeMemSegment <= ExecutingTask)))) : A (G (((1 <= DiskControllerUnit) OR (FreeMemSegment <= TaskReady)))) : A (G (())) : E (F (((DiskControllerUnit + 1 <= TaskSuspended) AND (TaskReady + 1 <= TransferToDisk) AND ((ExecutingTask <= TaskSuspended) OR ((1 <= DiskControllerUnit)))))) : E (F ((CPUUnit + 1 <= TaskReady))) : E (F ((((1 <= ExecutingTask) OR (ExecutingTask <= LoadingMem) OR (CPUUnit <= 0)) AND (((1 <= LoadingMem) AND (FreeMemSegment <= TransferToDisk)))))) : E (F ((FreeMemSegment <= TaskReady))) : E (F ((FreeMemSegment + 1 <= DiskControllerUnit))) : A (G ((3 <= CPUUnit))) : A (G (((TransferToDisk <= FreeMemSegment) AND (3 <= FreeMemSegment) AND (ExecutingTask <= FreeMemSegment))))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: 12 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file ReachabilityCardinality.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 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: 12 rewrites
lola: closed formula file ReachabilityCardinality.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: 12 rewrites
lola: closed formula file ReachabilityCardinality.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: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= CPUUnit)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((3 <= CPUUnit)))
lola: processed formula length: 22
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CPUUnit <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4532088 markings, 6798131 edges, 906418 markings/sec, 0 secs
lola: sara is running 5 secs || 8801704 markings, 13202553 edges, 853923 markings/sec, 5 secs
lola: sara is running 10 secs || 12846408 markings, 19269609 edges, 808941 markings/sec, 10 secs
lola: sara is running 15 secs || 16573680 markings, 24860517 edges, 745454 markings/sec, 15 secs
lola: sara is running 20 secs || 19412292 markings, 29118437 edges, 567722 markings/sec, 20 secs
lola: sara is running 25 secs || 21950312 markings, 32925467 edges, 507604 markings/sec, 25 secs
lola: sara is running 30 secs || 24434607 markings, 36651909 edges, 496859 markings/sec, 30 secs
lola: sara is running 35 secs || 26875299 markings, 40312946 edges, 488138 markings/sec, 35 secs
lola: sara is running 40 secs || 29270811 markings, 43906214 edges, 479102 markings/sec, 40 secs
lola: sara is running 45 secs || 31641280 markings, 47461919 edges, 474094 markings/sec, 45 secs
lola: sara is running 50 secs || 34023556 markings, 51035333 edges, 476455 markings/sec, 50 secs
lola: sara is running 55 secs || 36402806 markings, 54604206 edges, 475850 markings/sec, 55 secs
lola: sara is running 60 secs || 38739205 markings, 58108804 edges, 467280 markings/sec, 60 secs
lola: sara is running 65 secs || 41062645 markings, 61593965 edges, 464688 markings/sec, 65 secs
lola: sara is running 70 secs || 43376794 markings, 65065189 edges, 462830 markings/sec, 70 secs
lola: sara is running 75 secs || 45685636 markings, 68528452 edges, 461768 markings/sec, 75 secs
lola: sara is running 80 secs || 47988159 markings, 71982236 edges, 460505 markings/sec, 80 secs
lola: sara is running 85 secs || 50274222 markings, 75411332 edges, 457213 markings/sec, 85 secs
lola: sara is running 90 secs || 52535603 markings, 78825255 edges, 452276 markings/sec, 90 secs
lola: sara is running 95 secs || 54786440 markings, 82266927 edges, 450167 markings/sec, 95 secs
lola: sara is running 100 secs || 57060319 markings, 85786858 edges, 454776 markings/sec, 100 secs
lola: sara is running 105 secs || 59322023 markings, 89325975 edges, 452341 markings/sec, 105 secs
lola: sara is running 110 secs || 61642352 markings, 92996259 edges, 464066 markings/sec, 110 secs
lola: sara is running 115 secs || 63917038 markings, 96633922 edges, 454937 markings/sec, 115 secs
lola: sara is running 120 secs || 66181623 markings, 100286126 edges, 452917 markings/sec, 120 secs
lola: sara is running 125 secs || 68456744 markings, 103991117 edges, 455024 markings/sec, 125 secs
lola: sara is running 130 secs || 70794379 markings, 107831106 edges, 467527 markings/sec, 130 secs
lola: sara is running 135 secs || 73144730 markings, 111723357 edges, 470070 markings/sec, 135 secs
lola: sara is running 140 secs || 75426130 markings, 115531008 edges, 456280 markings/sec, 140 secs
lola: sara is running 145 secs || 77701860 markings, 119358825 edges, 455146 markings/sec, 145 secs
lola: sara is running 150 secs || 79971346 markings, 123201175 edges, 453897 markings/sec, 150 secs
lola: sara is running 155 secs || 82238310 markings, 127065120 edges, 453393 markings/sec, 155 secs
lola: sara is running 160 secs || 84500522 markings, 130946080 edges, 452442 markings/sec, 160 secs
lola: sara is running 165 secs || 86751314 markings, 134832830 edges, 450158 markings/sec, 165 secs
lola: sara is running 170 secs || 89002061 markings, 138741228 edges, 450149 markings/sec, 170 secs
lola: sara is running 175 secs || 91289583 markings, 142733302 edges, 457504 markings/sec, 175 secs
lola: sara is running 180 secs || 93663135 markings, 146899708 edges, 474710 markings/sec, 180 secs
lola: sara is running 185 secs || 95930244 markings, 150901409 edges, 453422 markings/sec, 185 secs
lola: sara is running 190 secs || 98205022 markings, 154938375 edges, 454956 markings/sec, 190 secs
lola: sara is running 195 secs || 100533315 markings, 159088940 edges, 465659 markings/sec, 195 secs
lola: sara is running 200 secs || 102824562 markings, 163189873 edges, 458249 markings/sec, 200 secs
lola: sara is running 205 secs || 105064223 markings, 167224503 edges, 447932 markings/sec, 205 secs
lola: sara is running 210 secs || 107300625 markings, 171259655 edges, 447280 markings/sec, 210 secs
lola: sara is running 215 secs || 109529819 markings, 175307233 edges, 445839 markings/sec, 215 secs
lola: sara is running 220 secs || 111732029 markings, 179320391 edges, 440442 markings/sec, 220 secs
lola: sara is running 225 secs || 114087501 markings, 183633295 edges, 471094 markings/sec, 225 secs
lola: sara is running 230 secs || 116287111 markings, 187669812 edges, 439922 markings/sec, 230 secs
lola: sara is running 235 secs || 118514769 markings, 191770071 edges, 445532 markings/sec, 235 secs
lola: sara is running 240 secs || 120772302 markings, 195949036 edges, 451507 markings/sec, 240 secs
lola: sara is running 245 secs || 122996996 markings, 200074382 edges, 444939 markings/sec, 245 secs
lola: sara is running 250 secs || 125214951 markings, 204210892 edges, 443591 markings/sec, 250 secs
lola: sara is running 255 secs || 127426930 markings, 208339873 edges, 442396 markings/sec, 255 secs
lola: sara is running 260 secs || 129650114 markings, 212499492 edges, 444637 markings/sec, 260 secs
lola: sara is running 265 secs || 131862607 markings, 216658569 edges, 442499 markings/sec, 265 secs
lola: sara is running 270 secs || 134084264 markings, 220850537 edges, 444331 markings/sec, 270 secs
lola: sara is running 275 secs || 136296669 markings, 225032722 edges, 442481 markings/sec, 275 secs
lola: sara is running 280 secs || 138505566 markings, 229222023 edges, 441779 markings/sec, 280 secs
lola: sara is running 285 secs || 140748124 markings, 233483884 edges, 448512 markings/sec, 285 secs
lola: sara is running 290 secs || 143073449 markings, 237915641 edges, 465065 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown yes unknown unknown unknown unknown yes unknown no unknown unknown unknown unknown unknown
lola: memory consumption: 11399080 KB
lola: time consumption: 302 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((DiskControllerUnit <= 0) AND (FreeMemSegment <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((DiskControllerUnit <= 0) AND (FreeMemSegment <= 1))))
lola: processed formula length: 61
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((DiskControllerUnit <= 0) AND (FreeMemSegment <= 1))
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 ReachabilityCardinality-5-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: 12287 markings, 12286 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskReady + 1 <= TaskOnDisk)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((TaskReady + 1 <= TaskOnDisk)))
lola: processed formula length: 37
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.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: (TaskOnDisk <= 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 ReachabilityCardinality-6-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: 12289 markings, 12288 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment <= 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 ((FreeMemSegment <= TaskReady)))
lola: processed formula length: 37
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FreeMemSegment <= 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 ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-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: 8193 markings, 8192 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment + 1 <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FreeMemSegment + 1 <= DiskControllerUnit)))
lola: processed formula length: 50
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FreeMemSegment + 1 <= 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: write sara problem file to ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-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: 8195 markings, 8194 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FreeMemSegment <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FreeMemSegment <= ExecutingTask))))
lola: processed formula length: 43
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FreeMemSegment <= 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 ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-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: 14335 markings, 16381 edges
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= DiskControllerUnit) OR (FreeMemSegment <= TaskReady))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= DiskControllerUnit) OR (FreeMemSegment <= TaskReady))))
lola: processed formula length: 69
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((DiskControllerUnit <= 0) AND (TaskReady + 1 <= FreeMemSegment))
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 ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4097 markings, 4096 edges
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((TaskReady <= 2) OR (TransferToDisk + 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 (((TaskReady <= 2) OR (TransferToDisk + 1 <= DiskControllerUnit))))
lola: processed formula length: 73
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.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: ((3 <= TaskReady) AND (DiskControllerUnit <= TransferToDisk))
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 ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4103 markings, 4102 edges
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((TransferToDisk <= FreeMemSegment) AND (3 <= FreeMemSegment) AND (ExecutingTask <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((TransferToDisk <= FreeMemSegment) AND (3 <= FreeMemSegment) AND (ExecutingTask <= FreeMemSegment))))
lola: processed formula length: 108
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.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 <= TransferToDisk) OR (FreeMemSegment <= 2) OR (FreeMemSegment + 1 <= ExecutingTask))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10243 markings, 10242 edges
lola: ========================================
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ExecutingTask <= TransferToDisk) OR ((DiskControllerUnit <= FreeMemSegment) AND (LoadingMem <= FreeMemSegment)) OR (2 <= TransferToDisk))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((ExecutingTask <= TransferToDisk) OR ((DiskControllerUnit <= FreeMemSegment) AND (LoadingMem <= FreeMemSegment)) OR (2 <= TransferToDisk))))
lola: processed formula length: 149
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.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: ((TransferToDisk + 1 <= ExecutingTask) AND ((FreeMemSegment + 1 <= DiskControllerUnit) OR (FreeMemSegment + 1 <= LoadingMem)) AND (TransferToDisk <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8196 markings, 8195 edges
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= ExecutingTask) OR (ExecutingTask <= LoadingMem) OR (CPUUnit <= 0)) AND (((1 <= LoadingMem) AND (FreeMemSegment <= TransferToDisk))))))
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 <= ExecutingTask) OR (ExecutingTask <= LoadingMem) OR (CPUUnit <= 0)) AND (((1 <= LoadingMem) AND (FreeMemSegment <= TransferToDisk))))))
lola: processed formula length: 150
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.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 <= ExecutingTask) OR (ExecutingTask <= LoadingMem) OR (CPUUnit <= 0)) AND (((1 <= LoadingMem) AND (FreeMemSegment <= TransferToDisk))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-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: 12289 markings, 12288 edges
lola: ========================================
lola: subprocess 15 will run for 3267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((DiskControllerUnit + 1 <= TaskSuspended) AND (TaskReady + 1 <= TransferToDisk) AND ((ExecutingTask <= TaskSuspended) OR ((1 <= DiskControllerUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((DiskControllerUnit + 1 <= TaskSuspended) AND (TaskReady + 1 <= TransferToDisk) AND ((ExecutingTask <= TaskSuspended) OR ((1 <= DiskControllerUnit))))))
lola: processed formula length: 160
lola: 13 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((DiskControllerUnit + 1 <= TaskSuspended) AND (TaskReady + 1 <= TransferToDisk) AND ((ExecutingTask <= TaskSuspended) OR ((1 <= DiskControllerUnit))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-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: 28680 markings, 28679 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= CPUUnit)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((3 <= CPUUnit)))
lola: processed formula length: 22
lola: 14 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CPUUnit <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4655335 markings, 6983001 edges, 931067 markings/sec, 0 secs
lola: sara is running 5 secs || 9149535 markings, 13724299 edges, 898840 markings/sec, 5 secs
lola: sara is running 10 secs || 13522482 markings, 20283722 edges, 874589 markings/sec, 10 secs
lola: sara is running 15 secs || 17839943 markings, 26759913 edges, 863492 markings/sec, 15 secs
lola: sara is running 20 secs || 21872772 markings, 32809154 edges, 806566 markings/sec, 20 secs
lola: sara is running 25 secs || 25369667 markings, 38054498 edges, 699379 markings/sec, 25 secs
lola: sara is running 30 secs || 28288317 markings, 42432473 edges, 583730 markings/sec, 30 secs
lola: sara is running 35 secs || 31332610 markings, 46998913 edges, 608859 markings/sec, 35 secs
lola: sara is running 40 secs || 34058715 markings, 51088070 edges, 545221 markings/sec, 40 secs
lola: sara is running 45 secs || 36575624 markings, 54863435 edges, 503382 markings/sec, 45 secs
lola: sara is running 50 secs || 39312184 markings, 58968275 edges, 547312 markings/sec, 50 secs
lola: sara is running 55 secs || 41872120 markings, 62808179 edges, 511987 markings/sec, 55 secs
lola: sara is running 60 secs || 44279519 markings, 66419277 edges, 481480 markings/sec, 60 secs
lola: sara is running 65 secs || 46683803 markings, 70025702 edges, 480857 markings/sec, 65 secs
lola: sara is running 70 secs || 49097699 markings, 73646546 edges, 482779 markings/sec, 70 secs
lola: sara is running 75 secs || 51531202 markings, 77303444 edges, 486701 markings/sec, 75 secs
lola: sara is running 80 secs || 53929937 markings, 80952038 edges, 479747 markings/sec, 80 secs
lola: sara is running 85 secs || 56332944 markings, 84655368 edges, 480601 markings/sec, 85 secs
lola: sara is running 90 secs || 58756631 markings, 88438314 edges, 484737 markings/sec, 90 secs
lola: sara is running 95 secs || 61132302 markings, 92186183 edges, 475134 markings/sec, 95 secs
lola: sara is running 100 secs || 63503741 markings, 95969395 edges, 474288 markings/sec, 100 secs
lola: sara is running 105 secs || 65964599 markings, 99934053 edges, 492172 markings/sec, 105 secs
lola: sara is running 110 secs || 68364586 markings, 103841533 edges, 479997 markings/sec, 110 secs
lola: sara is running 115 secs || 70748378 markings, 107753620 edges, 476758 markings/sec, 115 secs
lola: sara is running 120 secs || 73143279 markings, 111721179 edges, 478980 markings/sec, 120 secs
lola: sara is running 125 secs || 75631052 markings, 115874588 edges, 497555 markings/sec, 125 secs
lola: sara is running 130 secs || 78004675 markings, 119868877 edges, 474725 markings/sec, 130 secs
lola: sara is running 135 secs || 80362769 markings, 123866432 edges, 471619 markings/sec, 135 secs
lola: sara is running 140 secs || 82711016 markings, 127875035 edges, 469649 markings/sec, 140 secs
lola: sara is running 145 secs || 85060006 markings, 131908476 edges, 469798 markings/sec, 145 secs
lola: sara is running 150 secs || 87403220 markings, 135962990 edges, 468643 markings/sec, 150 secs
lola: sara is running 155 secs || 89746845 markings, 140034446 edges, 468725 markings/sec, 155 secs
lola: sara is running 160 secs || 92079354 markings, 144119346 edges, 466502 markings/sec, 160 secs
lola: sara is running 165 secs || 94410795 markings, 148215708 edges, 466288 markings/sec, 165 secs
lola: sara is running 170 secs || 96839133 markings, 152512704 edges, 485668 markings/sec, 170 secs
lola: sara is running 175 secs || 99162052 markings, 156642822 edges, 464584 markings/sec, 175 secs
lola: sara is running 180 secs || 101488517 markings, 160799259 edges, 465293 markings/sec, 180 secs
lola: sara is running 185 secs || 103802654 markings, 164949445 edges, 462827 markings/sec, 185 secs
lola: sara is running 190 secs || 106155315 markings, 169193277 edges, 470532 markings/sec, 190 secs
lola: sara is running 195 secs || 108451616 markings, 173351378 edges, 459260 markings/sec, 195 secs
lola: sara is running 200 secs || 110735787 markings, 177504774 edges, 456834 markings/sec, 200 secs
lola: sara is running 205 secs || 113114121 markings, 181846506 edges, 475667 markings/sec, 205 secs
lola: sara is running 210 secs || 115546880 markings, 186307256 edges, 486552 markings/sec, 210 secs
lola: sara is running 215 secs || 117944139 markings, 190716290 edges, 479452 markings/sec, 215 secs
lola: sara is running 220 secs || 120364644 markings, 195196677 edges, 484101 markings/sec, 220 secs
lola: sara is running 225 secs || 122792954 markings, 199697687 edges, 485662 markings/sec, 225 secs
lola: sara is running 230 secs || 125235756 markings, 204241289 edges, 488560 markings/sec, 230 secs
lola: sara is running 235 secs || 127661873 markings, 208778577 edges, 485223 markings/sec, 235 secs
lola: sara is running 240 secs || 130041045 markings, 213241111 edges, 475834 markings/sec, 240 secs
lola: sara is running 245 secs || 132278610 markings, 217441364 edges, 447513 markings/sec, 245 secs
lola: sara is running 250 secs || 134510956 markings, 221652934 edges, 446469 markings/sec, 250 secs
lola: sara is running 255 secs || 136889261 markings, 226154494 edges, 475661 markings/sec, 255 secs
lola: sara is running 260 secs || 139212571 markings, 230566162 edges, 464662 markings/sec, 260 secs
lola: sara is running 265 secs || 141516683 markings, 234944441 edges, 460822 markings/sec, 265 secs
lola: sara is running 270 secs || 143863972 markings, 239422750 edges, 469458 markings/sec, 270 secs
lola: sara is running 275 secs || 146199449 markings, 243901030 edges, 467095 markings/sec, 275 secs
lola: sara is running 280 secs || 148535599 markings, 248377849 edges, 467230 markings/sec, 280 secs
lola: sara is running 285 secs || 150899493 markings, 252930936 edges, 472779 markings/sec, 285 secs
lola: sara is running 290 secs || 153251067 markings, 257461173 edges, 470315 markings/sec, 290 secs
lola: sara is running 295 secs || 155592441 markings, 261993101 edges, 468275 markings/sec, 295 secs
lola: sara is running 300 secs || 157871781 markings, 266407425 edges, 455868 markings/sec, 300 secs
lola: sara is running 305 secs || 160040008 markings, 270611958 edges, 433645 markings/sec, 305 secs
lola: sara is running 310 secs || 162127764 markings, 274686018 edges, 417551 markings/sec, 310 secs
lola: sara is running 315 secs || 164421829 markings, 279158807 edges, 458813 markings/sec, 315 secs
lola: sara is running 320 secs || 166727126 markings, 283665410 edges, 461059 markings/sec, 320 secs
lola: sara is running 325 secs || 168884884 markings, 287889306 edges, 431552 markings/sec, 325 secs
lola: sara is running 330 secs || 171062517 markings, 292157318 edges, 435527 markings/sec, 330 secs
lola: sara is running 335 secs || 173200476 markings, 296364174 edges, 427592 markings/sec, 335 secs
lola: sara is running 340 secs || 175394996 markings, 300692871 edges, 438904 markings/sec, 340 secs
lola: sara is running 345 secs || 177526477 markings, 304902553 edges, 426296 markings/sec, 345 secs
lola: sara is running 350 secs || 179646388 markings, 309099572 edges, 423982 markings/sec, 350 secs
lola: sara is running 355 secs || 181813826 markings, 313379693 edges, 433488 markings/sec, 355 secs
lola: sara is running 360 secs || 184012160 markings, 317741480 edges, 439667 markings/sec, 360 secs
lola: sara is running 365 secs || 186122883 markings, 321942219 edges, 422145 markings/sec, 365 secs
lola: sara is running 370 secs || 188216426 markings, 326107908 edges, 418709 markings/sec, 370 secs
lola: sara is running 375 secs || 190337704 markings, 330350224 edges, 424256 markings/sec, 375 secs
lola: sara is running 380 secs || 192456278 markings, 334577350 edges, 423715 markings/sec, 380 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 192825361 markings, 335310896 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no no yes no yes yes no yes yes yes no no
lola:
preliminary result: no yes yes yes no no yes no yes yes no yes yes yes no no
lola: memory consumption: 23164 KB
lola: time consumption: 689 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552954575272

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

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