Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r030-oct2-158897741200087.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
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 r030-oct2-158897741200087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 8.3K Mar 26 02:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 26 02:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 125K Mar 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 369K Mar 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 309K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 25 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 25 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 128K Mar 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 374K Mar 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.5M Mar 24 05:37 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-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-15

=== Now, execution of the tool begins

BK_START 1589306183960

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA BridgeAndVehicles-PT-V20P20N50-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2155
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": "Tue May 12 17:56:24 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(ROUTE_A <= 1)",
"processed_size": 14,
"rewrites": 129
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"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": 129
},
"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": 353
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (G (((1 <= CHOIX_1 + CHOIX_2) OR (G ((1 <= CHOIX_1 + CHOIX_2)) AND F ((1 <= CHOIX_1 + CHOIX_2)))))))",
"processed_size": 105,
"rewrites": 129
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 353
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 353
},
"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": "(3 <= SORTI_A)",
"processed_size": 14,
"rewrites": 129
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 398
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((X (G ((NB_ATTENTE_B_18 <= CAPACITE))) OR F ((ROUTE_B <= SUR_PONT_B))))",
"processed_size": 74,
"rewrites": 129
},
"result":
{
"edges": 23738811,
"markings": 7437938,
"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": 446
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"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": "(ROUTE_B <= CHOIX_2)",
"processed_size": 20,
"rewrites": 129
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((F ((CHOIX_2 <= SUR_PONT_A)) OR X (G ((CONTROLEUR_2 + 1 <= SORTI_B)))))",
"processed_size": 74,
"rewrites": 129
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 624
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((ROUTE_B + 1 <= SUR_PONT_B) OR X ((ATTENTE_B + 1 <= COMPTEUR_10)))))",
"processed_size": 75,
"rewrites": 129
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 781
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((CAPACITE <= ATTENTE_A)))",
"processed_size": 31,
"rewrites": 129
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"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": 1041
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((((ROUTE_A + 1 <= SUR_PONT_A)) U X (TRUE))))",
"processed_size": 50,
"rewrites": 129
},
"result":
{
"edges": 19,
"markings": 14,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 13,
"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": 1562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F ((F ((2 <= ROUTE_A)) AND ((COMPTEUR_34 <= CHOIX_2) AND X ((CHOIX_2 + 1 <= COMPTEUR_34))))))",
"processed_size": 96,
"rewrites": 129
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"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": 3124
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3124
},
"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 ((ATTENTE_B <= CONTROLEUR_1)))",
"processed_size": 35,
"rewrites": 131
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))) OR (X (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2))) OR (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2)) AND F (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2)))))))",
"processed_size": 203,
"rewrites": 129
},
"result":
{
"edges": 571344827,
"markings": 86400162,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 89504,
"runtime": 1390.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** AND A(X(((* AND (G(*) OR G(F(*)))) R F(*))))) : (* AND A(X(F(*)))) : (A(X(**)) AND A(X(G((** OR (G(**) AND F(**))))))) : TRUE : TRUE : A((F(G(**)) OR (X(G(**)) OR (G(**) AND F(G(**)))))) : FALSE : TRUE : A((X(G(**)) OR F(**))) : (A(F(G(*))) AND (* AND A(X(*)))) : (A(G(F((* R F(*))))) AND A(G(**))) : A((F(**) OR X(G(*)))) : A(G((* OR X(*)))) : A(X(**)) : A(X((** U X(TRUE)))) : A(F((F(**) AND (* AND X(*)))))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "no no no yes yes yes no yes yes no no yes no no yes no ",
"value": "no no no yes yes yes no yes yes no no yes no no 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 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: LP says that atomic proposition is always false: (2 <= CHOIX_1 + CHOIX_2)
lola: LP says that atomic proposition is always false: (2 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (CHOIX_1 + CHOIX_2 <= 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)
lola: after: (CHOIX_1 + CHOIX_2 <= 1)
lola: LP says that atomic proposition is always true: (CHOIX_1 + CHOIX_2 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (0 <= 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)
lola: after: (0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= 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)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= 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)
lola: after: (0 <= 0)
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 <= 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)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (NB_ATTENTE_B_19 + NB_ATTENTE_B_18 + NB_ATTENTE_B_17 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_16 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_20 <= SORTI_A)
lola: after: (1 <= SORTI_A)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= 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)
lola: after: (1 <= 0)
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 <= ROUTE_A)
lola: after: (1 <= ROUTE_A)
lola: LP says that atomic proposition is always false: (3 <= VIDANGE_1 + VIDANGE_2)
lola: LP says that atomic proposition is always false: (3 <= VIDANGE_1 + VIDANGE_2)
lola: place invariant simplifies atomic proposition
lola: before: (SUR_PONT_B <= NB_ATTENTE_B_19 + NB_ATTENTE_B_18 + NB_ATTENTE_B_17 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_16 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_20)
lola: after: (SUR_PONT_B <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (SUR_PONT_B <= NB_ATTENTE_B_19 + NB_ATTENTE_B_18 + NB_ATTENTE_B_17 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_16 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_20)
lola: after: (SUR_PONT_B <= 1)
lola: LP says that atomic proposition is always false: (2 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: LP says that atomic proposition is always false: (2 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: A (((3 <= SORTI_A) AND X (NOT(((F (X (G ((1 <= CONTROLEUR_1 + CONTROLEUR_2)))) U (1 <= CONTROLEUR_1 + CONTROLEUR_2)) U G ((1 <= CONTROLEUR_1 + CONTROLEUR_2))))))) : A (NOT(((2 <= ROUTE_A) OR G (X ((SORTI_A <= SUR_PONT_B)))))) : A (X ((G (F (((3 <= CONTROLEUR_1 + CONTROLEUR_2) AND F ((1 <= CHOIX_1 + CHOIX_2))))) U ((2 <= ROUTE_B) AND G ((G ((1 <= CHOIX_1 + CHOIX_2)) U (1 <= CHOIX_1 + CHOIX_2))))))) : A ((X ((2 <= CHOIX_1 + CHOIX_2)) OR (X (()) U (CHOIX_1 + CHOIX_2 <= 1)))) : A (G ((() OR F (((0 <= 0) AND X (X (X (((0 <= 0) OR G ((1 <= ROUTE_B))))))))))) : A ((F (X (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2)))) OR (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2)) U (G ((1 <= 0)) OR G (X ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2))))))) : A (X ((F ((() AND ((ROUTE_A <= 0) U G ((3 <= VIDANGE_1 + VIDANGE_2))))) AND X (G ((3 <= VIDANGE_1 + VIDANGE_2)))))) : A (G (NOT(((((SUR_PONT_B <= 1) OR (ROUTE_B <= ATTENTE_B)) OR ((SUR_PONT_B <= 1) U (2 <= CONTROLEUR_1 + CONTROLEUR_2))) AND F ((2 <= CONTROLEUR_1 + CONTROLEUR_2)))))) : A ((G (X ((NB_ATTENTE_B_18 <= CAPACITE))) OR F (((1 <= SUR_PONT_B) U (ROUTE_B <= SUR_PONT_B))))) : A ((NOT(F (G (F ((VIDANGE_2 + 1 <= CONTROLEUR_2))))) AND NOT(((CHOIX_2 + 1 <= ROUTE_B) OR X ((2 <= ROUTE_A)))))) : A (G ((X (G (X (X (G (F (NOT(((1 <= ATTENTE_B) U G ((1 <= ATTENTE_B)))))))))) AND G ((ATTENTE_B <= CONTROLEUR_1))))) : A ((F ((CHOIX_2 <= SUR_PONT_A)) OR NOT(F (X ((SORTI_B <= CONTROLEUR_2)))))) : A (G (NOT(((SUR_PONT_B <= ROUTE_B) AND X ((COMPTEUR_10 <= ATTENTE_B)))))) : A (NOT(X (NOT(((CAPACITE <= ATTENTE_A) AND G ((0 <= SUR_PONT_A))))))) : A (X ((((ROUTE_A + 1 <= SUR_PONT_A)) U X (F ((G ((COMPTEUR_38 <= ROUTE_A)) U G ((0 <= CHOIX_1)))))))) : A (F ((F ((2 <= ROUTE_A)) AND NOT(((CHOIX_2 + 1 <= COMPTEUR_34) OR X ((COMPTEUR_34 <= CHOIX_2)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 129 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 129 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 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: 129 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 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 129 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ROUTE_A <= 1) AND A (X (F ((SUR_PONT_B + 1 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ROUTE_A <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ROUTE_A <= 1)
lola: processed formula length: 14
lola: 129 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))) OR (X (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2))) OR (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2)) AND F (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))) OR (X (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2))) OR (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2)) AND F (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2)))))))
lola: processed formula length: 203
lola: 129 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 549590 markings, 3158561 edges, 109918 markings/sec, 0 secs
lola: 1053149 markings, 6259914 edges, 100712 markings/sec, 5 secs
lola: 1541001 markings, 9330507 edges, 97570 markings/sec, 10 secs
lola: 2024910 markings, 12410745 edges, 96782 markings/sec, 15 secs
lola: 2511235 markings, 15536719 edges, 97265 markings/sec, 20 secs
lola: 2996384 markings, 18642818 edges, 97030 markings/sec, 25 secs
lola: 3475193 markings, 21767812 edges, 95762 markings/sec, 30 secs
lola: 3991033 markings, 24738113 edges, 103168 markings/sec, 35 secs
lola: 4464492 markings, 27630774 edges, 94692 markings/sec, 40 secs
lola: 4934765 markings, 30577620 edges, 94055 markings/sec, 45 secs
lola: 5401412 markings, 33543773 edges, 93329 markings/sec, 50 secs
lola: 5880154 markings, 36666475 edges, 95748 markings/sec, 55 secs
lola: 6366627 markings, 39759752 edges, 97295 markings/sec, 60 secs
lola: 6835122 markings, 42876380 edges, 93699 markings/sec, 65 secs
lola: 7317264 markings, 45953463 edges, 96428 markings/sec, 70 secs
lola: 7785352 markings, 49088765 edges, 93618 markings/sec, 75 secs
lola: 8256319 markings, 52147658 edges, 94193 markings/sec, 80 secs
lola: 8726372 markings, 55083123 edges, 94011 markings/sec, 85 secs
lola: 9179204 markings, 57936373 edges, 90566 markings/sec, 90 secs
lola: 9632910 markings, 60918546 edges, 90741 markings/sec, 95 secs
lola: 10093412 markings, 63822311 edges, 92100 markings/sec, 100 secs
lola: 10554527 markings, 66754016 edges, 92223 markings/sec, 105 secs
lola: 11008025 markings, 69710874 edges, 90700 markings/sec, 110 secs
lola: 11475413 markings, 72708186 edges, 93478 markings/sec, 115 secs
lola: 11935627 markings, 75689560 edges, 92043 markings/sec, 120 secs
lola: 12390876 markings, 78559887 edges, 91050 markings/sec, 125 secs
lola: 12854981 markings, 81636823 edges, 92821 markings/sec, 130 secs
lola: 13322295 markings, 84612258 edges, 93463 markings/sec, 135 secs
lola: 13791990 markings, 87696123 edges, 93939 markings/sec, 140 secs
lola: 14250751 markings, 90590343 edges, 91752 markings/sec, 145 secs
lola: 14720194 markings, 93720587 edges, 93889 markings/sec, 150 secs
lola: 15194118 markings, 96765358 edges, 94785 markings/sec, 155 secs
lola: 15659976 markings, 99808262 edges, 93172 markings/sec, 160 secs
lola: 16129759 markings, 102810253 edges, 93957 markings/sec, 165 secs
lola: 16574863 markings, 105739941 edges, 89021 markings/sec, 170 secs
lola: 17026320 markings, 108765251 edges, 90291 markings/sec, 175 secs
lola: 17483527 markings, 111666216 edges, 91441 markings/sec, 180 secs
lola: 17942015 markings, 114707187 edges, 91698 markings/sec, 185 secs
lola: 18394200 markings, 117594790 edges, 90437 markings/sec, 190 secs
lola: 18844265 markings, 120559012 edges, 90013 markings/sec, 195 secs
lola: 19306650 markings, 123681878 edges, 92477 markings/sec, 200 secs
lola: 19768691 markings, 126647495 edges, 92408 markings/sec, 205 secs
lola: 20220185 markings, 129620307 edges, 90299 markings/sec, 210 secs
lola: 20682471 markings, 132738676 edges, 92457 markings/sec, 215 secs
lola: 21116247 markings, 135453608 edges, 86755 markings/sec, 220 secs
lola: 21572832 markings, 138513358 edges, 91317 markings/sec, 225 secs
lola: 22042204 markings, 141688511 edges, 93874 markings/sec, 230 secs
lola: 22505230 markings, 144651713 edges, 92605 markings/sec, 235 secs
lola: 22963698 markings, 147705800 edges, 91694 markings/sec, 240 secs
lola: 23437131 markings, 150909797 edges, 94687 markings/sec, 245 secs
lola: 23880270 markings, 153695518 edges, 88628 markings/sec, 250 secs
lola: 24348587 markings, 156833690 edges, 93663 markings/sec, 255 secs
lola: 24827724 markings, 160089033 edges, 95827 markings/sec, 260 secs
lola: 25320255 markings, 163084765 edges, 98506 markings/sec, 265 secs
lola: 25805341 markings, 165435226 edges, 97017 markings/sec, 270 secs
lola: 26270922 markings, 167745056 edges, 93116 markings/sec, 275 secs
lola: 26733638 markings, 170057763 edges, 92543 markings/sec, 280 secs
lola: 27183960 markings, 172660832 edges, 90064 markings/sec, 285 secs
lola: 27547804 markings, 175749494 edges, 72769 markings/sec, 290 secs
lola: 27898296 markings, 178808995 edges, 70098 markings/sec, 295 secs
lola: 28242113 markings, 181884226 edges, 68763 markings/sec, 300 secs
lola: 28581243 markings, 184968866 edges, 67826 markings/sec, 305 secs
lola: 28920021 markings, 188067603 edges, 67756 markings/sec, 310 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown yes yes unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown no unknown yes yes unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 3946756 KB
lola: time consumption: 362 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: memory consumption: 3947496 KB
lola: time consumption: 362 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((2 <= ROUTE_B))) AND A (X (G (((1 <= CHOIX_1 + CHOIX_2) OR (G ((1 <= CHOIX_1 + CHOIX_2)) AND F ((1 <= CHOIX_1 + CHOIX_2))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 318 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: 129 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 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((1 <= CHOIX_1 + CHOIX_2) OR (G ((1 <= CHOIX_1 + CHOIX_2)) AND F ((1 <= CHOIX_1 + CHOIX_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((1 <= CHOIX_1 + CHOIX_2) OR (G ((1 <= CHOIX_1 + CHOIX_2)) AND F ((1 <= CHOIX_1 + CHOIX_2)))))))
lola: processed formula length: 105
lola: 129 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= SORTI_A) AND A (X ((((CONTROLEUR_1 + CONTROLEUR_2 <= 0) AND (G ((CONTROLEUR_1 + CONTROLEUR_2 <= 0)) OR G (F ((CONTROLEUR_1 + CONTROLEUR_2 <= 0))))) R F ((CONTROLEUR_1 + CONTROLEUR_2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= SORTI_A)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= SORTI_A)
lola: processed formula length: 14
lola: 129 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((NB_ATTENTE_B_18 <= CAPACITE))) OR F ((ROUTE_B <= SUR_PONT_B))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((NB_ATTENTE_B_18 <= CAPACITE))) OR F ((ROUTE_B <= SUR_PONT_B))))
lola: processed formula length: 74
lola: 129 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: ========================================
lola: 671454 markings, 1942803 edges, 134291 markings/sec, 0 secs
lola: 1306982 markings, 3873981 edges, 127106 markings/sec, 5 secs
lola: 1935469 markings, 5793246 edges, 125697 markings/sec, 10 secs
lola: 2528785 markings, 7682132 edges, 118663 markings/sec, 15 secs
lola: 3120998 markings, 9574241 edges, 118443 markings/sec, 20 secs
lola: 3718149 markings, 11504456 edges, 119430 markings/sec, 25 secs
lola: 4333679 markings, 13505642 edges, 123106 markings/sec, 30 secs
lola: 4955373 markings, 15533140 edges, 124339 markings/sec, 35 secs
lola: 5578478 markings, 17575929 edges, 124621 markings/sec, 40 secs
lola: 6207811 markings, 19638295 edges, 125867 markings/sec, 45 secs
lola: 6846041 markings, 21746349 edges, 127646 markings/sec, 50 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: 7437938 markings, 23738811 edges
lola: ========================================
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((CONTROLEUR_2 <= VIDANGE_2)))) AND ((ROUTE_B <= CHOIX_2) AND A (X ((ROUTE_A <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ROUTE_B <= CHOIX_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ROUTE_B <= CHOIX_2)
lola: processed formula length: 20
lola: 129 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((CHOIX_2 <= SUR_PONT_A)) OR X (G ((CONTROLEUR_2 + 1 <= SORTI_B)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((CHOIX_2 <= SUR_PONT_A)) OR X (G ((CONTROLEUR_2 + 1 <= SORTI_B)))))
lola: processed formula length: 74
lola: 129 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ROUTE_B + 1 <= SUR_PONT_B) OR X ((ATTENTE_B + 1 <= COMPTEUR_10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((ROUTE_B + 1 <= SUR_PONT_B) OR X ((ATTENTE_B + 1 <= COMPTEUR_10)))))
lola: processed formula length: 75
lola: 129 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: subprocess 12 will run for 781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((CAPACITE <= ATTENTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((CAPACITE <= ATTENTE_A)))
lola: processed formula length: 31
lola: 129 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: subprocess 13 will run for 1041 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((ROUTE_A + 1 <= SUR_PONT_A)) U X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((ROUTE_A + 1 <= SUR_PONT_A)) U X (TRUE))))
lola: processed formula length: 50
lola: 129 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 14 markings, 19 edges
lola: ========================================
lola: subprocess 14 will run for 1562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((2 <= ROUTE_A)) AND ((COMPTEUR_34 <= CHOIX_2) AND X ((CHOIX_2 + 1 <= COMPTEUR_34))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((2 <= ROUTE_A)) AND ((COMPTEUR_34 <= CHOIX_2) AND X ((CHOIX_2 + 1 <= COMPTEUR_34))))))
lola: processed formula length: 96
lola: 129 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: subprocess 15 will run for 3124 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (((ATTENTE_B <= 0) R F ((ATTENTE_B <= 0)))))) AND A (G ((ATTENTE_B <= CONTROLEUR_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3124 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ATTENTE_B <= CONTROLEUR_1)))
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 ((ATTENTE_B <= CONTROLEUR_1)))
lola: processed formula length: 35
lola: 131 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: (CONTROLEUR_1 + 1 <= ATTENTE_B)
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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))) OR (X (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2))) OR (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2)) AND F (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))) OR (X (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2))) OR (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2)) AND F (G ((CHOIX_1 + CHOIX_2 <= VIDANGE_1 + VIDANGE_2)))))))
lola: processed formula length: 203
lola: 129 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 549115 markings, 3155279 edges, 109823 markings/sec, 0 secs
lola: 1050375 markings, 6244562 edges, 100252 markings/sec, 5 secs
lola: 1535512 markings, 9296510 edges, 97027 markings/sec, 10 secs
lola: 2017008 markings, 12359388 edges, 96299 markings/sec, 15 secs
lola: 2499480 markings, 15460469 edges, 96494 markings/sec, 20 secs
lola: 2984567 markings, 18563712 edges, 97017 markings/sec, 25 secs
lola: 3459290 markings, 21664065 edges, 94945 markings/sec, 30 secs
lola: 3974031 markings, 24639140 edges, 102948 markings/sec, 35 secs
lola: 4441061 markings, 27480024 edges, 93406 markings/sec, 40 secs
lola: 4898251 markings, 30351384 edges, 91438 markings/sec, 45 secs
lola: 5359164 markings, 33274306 edges, 92183 markings/sec, 50 secs
lola: 5835363 markings, 36373049 edges, 95240 markings/sec, 55 secs
lola: 6310041 markings, 39421094 edges, 94936 markings/sec, 60 secs
lola: 6781232 markings, 42526064 edges, 94238 markings/sec, 65 secs
lola: 7257055 markings, 45592417 edges, 95165 markings/sec, 70 secs
lola: 7729764 markings, 48706018 edges, 94542 markings/sec, 75 secs
lola: 8185202 markings, 51702675 edges, 91088 markings/sec, 80 secs
lola: 8661939 markings, 54666827 edges, 95347 markings/sec, 85 secs
lola: 9115352 markings, 57532882 edges, 90683 markings/sec, 90 secs
lola: 9566683 markings, 60481184 edges, 90266 markings/sec, 95 secs
lola: 10027819 markings, 63399154 edges, 92227 markings/sec, 100 secs
lola: 10489903 markings, 66357763 edges, 92417 markings/sec, 105 secs
lola: 10940155 markings, 69255960 edges, 90050 markings/sec, 110 secs
lola: 11404016 markings, 72267543 edges, 92772 markings/sec, 115 secs
lola: 11860854 markings, 75201697 edges, 91368 markings/sec, 120 secs
lola: 12316541 markings, 78080946 edges, 91137 markings/sec, 125 secs
lola: 12777640 markings, 81128354 edges, 92220 markings/sec, 130 secs
lola: 13242165 markings, 84106528 edges, 92905 markings/sec, 135 secs
lola: 13703767 markings, 87112392 edges, 92320 markings/sec, 140 secs
lola: 14162057 markings, 90014563 edges, 91658 markings/sec, 145 secs
lola: 14617051 markings, 93027517 edges, 90999 markings/sec, 150 secs
lola: 15088055 markings, 96103118 edges, 94201 markings/sec, 155 secs
lola: 15553971 markings, 99109512 edges, 93183 markings/sec, 160 secs
lola: 16030924 markings, 102187439 edges, 95391 markings/sec, 165 secs
lola: 16490878 markings, 105172258 edges, 91991 markings/sec, 170 secs
lola: 16967007 markings, 108377567 edges, 95226 markings/sec, 175 secs
lola: 17443182 markings, 111415241 edges, 95235 markings/sec, 180 secs
lola: 17909786 markings, 114493379 edges, 93321 markings/sec, 185 secs
lola: 18378932 markings, 117501175 edges, 93829 markings/sec, 190 secs
lola: 18837608 markings, 120510186 edges, 91735 markings/sec, 195 secs
lola: 19306080 markings, 123677935 edges, 93694 markings/sec, 200 secs
lola: 19773661 markings, 126674204 edges, 93516 markings/sec, 205 secs
lola: 20237336 markings, 129746497 edges, 92735 markings/sec, 210 secs
lola: 20714018 markings, 132906747 edges, 95336 markings/sec, 215 secs
lola: 21157565 markings, 135724334 edges, 88709 markings/sec, 220 secs
lola: 21622376 markings, 138848149 edges, 92962 markings/sec, 225 secs
lola: 22078741 markings, 141923387 edges, 91273 markings/sec, 230 secs
lola: 22552061 markings, 144973311 edges, 94664 markings/sec, 235 secs
lola: 23018862 markings, 148066766 edges, 93360 markings/sec, 240 secs
lola: 23495230 markings, 151249659 edges, 95274 markings/sec, 245 secs
lola: 23941367 markings, 154088626 edges, 89227 markings/sec, 250 secs
lola: 24401087 markings, 157178303 edges, 91944 markings/sec, 255 secs
lola: 24862527 markings, 160328057 edges, 92288 markings/sec, 260 secs
lola: 25357530 markings, 163259232 edges, 99001 markings/sec, 265 secs
lola: 25859570 markings, 165697902 edges, 100408 markings/sec, 270 secs
lola: 26352237 markings, 168141746 edges, 98533 markings/sec, 275 secs
lola: 26842950 markings, 170610378 edges, 98143 markings/sec, 280 secs
lola: 27293969 markings, 173578827 edges, 90204 markings/sec, 285 secs
lola: 27673648 markings, 176845695 edges, 75936 markings/sec, 290 secs
lola: 28040559 markings, 180070680 edges, 73382 markings/sec, 295 secs
lola: 28405165 markings, 183375448 edges, 72921 markings/sec, 300 secs
lola: 28768602 markings, 186705900 edges, 72687 markings/sec, 305 secs
lola: 29209920 markings, 189544473 edges, 88264 markings/sec, 310 secs
lola: 29594464 markings, 192745466 edges, 76909 markings/sec, 315 secs
lola: 30019936 markings, 195687661 edges, 85094 markings/sec, 320 secs
lola: 30458458 markings, 198599300 edges, 87704 markings/sec, 325 secs
lola: 30840786 markings, 201930968 edges, 76466 markings/sec, 330 secs
lola: 31293717 markings, 204601592 edges, 90586 markings/sec, 335 secs
lola: 31668495 markings, 207714907 edges, 74956 markings/sec, 340 secs
lola: 32106531 markings, 210472289 edges, 87607 markings/sec, 345 secs
lola: 32501467 markings, 213510008 edges, 78987 markings/sec, 350 secs
lola: 32903123 markings, 216599038 edges, 80331 markings/sec, 355 secs
lola: 33375173 markings, 219216030 edges, 94410 markings/sec, 360 secs
lola: 33735081 markings, 222493552 edges, 71982 markings/sec, 365 secs
lola: 34149670 markings, 225571126 edges, 82918 markings/sec, 370 secs
lola: 34631228 markings, 228167702 edges, 96312 markings/sec, 375 secs
lola: 34994178 markings, 231509977 edges, 72590 markings/sec, 380 secs
lola: 35413587 markings, 234663054 edges, 83882 markings/sec, 385 secs
lola: 35892098 markings, 237353138 edges, 95702 markings/sec, 390 secs
lola: 36284690 markings, 240540891 edges, 78518 markings/sec, 395 secs
lola: 36692343 markings, 243794014 edges, 81531 markings/sec, 400 secs
lola: 37125115 markings, 246862802 edges, 86554 markings/sec, 405 secs
lola: 37603634 markings, 249608051 edges, 95704 markings/sec, 410 secs
lola: 37968093 markings, 253031733 edges, 72892 markings/sec, 415 secs
lola: 38384620 markings, 256272781 edges, 83305 markings/sec, 420 secs
lola: 38831898 markings, 259261354 edges, 89456 markings/sec, 425 secs
lola: 39312860 markings, 262024390 edges, 96192 markings/sec, 430 secs
lola: 39676645 markings, 265441624 edges, 72757 markings/sec, 435 secs
lola: 40088497 markings, 268749043 edges, 82370 markings/sec, 440 secs
lola: 40511585 markings, 271989144 edges, 84618 markings/sec, 445 secs
lola: 41005228 markings, 274592163 edges, 98729 markings/sec, 450 secs
lola: 41408724 markings, 277750187 edges, 80699 markings/sec, 455 secs
lola: 41769843 markings, 281237426 edges, 72224 markings/sec, 460 secs
lola: 42188956 markings, 284386566 edges, 83823 markings/sec, 465 secs
lola: 42626060 markings, 287576820 edges, 87421 markings/sec, 470 secs
lola: 43101613 markings, 290704131 edges, 95111 markings/sec, 475 secs
lola: 43584547 markings, 293955655 edges, 96587 markings/sec, 480 secs
lola: 44072208 markings, 297118028 edges, 97532 markings/sec, 485 secs
lola: 44537081 markings, 300181778 edges, 92975 markings/sec, 490 secs
lola: 45024645 markings, 303495511 edges, 97513 markings/sec, 495 secs
lola: 45514926 markings, 306531277 edges, 98056 markings/sec, 500 secs
lola: 46025408 markings, 309258524 edges, 102096 markings/sec, 505 secs
lola: 46412519 markings, 312591588 edges, 77422 markings/sec, 510 secs
lola: 46781774 markings, 316208755 edges, 73851 markings/sec, 515 secs
lola: 47219266 markings, 319467428 edges, 87498 markings/sec, 520 secs
lola: 47684341 markings, 322883844 edges, 93015 markings/sec, 525 secs
lola: 48168384 markings, 326050738 edges, 96809 markings/sec, 530 secs
lola: 48666022 markings, 329073058 edges, 99528 markings/sec, 535 secs
lola: 49142230 markings, 332086298 edges, 95242 markings/sec, 540 secs
lola: 49615913 markings, 335078658 edges, 94737 markings/sec, 545 secs
lola: 50077453 markings, 338102246 edges, 92308 markings/sec, 550 secs
lola: 50538664 markings, 341142188 edges, 92242 markings/sec, 555 secs
lola: 51002650 markings, 344210423 edges, 92797 markings/sec, 560 secs
lola: 51462600 markings, 347266129 edges, 91990 markings/sec, 565 secs
lola: 51915916 markings, 350341691 edges, 90663 markings/sec, 570 secs
lola: 52376806 markings, 353436127 edges, 92178 markings/sec, 575 secs
lola: 52833422 markings, 356512802 edges, 91323 markings/sec, 580 secs
lola: 53283004 markings, 359599275 edges, 89916 markings/sec, 585 secs
lola: 53743037 markings, 362739578 edges, 92007 markings/sec, 590 secs
lola: 54193449 markings, 365821457 edges, 90082 markings/sec, 595 secs
lola: 54648913 markings, 368958848 edges, 91093 markings/sec, 600 secs
lola: 55094102 markings, 372049679 edges, 89038 markings/sec, 605 secs
lola: 55561357 markings, 375238457 edges, 93451 markings/sec, 610 secs
lola: 56002426 markings, 378400728 edges, 88214 markings/sec, 615 secs
lola: 56479599 markings, 381449801 edges, 95435 markings/sec, 620 secs
lola: 56924273 markings, 384400671 edges, 88935 markings/sec, 625 secs
lola: 57368706 markings, 387471237 edges, 88887 markings/sec, 630 secs
lola: 57821247 markings, 390494179 edges, 90508 markings/sec, 635 secs
lola: 58271875 markings, 393454835 edges, 90126 markings/sec, 640 secs
lola: 58720834 markings, 396551613 edges, 89792 markings/sec, 645 secs
lola: 59161574 markings, 399668046 edges, 88148 markings/sec, 650 secs
lola: 59630281 markings, 402660492 edges, 93741 markings/sec, 655 secs
lola: 60077916 markings, 405704865 edges, 89527 markings/sec, 660 secs
lola: 60529612 markings, 408845090 edges, 90339 markings/sec, 665 secs
lola: 60975491 markings, 412013983 edges, 89176 markings/sec, 670 secs
lola: 61441522 markings, 414970093 edges, 93206 markings/sec, 675 secs
lola: 61895501 markings, 418074410 edges, 90796 markings/sec, 680 secs
lola: 62349453 markings, 421257618 edges, 90790 markings/sec, 685 secs
lola: 62802584 markings, 424478586 edges, 90626 markings/sec, 690 secs
lola: 63269842 markings, 427510074 edges, 93452 markings/sec, 695 secs
lola: 63725728 markings, 430593443 edges, 91177 markings/sec, 700 secs
lola: 64181282 markings, 433781499 edges, 91111 markings/sec, 705 secs
lola: 64641111 markings, 437031862 edges, 91966 markings/sec, 710 secs
lola: 65097969 markings, 440314486 edges, 91372 markings/sec, 715 secs
lola: 65569384 markings, 443307623 edges, 94283 markings/sec, 720 secs
lola: 66024639 markings, 446426509 edges, 91051 markings/sec, 725 secs
lola: 66481525 markings, 449660549 edges, 91377 markings/sec, 730 secs
lola: 66942257 markings, 452935064 edges, 92146 markings/sec, 735 secs
lola: 67398038 markings, 456207041 edges, 91156 markings/sec, 740 secs
lola: 67871251 markings, 459289179 edges, 94643 markings/sec, 745 secs
lola: 68328684 markings, 462396460 edges, 91487 markings/sec, 750 secs
lola: 68789329 markings, 465592868 edges, 92129 markings/sec, 755 secs
lola: 69248312 markings, 468855336 edges, 91797 markings/sec, 760 secs
lola: 69706453 markings, 472172115 edges, 91628 markings/sec, 765 secs
lola: 70160932 markings, 475442025 edges, 90896 markings/sec, 770 secs
lola: 70634564 markings, 478499744 edges, 94726 markings/sec, 775 secs
lola: 71092753 markings, 481652130 edges, 91638 markings/sec, 780 secs
lola: 71549678 markings, 484855785 edges, 91385 markings/sec, 785 secs
lola: 72006488 markings, 488118777 edges, 91362 markings/sec, 790 secs
lola: 72466159 markings, 491426870 edges, 91934 markings/sec, 795 secs
lola: 72916881 markings, 494698986 edges, 90144 markings/sec, 800 secs
lola: 73394085 markings, 497848697 edges, 95441 markings/sec, 805 secs
lola: 73889030 markings, 500245218 edges, 98989 markings/sec, 810 secs
lola: 74370818 markings, 502631202 edges, 96358 markings/sec, 815 secs
lola: 74854221 markings, 505046031 edges, 96681 markings/sec, 820 secs
lola: 75340551 markings, 507525950 edges, 97266 markings/sec, 825 secs
lola: 75831620 markings, 510004756 edges, 98214 markings/sec, 830 secs
lola: 76317275 markings, 512471686 edges, 97131 markings/sec, 835 secs
lola: 76790489 markings, 514881459 edges, 94643 markings/sec, 840 secs
lola: 77270892 markings, 517343918 edges, 96081 markings/sec, 845 secs
lola: 77751641 markings, 519841841 edges, 96150 markings/sec, 850 secs
lola: 78236760 markings, 522339684 edges, 97024 markings/sec, 855 secs
lola: 78725910 markings, 524865850 edges, 97830 markings/sec, 860 secs
lola: 79222540 markings, 527475165 edges, 99326 markings/sec, 865 secs
lola: 79712973 markings, 530036214 edges, 98087 markings/sec, 870 secs
lola: 80209252 markings, 532636250 edges, 99256 markings/sec, 875 secs
lola: 80704682 markings, 535266372 edges, 99086 markings/sec, 880 secs
lola: 81200202 markings, 537868568 edges, 99104 markings/sec, 885 secs
lola: 81690069 markings, 540485916 edges, 97973 markings/sec, 890 secs
lola: 82192696 markings, 543292129 edges, 100525 markings/sec, 895 secs
lola: 82658637 markings, 546459101 edges, 93188 markings/sec, 900 secs
lola: 83117116 markings, 549698014 edges, 91696 markings/sec, 905 secs
lola: 83579932 markings, 553001402 edges, 92563 markings/sec, 910 secs
lola: 84049130 markings, 556389468 edges, 93840 markings/sec, 915 secs
lola: 84509515 markings, 559723729 edges, 92077 markings/sec, 920 secs
lola: 84979543 markings, 562869785 edges, 94006 markings/sec, 925 secs
lola: 85478424 markings, 565527411 edges, 99776 markings/sec, 930 secs
lola: 85976878 markings, 568495848 edges, 99691 markings/sec, 935 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: 86400162 markings, 571344827 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no yes yes no no yes no no yes no
lola:
preliminary result: no no no yes yes yes no yes yes no no yes no no yes no
lola: memory consumption: 89504 KB
lola: time consumption: 1390 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589307598983

--------------------
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="win2019"
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-4028"
echo " Executing tool win2019"
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 r030-oct2-158897741200087"
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" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;