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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.2M
-rw-r--r-- 1 mcc users 9.4K Feb 9 08:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 9 08:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 367K Feb 5 05:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.0M Feb 5 05:21 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 7.5K Feb 4 22:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 4 22:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 125K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 336K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 2 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 2 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 306K Jan 29 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 879K Jan 29 12:55 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 6.0M 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-V50P20N50-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1552527682738

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

FORMULA BridgeAndVehicles-PT-V50P20N50-UpperBounds-02 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P20N50-UpperBounds-03 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA BridgeAndVehicles-PT-V50P20N50-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA BridgeAndVehicles-PT-V50P20N50-UpperBounds-12 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA BridgeAndVehicles-PT-V50P20N50-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P20N50-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BridgeAndVehicles-PT-V50P20N50-UpperBounds-00 50 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3076
rslt: Output for UpperBounds @ BridgeAndVehicles-PT-V50P20N50

{
"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:41:22 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": 63,
"markings": 64,
"produced_by": "search",
"value": 20
},
"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": 238
},
"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_B)",
"processed_size": 14,
"rewrites": 0
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "search",
"value": 50
},
"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": 256
},
"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(SORTI_A)",
"processed_size": 12,
"rewrites": 0
},
"result":
{
"edges": 200,
"markings": 201,
"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": 278
},
"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_A)",
"processed_size": 12,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 303
},
"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_25)",
"processed_size": 16,
"rewrites": 0
},
"result":
{
"edges": 96,
"markings": 97,
"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": 333
},
"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_22)",
"processed_size": 16,
"rewrites": 0
},
"result":
{
"edges": 84,
"markings": 85,
"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": 370
},
"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_8)",
"processed_size": 15,
"rewrites": 0
},
"result":
{
"edges": 28,
"markings": 29,
"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": 417
},
"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_8)",
"processed_size": 19,
"rewrites": 0
},
"result":
{
"edges": 8,
"markings": 9,
"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": 476
},
"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": 20
},
"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": 556
},
"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_46)",
"processed_size": 16,
"rewrites": 0
},
"result":
{
"edges": 180,
"markings": 181,
"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": 667
},
"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_41)",
"processed_size": 16,
"rewrites": 0
},
"result":
{
"edges": 160,
"markings": 161,
"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": 834
},
"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_20)",
"processed_size": 20,
"rewrites": 0
},
"result":
{
"edges": 20,
"markings": 21,
"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": 1112
},
"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(CHOIX_1 + CHOIX_2)",
"processed_size": 22,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 1668
},
"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(CHOIX_1 + CHOIX_2)",
"processed_size": 22,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 3337
},
"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(CHOIX_1 + CHOIX_2)",
"processed_size": 22,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
},

{
"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": 6527569,
"markings": 1806266,
"produced_by": "search",
"value": 50
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 213284,
"runtime": 494.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": 42330,
"conflict_clusters": 5,
"places": 168,
"places_significant": 161,
"singleton_clusters": 0,
"transitions": 5408
},
"result":
{
"preliminary_value": "50 1 20 50 1 50 1 50 1 1 1 1 20 1 1 1 ",
"value": "50 1 20 50 1 50 1 50 1 1 1 1 20 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: 5576/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5376
lola: finding significant places
lola: 168 places, 5408 transitions, 161 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(ATTENTE_A) : MAX(CHOIX_1 + CHOIX_2) : MAX(SUR_PONT_B) : MAX(ATTENTE_B) : MAX(CHOIX_1 + CHOIX_2) : MAX(SORTI_A) : MAX(CHOIX_1 + CHOIX_2) : MAX(ROUTE_A) : MAX(COMPTEUR_25) : MAX(COMPTEUR_22) : MAX(COMPTEUR_8) : MAX(NB_ATTENTE_B_8) : MAX(CAPACITE) : MAX(COMPTEUR_46) : MAX(COMPTEUR_41) : MAX(NB_ATTENTE_B_20)
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(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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 24 markings, 23 edges, 5 markings/sec, 25 secs
lola: 72555 markings, 136894 edges, 14506 markings/sec, 30 secs
lola: 143854 markings, 274628 edges, 14260 markings/sec, 35 secs
lola: 192188 markings, 415064 edges, 9667 markings/sec, 40 secs
lola: 228694 markings, 555883 edges, 7301 markings/sec, 45 secs
lola: 265449 markings, 694630 edges, 7351 markings/sec, 50 secs
lola: 302736 markings, 838435 edges, 7457 markings/sec, 55 secs
lola: 338703 markings, 974326 edges, 7193 markings/sec, 60 secs
lola: 375559 markings, 1116413 edges, 7371 markings/sec, 65 secs
lola: 412691 markings, 1256684 edges, 7426 markings/sec, 70 secs
lola: 449780 markings, 1399699 edges, 7418 markings/sec, 75 secs
lola: 486549 markings, 1538612 edges, 7354 markings/sec, 80 secs
lola: 522912 markings, 1678922 edges, 7273 markings/sec, 85 secs
lola: 559148 markings, 1815638 edges, 7247 markings/sec, 90 secs
lola: 595504 markings, 1955996 edges, 7271 markings/sec, 95 secs
lola: 632589 markings, 2096096 edges, 7417 markings/sec, 100 secs
lola: 669975 markings, 2240304 edges, 7477 markings/sec, 105 secs
lola: 707126 markings, 2380668 edges, 7430 markings/sec, 110 secs
lola: 744094 markings, 2523560 edges, 7394 markings/sec, 115 secs
lola: 780430 markings, 2660601 edges, 7267 markings/sec, 120 secs
lola: 816002 markings, 2798136 edges, 7114 markings/sec, 125 secs
lola: 852549 markings, 2935812 edges, 7309 markings/sec, 130 secs
lola: 888550 markings, 3071611 edges, 7200 markings/sec, 135 secs
lola: 924685 markings, 3211212 edges, 7227 markings/sec, 140 secs
lola: 961107 markings, 3348583 edges, 7284 markings/sec, 145 secs
lola: 997794 markings, 3490453 edges, 7337 markings/sec, 150 secs
lola: 1035610 markings, 3633054 edges, 7563 markings/sec, 155 secs
lola: 1072201 markings, 3771398 edges, 7318 markings/sec, 160 secs
lola: 1108607 markings, 3911224 edges, 7281 markings/sec, 165 secs
lola: 1146309 markings, 4054463 edges, 7540 markings/sec, 170 secs
lola: 1183455 markings, 4194795 edges, 7429 markings/sec, 175 secs
lola: 1220526 markings, 4334900 edges, 7414 markings/sec, 180 secs
lola: 1256999 markings, 4475165 edges, 7295 markings/sec, 185 secs
lola: 1294585 markings, 4617915 edges, 7517 markings/sec, 190 secs
lola: 1331796 markings, 4758368 edges, 7442 markings/sec, 195 secs
lola: 1369092 markings, 4899328 edges, 7459 markings/sec, 200 secs
lola: 1406148 markings, 5039391 edges, 7411 markings/sec, 205 secs
lola: 1443366 markings, 5179955 edges, 7444 markings/sec, 210 secs
lola: 1480564 markings, 5320598 edges, 7440 markings/sec, 215 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 314268 KB
lola: time consumption: 228 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 64 markings, 63 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ATTENTE_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ATTENTE_B)
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 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SORTI_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SORTI_A)
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: 201 markings, 200 edges
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ROUTE_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ROUTE_A)
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 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(COMPTEUR_25)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(COMPTEUR_25)
lola: processed formula length: 16
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: 97 markings, 96 edges
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(COMPTEUR_22)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(COMPTEUR_22)
lola: processed formula length: 16
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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(COMPTEUR_8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(COMPTEUR_8)
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: 29 markings, 28 edges
lola: ========================================
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_B_8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_B_8)
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 476 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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(COMPTEUR_46)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(COMPTEUR_46)
lola: processed formula length: 16
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: 181 markings, 180 edges
lola: ========================================
lola: subprocess 11 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(COMPTEUR_41)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(COMPTEUR_41)
lola: processed formula length: 16
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: 161 markings, 160 edges
lola: ========================================
lola: subprocess 12 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_B_20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_B_20)
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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 13 will run for 1112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CHOIX_1 + CHOIX_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CHOIX_1 + CHOIX_2)
lola: processed formula length: 22
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 14 will run for 1668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CHOIX_1 + CHOIX_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CHOIX_1 + CHOIX_2)
lola: processed formula length: 22
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 15 will run for 3337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CHOIX_1 + CHOIX_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CHOIX_1 + CHOIX_2)
lola: processed formula length: 22
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: ========================================
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 73898 markings, 139298 edges, 14780 markings/sec, 30 secs
lola: 147754 markings, 282228 edges, 14771 markings/sec, 35 secs
lola: 194380 markings, 423428 edges, 9325 markings/sec, 40 secs
lola: 232990 markings, 572689 edges, 7722 markings/sec, 45 secs
lola: 271075 markings, 716312 edges, 7617 markings/sec, 50 secs
lola: 308548 markings, 860924 edges, 7495 markings/sec, 55 secs
lola: 345843 markings, 1001712 edges, 7459 markings/sec, 60 secs
lola: 383804 markings, 1148214 edges, 7592 markings/sec, 65 secs
lola: 422390 markings, 1294073 edges, 7717 markings/sec, 70 secs
lola: 460260 markings, 1440249 edges, 7574 markings/sec, 75 secs
lola: 498741 markings, 1585791 edges, 7696 markings/sec, 80 secs
lola: 536241 markings, 1730514 edges, 7500 markings/sec, 85 secs
lola: 573648 markings, 1871678 edges, 7481 markings/sec, 90 secs
lola: 610710 markings, 2015044 edges, 7412 markings/sec, 95 secs
lola: 648049 markings, 2155850 edges, 7468 markings/sec, 100 secs
lola: 684874 markings, 2298137 edges, 7365 markings/sec, 105 secs
lola: 722773 markings, 2441069 edges, 7580 markings/sec, 110 secs
lola: 760083 markings, 2581902 edges, 7462 markings/sec, 115 secs
lola: 798029 markings, 2728338 edges, 7589 markings/sec, 120 secs
lola: 835268 markings, 2869070 edges, 7448 markings/sec, 125 secs
lola: 871540 markings, 3009410 edges, 7254 markings/sec, 130 secs
lola: 908050 markings, 3146935 edges, 7302 markings/sec, 135 secs
lola: 944277 markings, 3283640 edges, 7245 markings/sec, 140 secs
lola: 982179 markings, 3430014 edges, 7580 markings/sec, 145 secs
lola: 1019373 markings, 3570471 edges, 7439 markings/sec, 150 secs
lola: 1056530 markings, 3711840 edges, 7431 markings/sec, 155 secs
lola: 1094137 markings, 3856210 edges, 7521 markings/sec, 160 secs
lola: 1131559 markings, 3997477 edges, 7484 markings/sec, 165 secs
lola: 1168442 markings, 4136826 edges, 7377 markings/sec, 170 secs
lola: 1204644 markings, 4276868 edges, 7240 markings/sec, 175 secs
lola: 1242097 markings, 4418158 edges, 7491 markings/sec, 180 secs
lola: 1279343 markings, 4558739 edges, 7449 markings/sec, 185 secs
lola: 1316620 markings, 4699679 edges, 7455 markings/sec, 190 secs
lola: 1353847 markings, 4840424 edges, 7445 markings/sec, 195 secs
lola: 1391086 markings, 4981223 edges, 7448 markings/sec, 200 secs
lola: 1428395 markings, 5122505 edges, 7462 markings/sec, 205 secs
lola: 1465505 markings, 5262655 edges, 7422 markings/sec, 210 secs
lola: 1502594 markings, 5402727 edges, 7418 markings/sec, 215 secs
lola: 1540554 markings, 5546251 edges, 7592 markings/sec, 220 secs
lola: 1578588 markings, 5690434 edges, 7607 markings/sec, 225 secs
lola: 1615728 markings, 5830686 edges, 7428 markings/sec, 230 secs
lola: 1653297 markings, 5970114 edges, 7514 markings/sec, 235 secs
lola: 1690316 markings, 6107360 edges, 7404 markings/sec, 240 secs
lola: 1726912 markings, 6243398 edges, 7319 markings/sec, 245 secs
lola: 1763766 markings, 6378420 edges, 7371 markings/sec, 250 secs
lola: 1799627 markings, 6506071 edges, 7172 markings/sec, 255 secs
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 1806266 markings, 6527569 edges
lola: RESULT
lola:
SUMMARY: 50 1 20 50 1 50 1 50 1 1 1 1 20 1 1 1
lola:
preliminary result: 50 1 20 50 1 50 1 50 1 1 1 1 20 1 1 1
lola: ========================================
lola: memory consumption: 213284 KB
lola: time consumption: 494 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.json
rslt: finished

BK_STOP 1552528176672

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

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