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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 7.1K Feb 9 07:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 9 07:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 129K Feb 5 04:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 383K Feb 5 04:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.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.8K Feb 4 22:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 75K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 219K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 2 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 2 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 37K Jan 29 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Jan 29 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K 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 2.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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1552526977617

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2752
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-V20P20N50

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Mar 14 01:29:37 2019
",
"timelimit": 3570
},
"child":
[

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(COMPTEUR_39 <= NB_ATTENTE_A_20)",
"processed_size": 32,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X ((2 <= ROUTE_B)))",
"processed_size": 22,
"rewrites": 23
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X ((2 <= ROUTE_A)))",
"processed_size": 22,
"rewrites": 23
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((2 <= ROUTE_B) U X (F ((CHOIX_1 + CHOIX_2 <= CAPACITE)))))",
"processed_size": 62,
"rewrites": 23
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((NB_ATTENTE_A_4 <= COMPTEUR_16)))",
"processed_size": 39,
"rewrites": 25
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(NB_ATTENTE_A_7 + 1 <= COMPTEUR_34)",
"processed_size": 35,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 98
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((CHOIX_1 <= COMPTEUR_18))))",
"processed_size": 36,
"rewrites": 23
},
"result":
{
"edges": 22656925,
"markings": 6480328,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((NB_ATTENTE_B_3 <= COMPTEUR_11))))",
"processed_size": 43,
"rewrites": 23
},
"result":
{
"edges": 24963836,
"markings": 7180407,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1376
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((COMPTEUR_10 <= NB_ATTENTE_A_8))))",
"processed_size": 43,
"rewrites": 23
},
"result":
{
"edges": 20969,
"markings": 6815,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2752
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((1 <= SUR_PONT_A) U ((1 <= SORTI_A) U (3 <= CAPACITE))))",
"processed_size": 60,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 71232,
"runtime": 818.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : A(G(**)) : A(X(**)) : ** : A((** U (** U **))) : ** : FALSE : A((** U X(F(**)))) : A(X(**)) : A(G(F(**))) : A(G(**)) : ** : ** : A(G(F(**))) : A(F(**)) : A(F(G(**)))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "no no yes no yes no no yes yes yes no yes yes yes yes no ",
"value": "no no yes no yes no no yes yes yes no yes yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 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 LTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 <= SUR_PONT_A)
lola: after: (1 <= SUR_PONT_A)
lola: place invariant simplifies atomic proposition
lola: before: (COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 <= SORTI_A)
lola: after: (1 <= SORTI_A)
lola: LP says that atomic proposition is always false: (3 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: A ((3 <= CHOIX_1 + CHOIX_2)) : A (G (G (G ((2 <= SORTI_A))))) : A (X ((2 <= ROUTE_A))) : A ((CAPACITE <= ATTENTE_A)) : A (((1 <= SUR_PONT_A) U ((1 <= SORTI_A) U (3 <= CAPACITE)))) : A ((2 <= SUR_PONT_A)) : A (F (G (F (F ((3 <= CONTROLEUR_1 + CONTROLEUR_2)))))) : A (((2 <= ROUTE_B) U X (F ((CHOIX_1 + CHOIX_2 <= CAPACITE))))) : A (X ((2 <= ROUTE_B))) : A (G (F ((NB_ATTENTE_B_3 <= COMPTEUR_11)))) : A (G ((NB_ATTENTE_A_4 <= COMPTEUR_16))) : A ((COMPTEUR_23 <= NB_ATTENTE_A_15)) : A ((COMPTEUR_39 <= NB_ATTENTE_A_20)) : A (X (X (G (F ((CHOIX_1 <= COMPTEUR_18)))))) : A ((F (F ((COMPTEUR_40 <= CONTROLEUR_2))) U F (F ((COMPTEUR_34 <= NB_ATTENTE_A_7))))) : A (F (X (X (G ((COMPTEUR_10 <= NB_ATTENTE_A_8))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (CAPACITE <= ATTENTE_A)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (CAPACITE <= ATTENTE_A)
lola: processed formula length: 23
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= SUR_PONT_A)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SUR_PONT_A)
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (COMPTEUR_23 <= NB_ATTENTE_A_15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (COMPTEUR_23 <= NB_ATTENTE_A_15)
lola: processed formula length: 32
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (COMPTEUR_39 <= NB_ATTENTE_A_20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (COMPTEUR_39 <= NB_ATTENTE_A_20)
lola: processed formula length: 32
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= ROUTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= ROUTE_B)))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= ROUTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= ROUTE_A)))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= ROUTE_B) U X (F ((CHOIX_1 + CHOIX_2 <= CAPACITE)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= ROUTE_B) U X (F ((CHOIX_1 + CHOIX_2 <= CAPACITE)))))
lola: processed formula length: 62
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= SORTI_A)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((2 <= SORTI_A)))
lola: processed formula length: 22
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (SORTI_A <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NB_ATTENTE_A_4 <= COMPTEUR_16)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((NB_ATTENTE_A_4 <= COMPTEUR_16)))
lola: processed formula length: 39
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (COMPTEUR_16 + 1 <= NB_ATTENTE_A_4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((COMPTEUR_34 <= NB_ATTENTE_A_7)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (NB_ATTENTE_A_7 + 1 <= COMPTEUR_34)
lola: processed formula length: 35
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: ========================================
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((CHOIX_1 <= COMPTEUR_18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((CHOIX_1 <= COMPTEUR_18))))
lola: processed formula length: 36
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 94375 markings, 297984 edges, 18875 markings/sec, 0 secs
lola: 177756 markings, 562588 edges, 16676 markings/sec, 5 secs
lola: 274630 markings, 871730 edges, 19375 markings/sec, 10 secs
lola: 355866 markings, 1126976 edges, 16247 markings/sec, 15 secs
lola: 435811 markings, 1374796 edges, 15989 markings/sec, 20 secs
lola: 534366 markings, 1687475 edges, 19711 markings/sec, 25 secs
lola: 630859 markings, 1998231 edges, 19299 markings/sec, 30 secs
lola: 724084 markings, 2300419 edges, 18645 markings/sec, 35 secs
lola: 833247 markings, 2658600 edges, 21833 markings/sec, 40 secs
lola: 928878 markings, 2964082 edges, 19126 markings/sec, 45 secs
lola: 1067721 markings, 3434885 edges, 27769 markings/sec, 50 secs
lola: 1167164 markings, 3772674 edges, 19889 markings/sec, 55 secs
lola: 1271760 markings, 4130673 edges, 20919 markings/sec, 60 secs
lola: 1433960 markings, 4702058 edges, 32440 markings/sec, 65 secs
lola: 1529439 markings, 5031981 edges, 19096 markings/sec, 70 secs
lola: 1679077 markings, 5562535 edges, 29928 markings/sec, 75 secs
lola: 1724829 markings, 5702921 edges, 9150 markings/sec, 80 secs
lola: 1787293 markings, 5877071 edges, 12493 markings/sec, 85 secs
lola: 1890269 markings, 6216077 edges, 20595 markings/sec, 90 secs
lola: 1966283 markings, 6463063 edges, 15203 markings/sec, 95 secs
lola: 2031144 markings, 6646230 edges, 12972 markings/sec, 100 secs
lola: 2118091 markings, 6928040 edges, 17389 markings/sec, 105 secs
lola: 2227600 markings, 7310580 edges, 21902 markings/sec, 110 secs
lola: 2283388 markings, 7466647 edges, 11158 markings/sec, 115 secs
lola: 2354728 markings, 7685669 edges, 14268 markings/sec, 120 secs
lola: 2457938 markings, 8035651 edges, 20642 markings/sec, 125 secs
lola: 2565050 markings, 8419090 edges, 21422 markings/sec, 130 secs
lola: 2623757 markings, 8594775 edges, 11741 markings/sec, 135 secs
lola: 2696371 markings, 8821344 edges, 14523 markings/sec, 140 secs
lola: 2786428 markings, 9127645 edges, 18011 markings/sec, 145 secs
lola: 2892492 markings, 9506927 edges, 21213 markings/sec, 150 secs
lola: 2990146 markings, 9859960 edges, 19531 markings/sec, 155 secs
lola: 3061012 markings, 10077261 edges, 14173 markings/sec, 160 secs
lola: 3138087 markings, 10328583 edges, 15415 markings/sec, 165 secs
lola: 3239785 markings, 10685995 edges, 20340 markings/sec, 170 secs
lola: 3343785 markings, 11063793 edges, 20800 markings/sec, 175 secs
lola: 3466340 markings, 11523873 edges, 24511 markings/sec, 180 secs
lola: 3534219 markings, 11738462 edges, 13576 markings/sec, 185 secs
lola: 3620925 markings, 12024303 edges, 17341 markings/sec, 190 secs
lola: 3718788 markings, 12365950 edges, 19573 markings/sec, 195 secs
lola: 3828563 markings, 12768310 edges, 21955 markings/sec, 200 secs
lola: 3948313 markings, 13217568 edges, 23950 markings/sec, 205 secs
lola: 4058460 markings, 13641242 edges, 22029 markings/sec, 210 secs
lola: 4131544 markings, 13874465 edges, 14617 markings/sec, 215 secs
lola: 4221197 markings, 14175995 edges, 17931 markings/sec, 220 secs
lola: 4328366 markings, 14559240 edges, 21434 markings/sec, 225 secs
lola: 4452521 markings, 15022688 edges, 24831 markings/sec, 230 secs
lola: 4576958 markings, 15493368 edges, 24887 markings/sec, 235 secs
lola: 4736347 markings, 16116462 edges, 31878 markings/sec, 240 secs
lola: 4817922 markings, 16385687 edges, 16315 markings/sec, 245 secs
lola: 4921005 markings, 16740077 edges, 20617 markings/sec, 250 secs
lola: 5035001 markings, 17150746 edges, 22799 markings/sec, 255 secs
lola: 5135637 markings, 17527562 edges, 20127 markings/sec, 260 secs
lola: 5258624 markings, 18000441 edges, 24597 markings/sec, 265 secs
lola: 5382747 markings, 18486889 edges, 24825 markings/sec, 270 secs
lola: 5521208 markings, 19028754 edges, 27692 markings/sec, 275 secs
lola: 5603326 markings, 19316238 edges, 16424 markings/sec, 280 secs
lola: 5689890 markings, 19615224 edges, 17313 markings/sec, 285 secs
lola: 5798120 markings, 20003175 edges, 21646 markings/sec, 290 secs
lola: 5907106 markings, 20410495 edges, 21797 markings/sec, 295 secs
lola: 6027284 markings, 20865630 edges, 24036 markings/sec, 300 secs
lola: 6143469 markings, 21321170 edges, 23237 markings/sec, 305 secs
lola: 6262151 markings, 21783569 edges, 23736 markings/sec, 310 secs
lola: 6420528 markings, 22417488 edges, 31675 markings/sec, 315 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6480328 markings, 22656925 edges
lola: ========================================
lola: subprocess 13 will run for 1078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((NB_ATTENTE_B_3 <= COMPTEUR_11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((NB_ATTENTE_B_3 <= COMPTEUR_11))))
lola: processed formula length: 43
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 70068 markings, 213128 edges, 14014 markings/sec, 0 secs
lola: 133577 markings, 405996 edges, 12702 markings/sec, 5 secs
lola: 192105 markings, 579845 edges, 11706 markings/sec, 10 secs
lola: 248630 markings, 749945 edges, 11305 markings/sec, 15 secs
lola: 297601 markings, 898628 edges, 9794 markings/sec, 20 secs
lola: 332373 markings, 984935 edges, 6954 markings/sec, 25 secs
lola: 371349 markings, 1086436 edges, 7795 markings/sec, 30 secs
lola: 417325 markings, 1210936 edges, 9195 markings/sec, 35 secs
lola: 464585 markings, 1343256 edges, 9452 markings/sec, 40 secs
lola: 515433 markings, 1489625 edges, 10170 markings/sec, 45 secs
lola: 571533 markings, 1660277 edges, 11220 markings/sec, 50 secs
lola: 632378 markings, 1841164 edges, 12169 markings/sec, 55 secs
lola: 698125 markings, 2047223 edges, 13149 markings/sec, 60 secs
lola: 764173 markings, 2257804 edges, 13210 markings/sec, 65 secs
lola: 835705 markings, 2479725 edges, 14306 markings/sec, 70 secs
lola: 906505 markings, 2710346 edges, 14160 markings/sec, 75 secs
lola: 963894 markings, 2881957 edges, 11478 markings/sec, 80 secs
lola: 1004337 markings, 2993902 edges, 8089 markings/sec, 85 secs
lola: 1056912 markings, 3154794 edges, 10515 markings/sec, 90 secs
lola: 1128707 markings, 3388901 edges, 14359 markings/sec, 95 secs
lola: 1182793 markings, 3546264 edges, 10817 markings/sec, 100 secs
lola: 1225137 markings, 3664055 edges, 8469 markings/sec, 105 secs
lola: 1277323 markings, 3823625 edges, 10437 markings/sec, 110 secs
lola: 1341750 markings, 4032086 edges, 12885 markings/sec, 115 secs
lola: 1409704 markings, 4249347 edges, 13591 markings/sec, 120 secs
lola: 1462125 markings, 4404405 edges, 10484 markings/sec, 125 secs
lola: 1507976 markings, 4539312 edges, 9170 markings/sec, 130 secs
lola: 1566532 markings, 4725190 edges, 11711 markings/sec, 135 secs
lola: 1637575 markings, 4965542 edges, 14209 markings/sec, 140 secs
lola: 1714059 markings, 5218306 edges, 15297 markings/sec, 145 secs
lola: 1767839 markings, 5378600 edges, 10756 markings/sec, 150 secs
lola: 1819325 markings, 5536983 edges, 10297 markings/sec, 155 secs
lola: 1877253 markings, 5728275 edges, 11586 markings/sec, 160 secs
lola: 1944936 markings, 5957191 edges, 13537 markings/sec, 165 secs
lola: 2021059 markings, 6229184 edges, 15225 markings/sec, 170 secs
lola: 2098432 markings, 6482796 edges, 15475 markings/sec, 175 secs
lola: 2149720 markings, 6637531 edges, 10258 markings/sec, 180 secs
lola: 2206480 markings, 6819396 edges, 11352 markings/sec, 185 secs
lola: 2270741 markings, 7035285 edges, 12852 markings/sec, 190 secs
lola: 2342901 markings, 7291198 edges, 14432 markings/sec, 195 secs
lola: 2419567 markings, 7565297 edges, 15333 markings/sec, 200 secs
lola: 2505404 markings, 7861413 edges, 17167 markings/sec, 205 secs
lola: 2578746 markings, 8099313 edges, 14668 markings/sec, 210 secs
lola: 2635374 markings, 8280549 edges, 11326 markings/sec, 215 secs
lola: 2697774 markings, 8490788 edges, 12480 markings/sec, 220 secs
lola: 2770352 markings, 8746590 edges, 14516 markings/sec, 225 secs
lola: 2847542 markings, 9022937 edges, 15438 markings/sec, 230 secs
lola: 2929785 markings, 9327316 edges, 16449 markings/sec, 235 secs
lola: 3007242 markings, 9595620 edges, 15491 markings/sec, 240 secs
lola: 3071340 markings, 9799913 edges, 12820 markings/sec, 245 secs
lola: 3138301 markings, 10023118 edges, 13392 markings/sec, 250 secs
lola: 3203548 markings, 10244926 edges, 13049 markings/sec, 255 secs
lola: 3278019 markings, 10510110 edges, 14894 markings/sec, 260 secs
lola: 3358344 markings, 10804955 edges, 16065 markings/sec, 265 secs
lola: 3439049 markings, 11100988 edges, 16141 markings/sec, 270 secs
lola: 3532101 markings, 11455889 edges, 18610 markings/sec, 275 secs
lola: 3631421 markings, 11800550 edges, 19864 markings/sec, 280 secs
lola: 3717048 markings, 12089405 edges, 17125 markings/sec, 285 secs
lola: 3776776 markings, 12285925 edges, 11946 markings/sec, 290 secs
lola: 3849301 markings, 12539221 edges, 14505 markings/sec, 295 secs
lola: 3926011 markings, 12818479 edges, 15342 markings/sec, 300 secs
lola: 4010820 markings, 13130572 edges, 16962 markings/sec, 305 secs
lola: 4096609 markings, 13447327 edges, 17158 markings/sec, 310 secs
lola: 4184747 markings, 13781508 edges, 17628 markings/sec, 315 secs
lola: 4277748 markings, 14128714 edges, 18600 markings/sec, 320 secs
lola: 4392281 markings, 14540136 edges, 22907 markings/sec, 325 secs
lola: 4474880 markings, 14821141 edges, 16520 markings/sec, 330 secs
lola: 4540809 markings, 15047818 edges, 13186 markings/sec, 335 secs
lola: 4621147 markings, 15335740 edges, 16068 markings/sec, 340 secs
lola: 4701305 markings, 15631072 edges, 16032 markings/sec, 345 secs
lola: 4794241 markings, 15979358 edges, 18587 markings/sec, 350 secs
lola: 4882103 markings, 16313612 edges, 17572 markings/sec, 355 secs
lola: 4975735 markings, 16676643 edges, 18726 markings/sec, 360 secs
lola: 5069602 markings, 17039806 edges, 18773 markings/sec, 365 secs
lola: 5173779 markings, 17415417 edges, 20835 markings/sec, 370 secs
lola: 5289837 markings, 17838183 edges, 23212 markings/sec, 375 secs
lola: 5359110 markings, 18071239 edges, 13855 markings/sec, 380 secs
lola: 5428582 markings, 18316447 edges, 13894 markings/sec, 385 secs
lola: 5518214 markings, 18646918 edges, 17926 markings/sec, 390 secs
lola: 5599816 markings, 18949674 edges, 16320 markings/sec, 395 secs
lola: 5687166 markings, 19283760 edges, 17470 markings/sec, 400 secs
lola: 5783175 markings, 19656376 edges, 19202 markings/sec, 405 secs
lola: 5879302 markings, 20029361 edges, 19225 markings/sec, 410 secs
lola: 5974955 markings, 20401859 edges, 19131 markings/sec, 415 secs
lola: 6072703 markings, 20773647 edges, 19550 markings/sec, 420 secs
lola: 6199908 markings, 21243032 edges, 25441 markings/sec, 425 secs
lola: 6322249 markings, 21701098 edges, 24468 markings/sec, 430 secs
lola: 6376909 markings, 21875769 edges, 10932 markings/sec, 435 secs
lola: 6457230 markings, 22168198 edges, 16064 markings/sec, 440 secs
lola: 6554532 markings, 22530995 edges, 19460 markings/sec, 445 secs
lola: 6644729 markings, 22870210 edges, 18039 markings/sec, 450 secs
lola: 6734770 markings, 23214984 edges, 18008 markings/sec, 455 secs
lola: 6829349 markings, 23581184 edges, 18916 markings/sec, 460 secs
lola: 6929603 markings, 23974194 edges, 20051 markings/sec, 465 secs
lola: 7032632 markings, 24386326 edges, 20606 markings/sec, 470 secs
lola: 7130933 markings, 24774206 edges, 19660 markings/sec, 475 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7180407 markings, 24963836 edges
lola: ========================================
lola: subprocess 14 will run for 1376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((COMPTEUR_10 <= NB_ATTENTE_A_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((COMPTEUR_10 <= NB_ATTENTE_A_8))))
lola: processed formula length: 43
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6815 markings, 20969 edges
lola: ========================================
lola: subprocess 15 will run for 2752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= SUR_PONT_A) U ((1 <= SORTI_A) U (3 <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= SUR_PONT_A) U ((1 <= SORTI_A) U (3 <= CAPACITE))))
lola: processed formula length: 60
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: RESULT
lola:
SUMMARY: no no yes no yes no no yes yes yes no yes yes yes yes no
lola:
preliminary result: no no yes no yes no no yes yes yes no yes yes yes yes no
lola: ========================================
lola: memory consumption: 71232 KB
lola: time consumption: 818 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552527795355

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P20N50"
export BK_EXAMINATION="LTLCardinality"
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-V20P20N50, examination is LTLCardinality"
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-155225065700564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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