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

--------------------
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 21K Feb 12 18:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 9 02:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 3.1K Feb 5 01:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 4 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 1 21:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-MT8192DC2048-ReachabilityCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552953251061

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

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

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

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2875
rslt: Output for ReachabilityCardinality @ SmallOperatingSystem-PT-MT8192DC2048

{
"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": "Mon Mar 18 23:54:11 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 21
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 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 (((2 <= DiskControllerUnit))))",
"processed_size": 35,
"rewrites": 23
},
"result":
{
"edges": 2047,
"markings": 2048,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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 (((CPUUnit <= TransferToDisk))))",
"processed_size": 37,
"rewrites": 22
},
"result":
{
"edges": 83859467,
"markings": 48223238,
"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": 497
},
"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 <= CPUUnit)))",
"processed_size": 35,
"rewrites": 22
},
"result":
{
"edges": 6144,
"markings": 6145,
"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": 580
},
"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 + 1 <= TaskOnDisk) OR (TransferToDisk <= 2))))",
"processed_size": 65,
"rewrites": 23
},
"result":
{
"edges": 14474,
"markings": 14420,
"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": 696
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((TaskSuspended + 1 <= FreeMemSegment) AND (CPUUnit <= LoadingMem))))",
"processed_size": 75,
"rewrites": 22
},
"result":
{
"edges": 14333,
"markings": 12287,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 870
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "A (G (((1 <= ExecutingTask) OR ((ExecutingTask <= FreeMemSegment) AND ((LoadingMem <= TaskSuspended) OR (ExecutingTask <= TaskSuspended))))))",
"processed_size": 143,
"rewrites": 23
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1603
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((TaskSuspended <= FreeMemSegment) AND (DiskControllerUnit <= TaskReady)) OR ((ExecutingTask <= 2) AND (DiskControllerUnit <= 2)))))",
"processed_size": 140,
"rewrites": 22
},
"result":
{
"edges": 2046,
"markings": 2047,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3207
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((ExecutingTask + 1 <= LoadingMem) OR ((1 <= CPUUnit)) OR ((DiskControllerUnit <= TaskSuspended) AND (ExecutingTask <= CPUUnit) AND (FreeMemSegment <= 2)))))",
"processed_size": 165,
"rewrites": 23
},
"result":
{
"edges": 65008638,
"markings": 35656703,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 20364,
"runtime": 695.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : FALSE : FALSE : A(G(**)) : A(G(**)) : TRUE : A(G(**)) : E(F(**)) : E(F(**)) : FALSE : E(F(**)) : A(G(**)) : FALSE : E(F(**)) : A(G(**)) : TRUE"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no no no no unknown yes no yes yes no yes no no yes yes yes ",
"value": "no no no no unknown yes no yes yes no yes no no yes yes yes "
},
"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: (3 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: LP says that atomic proposition is always false: (TaskOnDisk <= TransferToDisk)
lola: LP says that atomic proposition is always false: (TaskOnDisk <= ExecutingTask)
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (ExecutingTask <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (FreeMemSegment <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: E (F (())) : E (F (())) : E (F ((TaskOnDisk <= TransferToDisk))) : A (G (((2 <= DiskControllerUnit)))) : A (G (((LoadingMem + 1 <= CPUUnit) OR (TransferToDisk + 1 <= CPUUnit) OR (ExecutingTask <= 2)))) : A (G (())) : A (G (((TaskReady + 1 <= TaskOnDisk) OR (TransferToDisk <= 2)))) : E (F ((FreeMemSegment <= CPUUnit))) : E (F ((((TaskSuspended <= FreeMemSegment) AND (DiskControllerUnit <= TaskReady)) OR ((ExecutingTask <= 2) AND (DiskControllerUnit <= 2))))) : E (F ((TaskOnDisk + 1 <= ExecutingTask))) : E (F (((TaskSuspended + 1 <= FreeMemSegment) AND (CPUUnit <= LoadingMem)))) : A (G (((ExecutingTask + 1 <= LoadingMem) OR ((1 <= CPUUnit)) OR ((DiskControllerUnit <= TaskSuspended) AND (ExecutingTask <= CPUUnit) AND (FreeMemSegment <= 2))))) : E (F (())) : E (F (((CPUUnit <= TransferToDisk)))) : A (G (((1 <= ExecutingTask) OR ((ExecutingTask <= FreeMemSegment) AND ((LoadingMem <= TaskSuspended) OR (ExecutingTask <= TaskSuspended)))))) : A (G ((3 <= TaskOnDisk)))
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:98
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: 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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 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: subprocess 1 will run for 237 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: 21 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: subprocess 2 will run for 254 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: 21 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: subprocess 3 will run for 274 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: 21 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 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: 21 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: subprocess 5 will run for 324 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: 21 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: subprocess 6 will run for 356 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: 21 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 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= 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 (((2 <= DiskControllerUnit))))
lola: processed formula length: 35
lola: 23 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 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-7-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: 2048 markings, 2047 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= 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 (((CPUUnit <= TransferToDisk))))
lola: processed formula length: 37
lola: 22 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: ((CPUUnit <= TransferToDisk))
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: sara is running 0 secs || 4630137 markings, 6945203 edges, 926027 markings/sec, 0 secs
lola: sara is running 5 secs || 8953615 markings, 13430420 edges, 864696 markings/sec, 5 secs
lola: sara is running 10 secs || 12815585 markings, 19224384 edges, 772394 markings/sec, 10 secs
lola: sara is running 15 secs || 15865792 markings, 23976299 edges, 610041 markings/sec, 15 secs
lola: sara is running 20 secs || 18633617 markings, 28510117 edges, 553565 markings/sec, 20 secs
lola: sara is running 25 secs || 21279253 markings, 33000456 edges, 529127 markings/sec, 25 secs
lola: sara is running 30 secs || 23868109 markings, 37523381 edges, 517771 markings/sec, 30 secs
lola: sara is running 35 secs || 26396055 markings, 42040227 edges, 505589 markings/sec, 35 secs
lola: sara is running 40 secs || 28891322 markings, 46587306 edges, 499053 markings/sec, 40 secs
lola: sara is running 45 secs || 31397760 markings, 51224279 edges, 501288 markings/sec, 45 secs
lola: sara is running 50 secs || 33880278 markings, 55892950 edges, 496504 markings/sec, 50 secs
lola: sara is running 55 secs || 36338162 markings, 60566641 edges, 491577 markings/sec, 55 secs
lola: sara is running 60 secs || 38777316 markings, 65260079 edges, 487831 markings/sec, 60 secs
lola: sara is running 65 secs || 41191234 markings, 69952701 edges, 482784 markings/sec, 65 secs
lola: sara is running 70 secs || 43722563 markings, 74926470 edges, 506266 markings/sec, 70 secs
lola: sara is running 75 secs || 46141227 markings, 79713319 edges, 483733 markings/sec, 75 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48223238 markings, 83859467 edges
lola: subprocess 9 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment <= CPUUnit)))
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 <= CPUUnit)))
lola: processed formula length: 35
lola: 22 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 <= CPUUnit)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6145 markings, 6144 edges
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 10 will run for 580 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((TaskReady + 1 <= TaskOnDisk) OR (TransferToDisk <= 2))))
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) OR (TransferToDisk <= 2))))
lola: processed formula length: 65
lola: 23 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) AND (3 <= 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-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file ReachabilityCardinality-9-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: 14420 markings, 14474 edges
lola: ========================================
lola: subprocess 11 will run for 696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskSuspended + 1 <= FreeMemSegment) AND (CPUUnit <= 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 (((TaskSuspended + 1 <= FreeMemSegment) AND (CPUUnit <= LoadingMem))))
lola: processed formula length: 75
lola: 22 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: ((TaskSuspended + 1 <= FreeMemSegment) AND (CPUUnit <= LoadingMem))
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
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12287 markings, 14333 edges
lola: ========================================
lola: subprocess 12 will run for 870 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= ExecutingTask) OR ((ExecutingTask <= FreeMemSegment) AND ((LoadingMem <= TaskSuspended) OR (ExecutingTask <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= ExecutingTask) OR ((ExecutingTask <= FreeMemSegment) AND ((LoadingMem <= TaskSuspended) OR (ExecutingTask <= TaskSuspended))))))
lola: processed formula length: 143
lola: 23 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: ((ExecutingTask <= 0) AND ((FreeMemSegment + 1 <= ExecutingTask) OR ((TaskSuspended + 1 <= LoadingMem) AND (TaskSuspended + 1 <= ExecutingTask))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 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: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 13 will run for 1160 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((LoadingMem + 1 <= CPUUnit) OR (TransferToDisk + 1 <= CPUUnit) OR (ExecutingTask <= 2))))
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 (((LoadingMem + 1 <= CPUUnit) OR (TransferToDisk + 1 <= CPUUnit) OR (ExecutingTask <= 2))))
lola: processed formula length: 98
lola: 23 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: ========================================
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 <= LoadingMem) AND (CPUUnit <= TransferToDisk) AND (3 <= ExecutingTask))
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 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: sara is running 0 secs || 5570380 markings, 8816378 edges, 1114076 markings/sec, 0 secs
lola: sara is running 5 secs || 10855546 markings, 17183427 edges, 1057033 markings/sec, 5 secs
lola: sara is running 10 secs || 15839193 markings, 25367351 edges, 996729 markings/sec, 10 secs
lola: sara is running 15 secs || 20178946 markings, 32711049 edges, 867951 markings/sec, 15 secs
lola: sara is running 20 secs || 24464463 markings, 39741180 edges, 857103 markings/sec, 20 secs
lola: sara is running 25 secs || 28587163 markings, 46301057 edges, 824540 markings/sec, 25 secs
lola: sara is running 30 secs || 33237573 markings, 53987036 edges, 930082 markings/sec, 30 secs
lola: sara is running 35 secs || 37926668 markings, 61126402 edges, 937819 markings/sec, 35 secs
lola: sara is running 40 secs || 43140149 markings, 68980890 edges, 1042696 markings/sec, 40 secs
lola: sara is running 45 secs || 48371821 markings, 76837057 edges, 1046334 markings/sec, 45 secs
lola: sara is running 50 secs || 53218712 markings, 84116602 edges, 969378 markings/sec, 50 secs
lola: sara is running 55 secs || 58007850 markings, 91311249 edges, 957828 markings/sec, 55 secs
lola: sara is running 60 secs || 62502024 markings, 98083330 edges, 898835 markings/sec, 60 secs
lola: sara is running 65 secs || 66913538 markings, 104701611 edges, 882303 markings/sec, 65 secs
lola: sara is running 70 secs || 68968574 markings, 111750967 edges, 411007 markings/sec, 70 secs
lola: sara is running 75 secs || 70159451 markings, 119500188 edges, 238175 markings/sec, 75 secs
lola: sara is running 80 secs || 74256034 markings, 126589269 edges, 819317 markings/sec, 80 secs
lola: sara is running 85 secs || 78479676 markings, 133233415 edges, 844728 markings/sec, 85 secs
lola: sara is running 90 secs || 82515519 markings, 139378774 edges, 807169 markings/sec, 90 secs
lola: sara is running 95 secs || 86372091 markings, 145194475 edges, 771314 markings/sec, 95 secs
lola: sara is running 100 secs || 90208781 markings, 150971839 edges, 767338 markings/sec, 100 secs
lola: sara is running 105 secs || 93928489 markings, 156571578 edges, 743942 markings/sec, 105 secs
lola: sara is running 110 secs || 97631027 markings, 162141362 edges, 740508 markings/sec, 110 secs
lola: sara is running 115 secs || 101354557 markings, 167744538 edges, 744706 markings/sec, 115 secs
lola: sara is running 120 secs || 105058289 markings, 173313704 edges, 740746 markings/sec, 120 secs
lola: sara is running 125 secs || 108706296 markings, 178799378 edges, 729601 markings/sec, 125 secs
lola: sara is running 130 secs || 112359323 markings, 184292669 edges, 730605 markings/sec, 130 secs
lola: sara is running 135 secs || 115971020 markings, 189719596 edges, 722339 markings/sec, 135 secs
lola: sara is running 140 secs || 119471576 markings, 194981526 edges, 700111 markings/sec, 140 secs
lola: sara is running 145 secs || 122989260 markings, 200272044 edges, 703537 markings/sec, 145 secs
lola: sara is running 150 secs || 126492573 markings, 205538286 edges, 700663 markings/sec, 150 secs
lola: sara is running 155 secs || 129979720 markings, 210778545 edges, 697429 markings/sec, 155 secs
lola: sara is running 160 secs || 133471580 markings, 216026038 edges, 698372 markings/sec, 160 secs
lola: sara is running 165 secs || 136961501 markings, 221269339 edges, 697984 markings/sec, 165 secs
lola: sara is running 170 secs || 140536077 markings, 226640869 edges, 714915 markings/sec, 170 secs
lola: sara is running 175 secs || 144113880 markings, 232017403 edges, 715561 markings/sec, 175 secs
lola: sara is running 180 secs || 147727530 markings, 237449253 edges, 722730 markings/sec, 180 secs
lola: sara is running 185 secs || 151356651 markings, 242904429 edges, 725824 markings/sec, 185 secs
lola: sara is running 190 secs || 154934060 markings, 248275868 edges, 715482 markings/sec, 190 secs
lola: sara is running 195 secs || 158496790 markings, 253631446 edges, 712546 markings/sec, 195 secs
lola: sara is running 200 secs || 162132201 markings, 259091479 edges, 727082 markings/sec, 200 secs
lola: sara is running 205 secs || 165702248 markings, 264456672 edges, 714009 markings/sec, 205 secs
lola: sara is running 210 secs || 169230682 markings, 269757810 edges, 705687 markings/sec, 210 secs
lola: sara is running 215 secs || 172707553 markings, 274983241 edges, 695374 markings/sec, 215 secs
lola: sara is running 220 secs || 176234211 markings, 280280260 edges, 705332 markings/sec, 220 secs
lola: sara is running 225 secs || 179730595 markings, 285531892 edges, 699277 markings/sec, 225 secs
lola: sara is running 230 secs || 183253754 markings, 290826976 edges, 704632 markings/sec, 230 secs
lola: sara is running 235 secs || 186752422 markings, 296083506 edges, 699734 markings/sec, 235 secs
lola: sara is running 240 secs || 190213269 markings, 301280485 edges, 692169 markings/sec, 240 secs
lola: sara is running 245 secs || 193717068 markings, 306544719 edges, 700760 markings/sec, 245 secs
lola: sara is running 250 secs || 197242882 markings, 311843834 edges, 705163 markings/sec, 250 secs
lola: sara is running 255 secs || 200720220 markings, 317067024 edges, 695468 markings/sec, 255 secs
lola: sara is running 260 secs || 201514414 markings, 318258122 edges, 158839 markings/sec, 260 secs
lola: sara is running 265 secs || 201978731 markings, 318957870 edges, 92863 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((TaskSuspended <= FreeMemSegment) AND (DiskControllerUnit <= TaskReady)) OR ((ExecutingTask <= 2) AND (DiskControllerUnit <= 2)))))
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 ((((TaskSuspended <= FreeMemSegment) AND (DiskControllerUnit <= TaskReady)) OR ((ExecutingTask <= 2) AND (DiskControllerUnit <= 2)))))
lola: processed formula length: 140
lola: 22 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: (((TaskSuspended <= FreeMemSegment) AND (DiskControllerUnit <= TaskReady)) OR ((ExecutingTask <= 2) AND (DiskControllerUnit <= 2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2047 markings, 2046 edges
lola: subprocess 15 will run for 3207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ExecutingTask + 1 <= LoadingMem) OR ((1 <= CPUUnit)) OR ((DiskControllerUnit <= TaskSuspended) AND (ExecutingTask <= CPUUnit) AND (FreeMemSegment <= 2)))))
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 + 1 <= LoadingMem) OR ((1 <= CPUUnit)) OR ((DiskControllerUnit <= TaskSuspended) AND (ExecutingTask <= CPUUnit) AND (FreeMemSegment <= 2)))))
lola: processed formula length: 165
lola: 23 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: ((LoadingMem <= ExecutingTask) AND ((CPUUnit <= 0)) AND ((TaskSuspended + 1 <= DiskControllerUnit) OR (CPUUnit + 1 <= ExecutingTask) OR (3 <= FreeMemSegment)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: ========================================
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: sara is running 0 secs || 5231613 markings, 8271425 edges, 1046323 markings/sec, 0 secs
lola: sara is running 5 secs || 9127324 markings, 14866670 edges, 779142 markings/sec, 5 secs
lola: sara is running 10 secs || 12452225 markings, 20716591 edges, 664980 markings/sec, 10 secs
lola: sara is running 15 secs || 15510189 markings, 26239438 edges, 611593 markings/sec, 15 secs
lola: sara is running 20 secs || 18424505 markings, 31616459 edges, 582863 markings/sec, 20 secs
lola: sara is running 25 secs || 21160686 markings, 36753232 edges, 547236 markings/sec, 25 secs
lola: sara is running 30 secs || 23827288 markings, 41821737 edges, 533320 markings/sec, 30 secs
lola: sara is running 35 secs || 26417807 markings, 46811335 edges, 518104 markings/sec, 35 secs
lola: sara is running 40 secs || 28957562 markings, 51752955 edges, 507951 markings/sec, 40 secs
lola: sara is running 45 secs || 31438394 markings, 56630983 edges, 496166 markings/sec, 45 secs
lola: sara is running 50 secs || 33865520 markings, 61438726 edges, 485425 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35656703 markings, 65008638 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((LoadingMem + 1 <= CPUUnit) OR (TransferToDisk + 1 <= CPUUnit) OR (ExecutingTask <= 2))))
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 (((LoadingMem + 1 <= CPUUnit) OR (TransferToDisk + 1 <= CPUUnit) OR (ExecutingTask <= 2))))
lola: processed formula length: 98
lola: 23 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 <= LoadingMem) AND (CPUUnit <= TransferToDisk) AND (3 <= ExecutingTask))
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 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 || 5249292 markings, 8306847 edges, 1049858 markings/sec, 0 secs
lola: sara is running 5 secs || 10643437 markings, 16847885 edges, 1078829 markings/sec, 5 secs
lola: sara is running 10 secs || 15663042 markings, 25097662 edges, 1003921 markings/sec, 10 secs
lola: sara is running 15 secs || 20120080 markings, 32610300 edges, 891408 markings/sec, 15 secs
lola: sara is running 20 secs || 24498119 markings, 39791847 edges, 875608 markings/sec, 20 secs
lola: sara is running 25 secs || 28835454 markings, 46674664 edges, 867467 markings/sec, 25 secs
lola: sara is running 30 secs || 33361093 markings, 54188754 edges, 905128 markings/sec, 30 secs
lola: sara is running 35 secs || 38304230 markings, 61693526 edges, 988627 markings/sec, 35 secs
lola: sara is running 40 secs || 43547083 markings, 69591940 edges, 1048571 markings/sec, 40 secs
lola: sara is running 45 secs || 48573693 markings, 77140231 edges, 1005322 markings/sec, 45 secs
lola: sara is running 50 secs || 53504755 markings, 84546258 edges, 986212 markings/sec, 50 secs
lola: sara is running 55 secs || 58254577 markings, 91681981 edges, 949964 markings/sec, 55 secs
lola: sara is running 60 secs || 62624751 markings, 98267400 edges, 874035 markings/sec, 60 secs
lola: sara is running 65 secs || 66959921 markings, 104771275 edges, 867034 markings/sec, 65 secs
lola: sara is running 70 secs || 68957071 markings, 111676184 edges, 399430 markings/sec, 70 secs
lola: sara is running 75 secs || 70131905 markings, 119307573 edges, 234967 markings/sec, 75 secs
lola: sara is running 80 secs || 74085650 markings, 126333121 edges, 790749 markings/sec, 80 secs
lola: sara is running 85 secs || 78363890 markings, 133059359 edges, 855648 markings/sec, 85 secs
lola: sara is running 90 secs || 82499615 markings, 139354918 edges, 827145 markings/sec, 90 secs
lola: sara is running 95 secs || 86518214 markings, 145416013 edges, 803720 markings/sec, 95 secs
lola: sara is running 100 secs || 90391245 markings, 151249969 edges, 774606 markings/sec, 100 secs
lola: sara is running 105 secs || 94208176 markings, 156991060 edges, 763386 markings/sec, 105 secs
lola: sara is running 110 secs || 97973578 markings, 162655128 edges, 753080 markings/sec, 110 secs
lola: sara is running 115 secs || 101708243 markings, 168275002 edges, 746933 markings/sec, 115 secs
lola: sara is running 120 secs || 105409780 markings, 173840874 edges, 740307 markings/sec, 120 secs
lola: sara is running 125 secs || 109111980 markings, 179407828 edges, 740440 markings/sec, 125 secs
lola: sara is running 130 secs || 112803579 markings, 184958967 edges, 738320 markings/sec, 130 secs
lola: sara is running 135 secs || 116414385 markings, 190389023 edges, 722161 markings/sec, 135 secs
lola: sara is running 140 secs || 119991597 markings, 195764303 edges, 715442 markings/sec, 140 secs
lola: sara is running 145 secs || 123550147 markings, 201113264 edges, 711710 markings/sec, 145 secs
lola: sara is running 150 secs || 127128272 markings, 206491709 edges, 715625 markings/sec, 150 secs
lola: sara is running 155 secs || 130793345 markings, 211998821 edges, 733015 markings/sec, 155 secs
lola: sara is running 160 secs || 134431300 markings, 217465425 edges, 727591 markings/sec, 160 secs
lola: sara is running 165 secs || 138085948 markings, 222958662 edges, 730930 markings/sec, 165 secs
lola: sara is running 170 secs || 141670331 markings, 228346640 edges, 716877 markings/sec, 170 secs
lola: sara is running 175 secs || 145316108 markings, 233825033 edges, 729155 markings/sec, 175 secs
lola: sara is running 180 secs || 148829338 markings, 239104796 edges, 702646 markings/sec, 180 secs
lola: sara is running 185 secs || 152347102 markings, 244389894 edges, 703553 markings/sec, 185 secs
lola: sara is running 190 secs || 155859297 markings, 249668086 edges, 702439 markings/sec, 190 secs
lola: sara is running 195 secs || 159459332 markings, 255075050 edges, 720007 markings/sec, 195 secs
lola: sara is running 200 secs || 162950084 markings, 260322797 edges, 698150 markings/sec, 200 secs
lola: sara is running 205 secs || 166449278 markings, 265577052 edges, 699839 markings/sec, 205 secs
lola: sara is running 210 secs || 169882474 markings, 270738453 edges, 686639 markings/sec, 210 secs
lola: sara is running 215 secs || 173343192 markings, 275936555 edges, 692144 markings/sec, 215 secs
lola: sara is running 220 secs || 176812251 markings, 281147189 edges, 693812 markings/sec, 220 secs
lola: sara is running 225 secs || 180266770 markings, 286340739 edges, 690904 markings/sec, 225 secs
lola: sara is running 230 secs || 183704209 markings, 291502553 edges, 687488 markings/sec, 230 secs
lola: sara is running 235 secs || 187133372 markings, 296654842 edges, 685833 markings/sec, 235 secs
lola: sara is running 240 secs || 190572554 markings, 301819327 edges, 687836 markings/sec, 240 secs
lola: sara is running 245 secs || 194003011 markings, 306976808 edges, 686091 markings/sec, 245 secs
lola: sara is running 250 secs || 197419676 markings, 312108982 edges, 683333 markings/sec, 250 secs
lola: sara is running 255 secs || 200814532 markings, 317208469 edges, 678971 markings/sec, 255 secs
lola: sara is running 260 secs || 201527837 markings, 318278253 edges, 142661 markings/sec, 260 secs
lola: sara is running 265 secs || 201969809 markings, 318944490 edges, 88394 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no unknown yes no yes yes no yes no no yes yes yes
lola:
preliminary result: no no no no unknown yes no yes yes no yes no no yes yes yes
lola: memory consumption: 20364 KB
lola: time consumption: 695 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552953946362

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

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