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-155286430500074.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 SafeBus-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-csrt-155286430500074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 5.3K Feb 12 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 12 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 8 17:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 8 17:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.8K Feb 5 01:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 5 01:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 4 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 4 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 1 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 1 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 448K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1552936928610

info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ SafeBus-PT-06 @ 3570 seconds

FORMULA SafeBus-PT-06-UpperBounds-02 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-07 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-03 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-00 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-UpperBounds-01 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3253
rslt: Output for UpperBounds @ SafeBus-PT-06

{
"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=UpperBounds.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--timelimit=3570",
"--localtimelimit=0",
"--json=UpperBounds.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon Mar 18 19:22:08 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(ACK)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(R_tout)",
"processed_size": 11,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(cable_free)",
"processed_size": 15,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(FMCb)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(AMC_5_2)",
"processed_size": 12,
"rewrites": 0
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(wait_ack_5_3)",
"processed_size": 17,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(cable_used_3)",
"processed_size": 17,
"rewrites": 0
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(FMC_5)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(FMC_3)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(cable_used_1)",
"processed_size": 17,
"rewrites": 0
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(AMC_5_1)",
"processed_size": 12,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(wait_ack_3_2)",
"processed_size": 17,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6)",
"processed_size": 50,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)",
"processed_size": 50,
"rewrites": 0
},
"result":
{
"edges": 23172448,
"markings": 5781108,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1702
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)",
"processed_size": 50,
"rewrites": 0
},
"result":
{
"edges": 23172448,
"markings": 5781108,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3254
},
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "MAX(AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6)",
"processed_size": 362,
"rewrites": 0
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "search",
"value": 6
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 21984,
"runtime": 317.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 2968,
"conflict_clusters": 2,
"places": 144,
"places_significant": 109,
"singleton_clusters": 0,
"transitions": 451
},
"result":
{
"preliminary_value": "5 6 1 5 1 1 1 1 1 1 1 1 1 1 1 1 ",
"value": "5 6 1 5 1 1 1 1 1 1 1 1 1 1 1 1 "
},
"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: 595/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4608
lola: finding significant places
lola: 144 places, 451 transitions, 109 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 UpperBounds.xml
lola: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6) : MAX(AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6) : MAX(ACK) : MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6) : MAX(R_tout) : MAX(cable_free) : MAX(FMCb) : MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6) : MAX(AMC_5_2) : MAX(wait_ack_5_3) : MAX(cable_used_3) : MAX(FMC_5) : MAX(FMC_3) : MAX(cable_used_1) : MAX(AMC_5_1) : MAX(wait_ack_3_2)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ACK)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ACK)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(R_tout)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(R_tout)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(cable_free)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(cable_free)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FMCb)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FMCb)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AMC_5_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(AMC_5_2)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_ack_5_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_ack_5_3)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(cable_used_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(cable_used_3)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FMC_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FMC_5)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FMC_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FMC_3)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(cable_used_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(cable_used_1)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AMC_5_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(AMC_5_1)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_ack_3_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_ack_3_2)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 6
lola: 229223 markings, 476754 edges, 45845 markings/sec, 0 secs
lola: 445127 markings, 991564 edges, 43181 markings/sec, 5 secs
lola: 658272 markings, 1548073 edges, 42629 markings/sec, 10 secs
lola: 869946 markings, 2128157 edges, 42335 markings/sec, 15 secs
lola: 1076618 markings, 2713968 edges, 41334 markings/sec, 20 secs
lola: 1279006 markings, 3328388 edges, 40478 markings/sec, 25 secs
lola: 1475236 markings, 3948108 edges, 39246 markings/sec, 30 secs
lola: 1668136 markings, 4618601 edges, 38580 markings/sec, 35 secs
lola: 1856302 markings, 5322061 edges, 37633 markings/sec, 40 secs
lola: 2037935 markings, 6032357 edges, 36327 markings/sec, 45 secs
lola: 2212291 markings, 6768727 edges, 34871 markings/sec, 50 secs
lola: 2372166 markings, 7577373 edges, 31975 markings/sec, 55 secs
lola: 2427451 markings, 9070065 edges, 11057 markings/sec, 60 secs
lola: 2609024 markings, 9986382 edges, 36315 markings/sec, 65 secs
lola: 2822358 markings, 10531634 edges, 42667 markings/sec, 70 secs
lola: 3028237 markings, 11092068 edges, 41176 markings/sec, 75 secs
lola: 3231033 markings, 11673179 edges, 40559 markings/sec, 80 secs
lola: 3431724 markings, 12269332 edges, 40138 markings/sec, 85 secs
lola: 3623511 markings, 12848170 edges, 38357 markings/sec, 90 secs
lola: 3813466 markings, 13436549 edges, 37991 markings/sec, 95 secs
lola: 4000410 markings, 14035309 edges, 37389 markings/sec, 100 secs
lola: 4183459 markings, 14640849 edges, 36610 markings/sec, 105 secs
lola: 4376886 markings, 15294511 edges, 38685 markings/sec, 110 secs
lola: 4567109 markings, 15982173 edges, 38045 markings/sec, 115 secs
lola: 4745440 markings, 16661247 edges, 35666 markings/sec, 120 secs
lola: 4914607 markings, 17323148 edges, 33833 markings/sec, 125 secs
lola: 5086967 markings, 18011185 edges, 34472 markings/sec, 130 secs
lola: 5264309 markings, 18738824 edges, 35468 markings/sec, 135 secs
lola: 5433465 markings, 19499848 edges, 33831 markings/sec, 140 secs
lola: 5601333 markings, 20320745 edges, 33574 markings/sec, 145 secs
lola: 5744423 markings, 21261643 edges, 28618 markings/sec, 150 secs
lola: 5781066 markings, 23080933 edges, 7329 markings/sec, 155 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 5781108 markings, 23172448 edges
lola: ========================================
lola: subprocess 14 will run for 1702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 6
lola: 249338 markings, 523158 edges, 49868 markings/sec, 0 secs
lola: 485177 markings, 1092722 edges, 47168 markings/sec, 5 secs
lola: 703695 markings, 1672852 edges, 43704 markings/sec, 10 secs
lola: 912160 markings, 2247712 edges, 41693 markings/sec, 15 secs
lola: 1134502 markings, 2884995 edges, 44468 markings/sec, 20 secs
lola: 1340358 markings, 3520775 edges, 41171 markings/sec, 25 secs
lola: 1560521 markings, 4237775 edges, 44033 markings/sec, 30 secs
lola: 1771963 markings, 5001686 edges, 42288 markings/sec, 35 secs
lola: 1968537 markings, 5754908 edges, 39315 markings/sec, 40 secs
lola: 2147154 markings, 6480278 edges, 35723 markings/sec, 45 secs
lola: 2328707 markings, 7329710 edges, 36311 markings/sec, 50 secs
lola: 2426695 markings, 8808840 edges, 19598 markings/sec, 55 secs
lola: 2603178 markings, 9971843 edges, 35297 markings/sec, 60 secs
lola: 2837923 markings, 10573175 edges, 46949 markings/sec, 65 secs
lola: 3064545 markings, 11194157 edges, 45324 markings/sec, 70 secs
lola: 3272969 markings, 11795557 edges, 41685 markings/sec, 75 secs
lola: 3475178 markings, 12401226 edges, 40442 markings/sec, 80 secs
lola: 3668470 markings, 12983527 edges, 38658 markings/sec, 85 secs
lola: 3867923 markings, 13608640 edges, 39891 markings/sec, 90 secs
lola: 4074375 markings, 14278545 edges, 41290 markings/sec, 95 secs
lola: 4277368 markings, 14955400 edges, 40599 markings/sec, 100 secs
lola: 4478566 markings, 15655566 edges, 40240 markings/sec, 105 secs
lola: 4673820 markings, 16385716 edges, 39051 markings/sec, 110 secs
lola: 4868787 markings, 17138552 edges, 38993 markings/sec, 115 secs
lola: 5060126 markings, 17897194 edges, 38268 markings/sec, 120 secs
lola: 5243295 markings, 18657556 edges, 36634 markings/sec, 125 secs
lola: 5414831 markings, 19410983 edges, 34307 markings/sec, 130 secs
lola: 5579091 markings, 20207568 edges, 32852 markings/sec, 135 secs
lola: 5735408 markings, 21158501 edges, 31263 markings/sec, 140 secs
lola: 5780937 markings, 22952067 edges, 9106 markings/sec, 145 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 5781108 markings, 23172448 edges
lola: ========================================
lola: subprocess 15 will run for 3254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6)
lola: processed formula length: 362
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 7 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 5 6 1 5 1 1 1 1 1 1 1 1 1 1 1 1
lola:
preliminary result: 5 6 1 5 1 1 1 1 1 1 1 1 1 1 1 1
lola: memory consumption: 21984 KB
lola: time consumption: 317 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.json
rslt: finished

BK_STOP 1552937245090

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="SafeBus-PT-06"
export BK_EXAMINATION="UpperBounds"
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 SafeBus-PT-06, examination is UpperBounds"
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-155286430500074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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