fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r016-csrt-155225065700596
Last Updated
Apr 15, 2019

About the Execution of LoLA for BridgeAndVehicles-PT-V50P50N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4292.120 618075.00 650806.00 106.90 1 10 50 10 50 50 10 50 1 50 1 1 1 1 1 1 normal

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.r016-csrt-155225065700596.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 BridgeAndVehicles-PT-V50P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-csrt-155225065700596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 6.8K Feb 9 08:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 9 08:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Feb 5 05:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 5 05:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 117 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 355 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.0K Feb 4 22:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 121K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 2 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 2 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 145K Jan 29 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 421K Jan 29 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col

-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 BridgeAndVehicles-PT-V50P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1552528208600

info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ BridgeAndVehicles-PT-V50P50N10 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-01 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-02 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-03 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-04 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-05 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-06 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-07 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-09 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-00 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2952
rslt: Output for UpperBounds @ BridgeAndVehicles-PT-V50P50N10

{
"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": "Thu Mar 14 01:50: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(SUR_PONT_B)",
"processed_size": 15,
"rewrites": 0
},
"result":
{
"edges": 24637148,
"markings": 8363226,
"produced_by": "search",
"value": 10
},
"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": 224
},
"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(CAPACITE)",
"processed_size": 13,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 50
},
"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": 240
},
"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(SUR_PONT_B)",
"processed_size": 15,
"rewrites": 0
},
"result":
{
"edges": 24637148,
"markings": 8363226,
"produced_by": "search",
"value": 10
},
"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": 243
},
"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(ROUTE_B)",
"processed_size": 12,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 50
},
"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": 264
},
"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(ATTENTE_A)",
"processed_size": 14,
"rewrites": 0
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "search",
"value": 50
},
"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": 288
},
"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(SUR_PONT_A)",
"processed_size": 15,
"rewrites": 0
},
"result":
{
"edges": 27249581,
"markings": 9530649,
"produced_by": "search",
"value": 10
},
"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": 295
},
"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(ATTENTE_A)",
"processed_size": 14,
"rewrites": 0
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "search",
"value": 50
},
"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": 328
},
"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(NB_ATTENTE_B_39)",
"processed_size": 20,
"rewrites": 0
},
"result":
{
"edges": 39,
"markings": 40,
"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": 369
},
"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(CAPACITE)",
"processed_size": 13,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 50
},
"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": 421
},
"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(NB_ATTENTE_A_38)",
"processed_size": 20,
"rewrites": 0
},
"result":
{
"edges": 39,
"markings": 40,
"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": 492
},
"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(NB_ATTENTE_A_23)",
"processed_size": 20,
"rewrites": 0
},
"result":
{
"edges": 24,
"markings": 25,
"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": 590
},
"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(NB_ATTENTE_A_34)",
"processed_size": 20,
"rewrites": 0
},
"result":
{
"edges": 35,
"markings": 36,
"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": 738
},
"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(NB_ATTENTE_B_4)",
"processed_size": 19,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"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": 984
},
"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(NB_ATTENTE_B_47)",
"processed_size": 20,
"rewrites": 0
},
"result":
{
"edges": 47,
"markings": 48,
"produced_by": "search",
"value": 1
},
"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": 1476
},
"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(COMPTEUR_5)",
"processed_size": 15,
"rewrites": 0
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "search",
"value": 1
},
"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": 2952
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "MAX(VIDANGE_1 + VIDANGE_2)",
"processed_size": 26,
"rewrites": 0
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "search",
"value": 1
},
"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": 41248,
"runtime": 618.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": 10010,
"conflict_clusters": 5,
"places": 128,
"places_significant": 121,
"singleton_clusters": 0,
"transitions": 1328
},
"result":
{
"preliminary_value": "1 10 50 10 50 50 10 50 1 50 1 1 1 1 1 1 ",
"value": "1 10 50 10 50 50 10 50 1 50 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: 1456/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4096
lola: finding significant places
lola: 128 places, 1328 transitions, 121 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(VIDANGE_1 + VIDANGE_2) : MAX(SUR_PONT_B) : MAX(CAPACITE) : MAX(SUR_PONT_B) : MAX(ROUTE_B) : MAX(ATTENTE_A) : MAX(SUR_PONT_A) : MAX(ATTENTE_A) : MAX(NB_ATTENTE_B_39) : MAX(CAPACITE) : MAX(NB_ATTENTE_A_38) : MAX(NB_ATTENTE_A_23) : MAX(NB_ATTENTE_A_34) : MAX(NB_ATTENTE_B_4) : MAX(NB_ATTENTE_B_47) : MAX(COMPTEUR_5)
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(SUR_PONT_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SUR_PONT_B)
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: 50
lola: 197920 markings, 517552 edges, 39584 markings/sec, 0 secs
lola: 403807 markings, 1081914 edges, 41177 markings/sec, 5 secs
lola: 614427 markings, 1672937 edges, 42124 markings/sec, 10 secs
lola: 824147 markings, 2282234 edges, 41944 markings/sec, 15 secs
lola: 1031553 markings, 2880449 edges, 41481 markings/sec, 20 secs
lola: 1239833 markings, 3470540 edges, 41656 markings/sec, 25 secs
lola: 1447542 markings, 4063020 edges, 41542 markings/sec, 30 secs
lola: 1656162 markings, 4673342 edges, 41724 markings/sec, 35 secs
lola: 1862603 markings, 5277120 edges, 41288 markings/sec, 40 secs
lola: 2070668 markings, 5888146 edges, 41613 markings/sec, 45 secs
lola: 2275590 markings, 6506105 edges, 40984 markings/sec, 50 secs
lola: 2486163 markings, 7134365 edges, 42115 markings/sec, 55 secs
lola: 2701991 markings, 7760221 edges, 43166 markings/sec, 60 secs
lola: 2915816 markings, 8381212 edges, 42765 markings/sec, 65 secs
lola: 3127634 markings, 9002843 edges, 42364 markings/sec, 70 secs
lola: 3340228 markings, 9632330 edges, 42519 markings/sec, 75 secs
lola: 3554462 markings, 10264387 edges, 42847 markings/sec, 80 secs
lola: 3773693 markings, 10907742 edges, 43846 markings/sec, 85 secs
lola: 3992348 markings, 11549894 edges, 43731 markings/sec, 90 secs
lola: 4205322 markings, 12207992 edges, 42595 markings/sec, 95 secs
lola: 4418025 markings, 12824821 edges, 42541 markings/sec, 100 secs
lola: 4630983 markings, 13474348 edges, 42592 markings/sec, 105 secs
lola: 4841805 markings, 14093158 edges, 42164 markings/sec, 110 secs
lola: 5056310 markings, 14749107 edges, 42901 markings/sec, 115 secs
lola: 5268364 markings, 15365686 edges, 42411 markings/sec, 120 secs
lola: 5479162 markings, 16018782 edges, 42160 markings/sec, 125 secs
lola: 5692663 markings, 16640567 edges, 42700 markings/sec, 130 secs
lola: 5896701 markings, 17273729 edges, 40808 markings/sec, 135 secs
lola: 6109900 markings, 17895881 edges, 42640 markings/sec, 140 secs
lola: 6321752 markings, 18537779 edges, 42370 markings/sec, 145 secs
lola: 6538556 markings, 19162011 edges, 43361 markings/sec, 150 secs
lola: 6751172 markings, 19804082 edges, 42523 markings/sec, 155 secs
lola: 6964876 markings, 20453703 edges, 42741 markings/sec, 160 secs
lola: 7175667 markings, 21077130 edges, 42158 markings/sec, 165 secs
lola: 7387772 markings, 21714567 edges, 42421 markings/sec, 170 secs
lola: 7601587 markings, 22342935 edges, 42763 markings/sec, 175 secs
lola: 7808730 markings, 22960971 edges, 41429 markings/sec, 180 secs
lola: 8018886 markings, 23599607 edges, 42031 markings/sec, 185 secs
lola: 8234328 markings, 24277969 edges, 43088 markings/sec, 190 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 8363226 markings, 24637148 edges
lola: ========================================
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CAPACITE)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CAPACITE)
lola: processed formula length: 13
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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SUR_PONT_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SUR_PONT_B)
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: 50
lola: 214241 markings, 556752 edges, 42848 markings/sec, 0 secs
lola: 429701 markings, 1152820 edges, 43092 markings/sec, 5 secs
lola: 645838 markings, 1766535 edges, 43227 markings/sec, 10 secs
lola: 857677 markings, 2371010 edges, 42368 markings/sec, 15 secs
lola: 1074374 markings, 2996262 edges, 43339 markings/sec, 20 secs
lola: 1290425 markings, 3616833 edges, 43210 markings/sec, 25 secs
lola: 1505906 markings, 4231625 edges, 43096 markings/sec, 30 secs
lola: 1717505 markings, 4872687 edges, 42320 markings/sec, 35 secs
lola: 1936115 markings, 5499515 edges, 43722 markings/sec, 40 secs
lola: 2149724 markings, 6119071 edges, 42722 markings/sec, 45 secs
lola: 2356231 markings, 6735940 edges, 41301 markings/sec, 50 secs
lola: 2563726 markings, 7346645 edges, 41499 markings/sec, 55 secs
lola: 2773130 markings, 7972638 edges, 41881 markings/sec, 60 secs
lola: 2980723 markings, 8594042 edges, 41519 markings/sec, 65 secs
lola: 3191581 markings, 9209405 edges, 42172 markings/sec, 70 secs
lola: 3401480 markings, 9822735 edges, 41980 markings/sec, 75 secs
lola: 3611224 markings, 10437417 edges, 41949 markings/sec, 80 secs
lola: 3819441 markings, 11049610 edges, 41643 markings/sec, 85 secs
lola: 4027728 markings, 11665578 edges, 41657 markings/sec, 90 secs
lola: 4235514 markings, 12307367 edges, 41557 markings/sec, 95 secs
lola: 4448941 markings, 12917730 edges, 42685 markings/sec, 100 secs
lola: 4655812 markings, 13557819 edges, 41374 markings/sec, 105 secs
lola: 4866645 markings, 14164538 edges, 42167 markings/sec, 110 secs
lola: 5073420 markings, 14805888 edges, 41355 markings/sec, 115 secs
lola: 5283851 markings, 15414631 edges, 42086 markings/sec, 120 secs
lola: 5489873 markings, 16053438 edges, 41204 markings/sec, 125 secs
lola: 5700012 markings, 16664666 edges, 42028 markings/sec, 130 secs
lola: 5905012 markings, 17300173 edges, 41000 markings/sec, 135 secs
lola: 6114040 markings, 17908925 edges, 41806 markings/sec, 140 secs
lola: 6322917 markings, 18540085 edges, 41775 markings/sec, 145 secs
lola: 6540970 markings, 19169128 edges, 43611 markings/sec, 150 secs
lola: 6751305 markings, 19804408 edges, 42067 markings/sec, 155 secs
lola: 6965550 markings, 20455981 edges, 42849 markings/sec, 160 secs
lola: 7177764 markings, 21084087 edges, 42443 markings/sec, 165 secs
lola: 7391709 markings, 21724863 edges, 42789 markings/sec, 170 secs
lola: 7607374 markings, 22362962 edges, 43133 markings/sec, 175 secs
lola: 7814671 markings, 22980502 edges, 41459 markings/sec, 180 secs
lola: 8021864 markings, 23607162 edges, 41439 markings/sec, 185 secs
lola: 8230284 markings, 24263909 edges, 41684 markings/sec, 190 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 8363226 markings, 24637148 edges
lola: ========================================
lola: subprocess 3 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ROUTE_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ROUTE_B)
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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ATTENTE_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ATTENTE_A)
lola: processed formula length: 14
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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 5 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SUR_PONT_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SUR_PONT_A)
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: 50
lola: 219543 markings, 612018 edges, 43909 markings/sec, 0 secs
lola: 442707 markings, 1233138 edges, 44633 markings/sec, 5 secs
lola: 668102 markings, 1885370 edges, 45079 markings/sec, 10 secs
lola: 892673 markings, 2516646 edges, 44914 markings/sec, 15 secs
lola: 1115852 markings, 3144697 edges, 44636 markings/sec, 20 secs
lola: 1338229 markings, 3773887 edges, 44475 markings/sec, 25 secs
lola: 1561114 markings, 4408539 edges, 44577 markings/sec, 30 secs
lola: 1787389 markings, 5069179 edges, 45255 markings/sec, 35 secs
lola: 2012635 markings, 5689090 edges, 45049 markings/sec, 40 secs
lola: 2225696 markings, 6304313 edges, 42612 markings/sec, 45 secs
lola: 2450004 markings, 6954101 edges, 44862 markings/sec, 50 secs
lola: 2670142 markings, 7597243 edges, 44028 markings/sec, 55 secs
lola: 2893610 markings, 8221383 edges, 44694 markings/sec, 60 secs
lola: 3116836 markings, 8842415 edges, 44645 markings/sec, 65 secs
lola: 3331763 markings, 9462224 edges, 42985 markings/sec, 70 secs
lola: 3551288 markings, 10111325 edges, 43905 markings/sec, 75 secs
lola: 3772539 markings, 10734171 edges, 44250 markings/sec, 80 secs
lola: 3992348 markings, 11375001 edges, 43962 markings/sec, 85 secs
lola: 4215047 markings, 12013135 edges, 44540 markings/sec, 90 secs
lola: 4440329 markings, 12655191 edges, 45056 markings/sec, 95 secs
lola: 4670722 markings, 13304097 edges, 46079 markings/sec, 100 secs
lola: 4889135 markings, 13920935 edges, 43683 markings/sec, 105 secs
lola: 5114693 markings, 14555672 edges, 45112 markings/sec, 110 secs
lola: 5325928 markings, 15175574 edges, 42247 markings/sec, 115 secs
lola: 5557303 markings, 15805539 edges, 46275 markings/sec, 120 secs
lola: 5770932 markings, 16465537 edges, 42726 markings/sec, 125 secs
lola: 5992469 markings, 17050537 edges, 44307 markings/sec, 130 secs
lola: 6211377 markings, 17727162 edges, 43782 markings/sec, 135 secs
lola: 6430963 markings, 18330583 edges, 43917 markings/sec, 140 secs
lola: 6653529 markings, 19002976 edges, 44513 markings/sec, 145 secs
lola: 6872064 markings, 19611671 edges, 43707 markings/sec, 150 secs
lola: 7095757 markings, 20270277 edges, 44739 markings/sec, 155 secs
lola: 7313775 markings, 20878980 edges, 43604 markings/sec, 160 secs
lola: 7537694 markings, 21537353 edges, 44784 markings/sec, 165 secs
lola: 7755314 markings, 22131241 edges, 43524 markings/sec, 170 secs
lola: 7976744 markings, 22793213 edges, 44286 markings/sec, 175 secs
lola: 8198264 markings, 23379276 edges, 44304 markings/sec, 180 secs
lola: 8416362 markings, 24048396 edges, 43620 markings/sec, 185 secs
lola: 8642006 markings, 24655529 edges, 45129 markings/sec, 190 secs
lola: 8853174 markings, 25282618 edges, 42234 markings/sec, 195 secs
lola: 9080265 markings, 25931546 edges, 45418 markings/sec, 200 secs
lola: 9312171 markings, 26549359 edges, 46381 markings/sec, 205 secs
lola: 9523404 markings, 27230344 edges, 42247 markings/sec, 210 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 9530649 markings, 27249581 edges
lola: ========================================
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ATTENTE_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ATTENTE_A)
lola: processed formula length: 14
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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_B_39)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_B_39)
lola: processed formula length: 20
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: 40 markings, 39 edges
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CAPACITE)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CAPACITE)
lola: processed formula length: 13
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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_38)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_A_38)
lola: processed formula length: 20
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: 40 markings, 39 edges
lola: ========================================
lola: subprocess 10 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_23)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_A_23)
lola: processed formula length: 20
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: 25 markings, 24 edges
lola: ========================================
lola: subprocess 11 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_34)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_A_34)
lola: processed formula length: 20
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: 36 markings, 35 edges
lola: ========================================
lola: subprocess 12 will run for 738 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_B_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_B_4)
lola: processed formula length: 19
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 13 will run for 984 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_B_47)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_B_47)
lola: processed formula length: 20
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: 48 markings, 47 edges
lola: ========================================
lola: subprocess 14 will run for 1476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(COMPTEUR_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(COMPTEUR_5)
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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 15 will run for 2952 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(VIDANGE_1 + VIDANGE_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(VIDANGE_1 + VIDANGE_2)
lola: processed formula length: 26
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: 7 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 1 10 50 10 50 50 10 50 1 50 1 1 1 1 1 1
lola:
preliminary result: 1 10 50 10 50 50 10 50 1 50 1 1 1 1 1 1
lola: memory consumption: 41248 KB
lola: time consumption: 618 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.json
rslt: finished

BK_STOP 1552528826675

--------------------
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="BridgeAndVehicles-PT-V50P50N10"
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 BridgeAndVehicles-PT-V50P50N10, 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 r016-csrt-155225065700596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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