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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 9.8K Feb 9 07:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 9 07:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 216K Feb 5 04:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 621K Feb 5 04:48 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 4.2K Feb 4 22:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 54K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 160K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 2 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 2 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 168K Jan 29 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 486K Jan 29 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.0K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 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-V20P10N50-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552526199584

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V20P10N50 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1561
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V20P10N50

{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Mar 14 01:16:39 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": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"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 ((SUR_PONT_B <= ROUTE_B)))",
"processed_size": 31,
"rewrites": 11
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 298
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((ROUTE_B <= SUR_PONT_A)))",
"processed_size": 31,
"rewrites": 10
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"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_B_18 <= NB_ATTENTE_A_10)))",
"processed_size": 44,
"rewrites": 11
},
"result":
{
"edges": 63,
"markings": 64,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 372
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "E (F ((CAPACITE <= CHOIX_1 + CHOIX_2)))",
"processed_size": 39,
"rewrites": 10
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 426
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((CONTROLEUR_1 + CONTROLEUR_2 <= CAPACITE)))",
"processed_size": 49,
"rewrites": 11
},
"result":
{
"edges": 31,
"markings": 32,
"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": 497
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "E (F (((ROUTE_A <= ATTENTE_B) AND (ROUTE_B <= 1))))",
"processed_size": 51,
"rewrites": 10
},
"result":
{
"edges": 39,
"markings": 40,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 596
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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 (G (((SUR_PONT_A <= ROUTE_A) OR (ATTENTE_A <= 0) OR (3 <= CAPACITE))))",
"processed_size": 74,
"rewrites": 11
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 745
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (G (((COMPTEUR_22 <= NB_ATTENTE_A_13) AND (COMPTEUR_21 <= COMPTEUR_41))))",
"processed_size": 75,
"rewrites": 11
},
"result":
{
"edges": 71,
"markings": 72,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 994
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= NB_ATTENTE_B_4)) AND ((ROUTE_B + 1 <= NB_ATTENTE_A_15) OR (NB_ATTENTE_A_18 + 1 <= COMPTEUR_6)))))",
"processed_size": 112,
"rewrites": 10
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1491
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((COMPTEUR_29 <= NB_ATTENTE_A_9) OR (COMPTEUR_50 <= COMPTEUR_37) OR (NB_ATTENTE_B_4 + 1 <= COMPTEUR_25) OR (COMPTEUR_28 <= NB_ATTENTE_A_9))))",
"processed_size": 150,
"rewrites": 11
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2981
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((COMPTEUR_26 <= NB_ATTENTE_B_11) OR (COMPTEUR_12 <= NB_ATTENTE_A_18) OR ((VIDANGE_2 <= NB_ATTENTE_A_15) AND (1 <= ROUTE_A)))))",
"processed_size": 135,
"rewrites": 11
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((1 <= COMPTEUR_47)))",
"processed_size": 26,
"rewrites": 10
},
"result":
{
"edges": 25747861,
"markings": 8383114,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"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 ((COMPTEUR_33 <= ROUTE_A)))",
"processed_size": 32,
"rewrites": 11
},
"result":
{
"edges": 30660815,
"markings": 8902723,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"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":
{
"error": null,
"memory": 72804,
"runtime": 2008.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : FALSE : A(G(**)) : E(F(**)) : A(G(**)) : FALSE : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : FALSE : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "yes no yes no no yes no no no yes no yes yes no yes no ",
"value": "yes no yes no no yes no no no yes no yes yes 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 ReachabilityCardinality.xml
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 <= ATTENTE_A)
lola: after: (1 <= ATTENTE_A)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= 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: (2 <= 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 <= 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: (1 <= 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: (0 <= 0)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_18)
lola: LP says that atomic proposition is always false: (2 <= COMPTEUR_2)
lola: LP says that atomic proposition is always false: (2 <= COMPTEUR_10)
lola: E (F ((CAPACITE <= CHOIX_1 + CHOIX_2))) : A (G (((SUR_PONT_A <= ROUTE_A) OR (ATTENTE_A <= 0) OR (3 <= CAPACITE)))) : E (F (((ROUTE_A <= ATTENTE_B) AND (ROUTE_B <= 1)))) : E (F (())) : A (G ((CONTROLEUR_1 + CONTROLEUR_2 <= CAPACITE))) : E (F ((ROUTE_B <= SUR_PONT_A))) : A (G ((SUR_PONT_B <= ROUTE_B))) : E (F ((1 <= 0))) : A (G (((COMPTEUR_22 <= NB_ATTENTE_A_13) AND (COMPTEUR_21 <= COMPTEUR_41)))) : E (F ((((1 <= NB_ATTENTE_B_4)) AND ((ROUTE_B + 1 <= NB_ATTENTE_A_15) OR (NB_ATTENTE_A_18 + 1 <= COMPTEUR_6))))) : E (F ((1 <= COMPTEUR_47))) : A (G (((COMPTEUR_26 <= NB_ATTENTE_B_11) OR (COMPTEUR_12 <= NB_ATTENTE_A_18) OR ((VIDANGE_2 <= NB_ATTENTE_A_15) AND (1 <= ROUTE_A))))) : A (G ((COMPTEUR_33 <= ROUTE_A))) : E (F ((2 <= COMPTEUR_10))) : A (G (((COMPTEUR_29 <= NB_ATTENTE_A_9) OR (COMPTEUR_50 <= COMPTEUR_37) OR (NB_ATTENTE_B_4 + 1 <= COMPTEUR_25) OR (COMPTEUR_28 <= NB_ATTENTE_A_9)))) : A (G ((NB_ATTENTE_B_18 <= NB_ATTENTE_A_10)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: 9 rewrites
lola: closed formula file ReachabilityCardinality.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 236 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: 9 rewrites
lola: closed formula file ReachabilityCardinality.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: subprocess 2 will run for 253 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: 9 rewrites
lola: closed formula file ReachabilityCardinality.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: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= COMPTEUR_47)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= COMPTEUR_47)))
lola: processed formula length: 26
lola: 10 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= COMPTEUR_47)
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 ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 67170 markings, 172114 edges, 13434 markings/sec, 0 secs
lola: sara is running 5 secs || 131671 markings, 344541 edges, 12900 markings/sec, 5 secs
lola: sara is running 10 secs || 194602 markings, 515816 edges, 12586 markings/sec, 10 secs
lola: sara is running 15 secs || 257358 markings, 683908 edges, 12551 markings/sec, 15 secs
lola: sara is running 20 secs || 319877 markings, 859874 edges, 12504 markings/sec, 20 secs
lola: sara is running 25 secs || 382725 markings, 1029418 edges, 12570 markings/sec, 25 secs
lola: sara is running 30 secs || 442911 markings, 1204690 edges, 12037 markings/sec, 30 secs
lola: sara is running 35 secs || 507333 markings, 1379340 edges, 12884 markings/sec, 35 secs
lola: sara is running 40 secs || 568543 markings, 1552796 edges, 12242 markings/sec, 40 secs
lola: sara is running 45 secs || 630958 markings, 1736158 edges, 12483 markings/sec, 45 secs
lola: sara is running 50 secs || 695443 markings, 1911579 edges, 12897 markings/sec, 50 secs
lola: sara is running 55 secs || 758006 markings, 2083553 edges, 12513 markings/sec, 55 secs
lola: sara is running 60 secs || 815974 markings, 2271268 edges, 11594 markings/sec, 60 secs
lola: sara is running 65 secs || 882109 markings, 2453124 edges, 13227 markings/sec, 65 secs
lola: sara is running 70 secs || 946513 markings, 2626177 edges, 12881 markings/sec, 70 secs
lola: sara is running 75 secs || 1009504 markings, 2813569 edges, 12598 markings/sec, 75 secs
lola: sara is running 80 secs || 1067729 markings, 3003855 edges, 11645 markings/sec, 80 secs
lola: sara is running 85 secs || 1132584 markings, 3184428 edges, 12971 markings/sec, 85 secs
lola: sara is running 90 secs || 1197253 markings, 3360472 edges, 12934 markings/sec, 90 secs
lola: sara is running 95 secs || 1260017 markings, 3532091 edges, 12553 markings/sec, 95 secs
lola: sara is running 100 secs || 1321510 markings, 3734549 edges, 12299 markings/sec, 100 secs
lola: sara is running 105 secs || 1379442 markings, 3924695 edges, 11586 markings/sec, 105 secs
lola: sara is running 110 secs || 1445046 markings, 4105543 edges, 13121 markings/sec, 110 secs
lola: sara is running 115 secs || 1509164 markings, 4280500 edges, 12824 markings/sec, 115 secs
lola: sara is running 120 secs || 1575445 markings, 4462019 edges, 13256 markings/sec, 120 secs
lola: sara is running 125 secs || 1640829 markings, 4670828 edges, 13077 markings/sec, 125 secs
lola: sara is running 130 secs || 1702288 markings, 4880969 edges, 12292 markings/sec, 130 secs
lola: sara is running 135 secs || 1764861 markings, 5070161 edges, 12515 markings/sec, 135 secs
lola: sara is running 140 secs || 1833750 markings, 5259619 edges, 13778 markings/sec, 140 secs
lola: sara is running 145 secs || 1901516 markings, 5443410 edges, 13553 markings/sec, 145 secs
lola: sara is running 150 secs || 1970937 markings, 5633872 edges, 13884 markings/sec, 150 secs
lola: sara is running 155 secs || 2039115 markings, 5867580 edges, 13636 markings/sec, 155 secs
lola: sara is running 160 secs || 2103320 markings, 6088642 edges, 12841 markings/sec, 160 secs
lola: sara is running 165 secs || 2163783 markings, 6280000 edges, 12093 markings/sec, 165 secs
lola: sara is running 170 secs || 2232912 markings, 6470396 edges, 13826 markings/sec, 170 secs
lola: sara is running 175 secs || 2299100 markings, 6651322 edges, 13238 markings/sec, 175 secs
lola: sara is running 180 secs || 2361868 markings, 6817863 edges, 12554 markings/sec, 180 secs
lola: sara is running 185 secs || 2430261 markings, 7020137 edges, 13679 markings/sec, 185 secs
lola: sara is running 190 secs || 2493258 markings, 7241768 edges, 12599 markings/sec, 190 secs
lola: sara is running 195 secs || 2557587 markings, 7467498 edges, 12866 markings/sec, 195 secs
lola: sara is running 200 secs || 2615767 markings, 7661136 edges, 11636 markings/sec, 200 secs
lola: sara is running 205 secs || 2680551 markings, 7845515 edges, 12957 markings/sec, 205 secs
lola: sara is running 210 secs || 2747324 markings, 8029105 edges, 13355 markings/sec, 210 secs
lola: sara is running 215 secs || 2812972 markings, 8207412 edges, 13130 markings/sec, 215 secs
lola: sara is running 220 secs || 2878214 markings, 8386256 edges, 13048 markings/sec, 220 secs
lola: sara is running 225 secs || 2943653 markings, 8590614 edges, 13088 markings/sec, 225 secs
lola: sara is running 230 secs || 3009270 markings, 8821741 edges, 13123 markings/sec, 230 secs
lola: sara is running 235 secs || 3074160 markings, 9049991 edges, 12978 markings/sec, 235 secs
lola: sara is running 240 secs || 3136311 markings, 9262444 edges, 12430 markings/sec, 240 secs
lola: sara is running 245 secs || 3197583 markings, 9446540 edges, 12254 markings/sec, 245 secs
lola: sara is running 250 secs || 3263248 markings, 9627566 edges, 13133 markings/sec, 250 secs
lola: sara is running 255 secs || 3326317 markings, 9800464 edges, 12614 markings/sec, 255 secs
lola: sara is running 260 secs || 3387089 markings, 9964348 edges, 12154 markings/sec, 260 secs
lola: sara is running 265 secs || 3457454 markings, 10157263 edges, 14073 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown no unknown unknown unknown unknown unknown no unknown unknown
lola: memory consumption: 250624 KB
lola: time consumption: 289 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((SUR_PONT_B <= ROUTE_B)))
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 ((SUR_PONT_B <= ROUTE_B)))
lola: processed formula length: 31
lola: 11 rewrites
lola: closed formula file ReachabilityCardinality.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: (ROUTE_B + 1 <= SUR_PONT_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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_33 <= ROUTE_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 ((COMPTEUR_33 <= ROUTE_A)))
lola: processed formula length: 32
lola: 11 rewrites
lola: closed formula file ReachabilityCardinality.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: (ROUTE_A + 1 <= COMPTEUR_33)
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 ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 63123 markings, 177118 edges, 12625 markings/sec, 0 secs
lola: sara is running 5 secs || 118855 markings, 351863 edges, 11146 markings/sec, 5 secs
lola: sara is running 10 secs || 171912 markings, 527193 edges, 10611 markings/sec, 10 secs
sara: warning, failure of lp_solve (at job 1028)
lola: sara is running 15 secs || 228155 markings, 708561 edges, 11249 markings/sec, 15 secs
lola: sara is running 20 secs || 282089 markings, 886936 edges, 10787 markings/sec, 20 secs
lola: sara is running 25 secs || 339125 markings, 1071537 edges, 11407 markings/sec, 25 secs
lola: sara is running 30 secs || 391878 markings, 1249689 edges, 10551 markings/sec, 30 secs
lola: sara is running 35 secs || 448256 markings, 1429812 edges, 11276 markings/sec, 35 secs
lola: sara is running 40 secs || 504146 markings, 1620830 edges, 11178 markings/sec, 40 secs
lola: sara is running 45 secs || 558191 markings, 1804819 edges, 10809 markings/sec, 45 secs
lola: sara is running 50 secs || 614946 markings, 1984028 edges, 11351 markings/sec, 50 secs
lola: sara is running 55 secs || 672841 markings, 2181493 edges, 11579 markings/sec, 55 secs
lola: sara is running 60 secs || 726368 markings, 2368433 edges, 10705 markings/sec, 60 secs
lola: sara is running 65 secs || 779023 markings, 2544720 edges, 10531 markings/sec, 65 secs
lola: sara is running 70 secs || 838561 markings, 2734517 edges, 11908 markings/sec, 70 secs
lola: sara is running 75 secs || 897428 markings, 2934550 edges, 11773 markings/sec, 75 secs
lola: sara is running 80 secs || 952126 markings, 3128423 edges, 10940 markings/sec, 80 secs
lola: sara is running 85 secs || 1007430 markings, 3317944 edges, 11061 markings/sec, 85 secs
lola: sara is running 90 secs || 1063700 markings, 3492735 edges, 11254 markings/sec, 90 secs
lola: sara is running 95 secs || 1122795 markings, 3697067 edges, 11819 markings/sec, 95 secs
lola: sara is running 100 secs || 1181661 markings, 3897426 edges, 11773 markings/sec, 100 secs
lola: sara is running 105 secs || 1237485 markings, 4093509 edges, 11165 markings/sec, 105 secs
lola: sara is running 110 secs || 1294098 markings, 4289445 edges, 11323 markings/sec, 110 secs
lola: sara is running 115 secs || 1353790 markings, 4478218 edges, 11938 markings/sec, 115 secs
lola: sara is running 120 secs || 1419097 markings, 4699875 edges, 13061 markings/sec, 120 secs
lola: sara is running 125 secs || 1482471 markings, 4919584 edges, 12675 markings/sec, 125 secs
lola: sara is running 130 secs || 1542016 markings, 5127130 edges, 11909 markings/sec, 130 secs
lola: sara is running 135 secs || 1596582 markings, 5317710 edges, 10913 markings/sec, 135 secs
lola: sara is running 140 secs || 1649475 markings, 5498751 edges, 10579 markings/sec, 140 secs
lola: sara is running 145 secs || 1709399 markings, 5678316 edges, 11985 markings/sec, 145 secs
lola: sara is running 150 secs || 1776061 markings, 5912094 edges, 13332 markings/sec, 150 secs
lola: sara is running 155 secs || 1840441 markings, 6139593 edges, 12876 markings/sec, 155 secs
lola: sara is running 160 secs || 1904411 markings, 6360111 edges, 12794 markings/sec, 160 secs
lola: sara is running 165 secs || 1963672 markings, 6567668 edges, 11852 markings/sec, 165 secs
lola: sara is running 170 secs || 2021600 markings, 6769979 edges, 11586 markings/sec, 170 secs
lola: sara is running 175 secs || 2078342 markings, 6957317 edges, 11348 markings/sec, 175 secs
lola: sara is running 180 secs || 2145820 markings, 7168279 edges, 13496 markings/sec, 180 secs
lola: sara is running 185 secs || 2209194 markings, 7394851 edges, 12675 markings/sec, 185 secs
lola: sara is running 190 secs || 2274045 markings, 7621770 edges, 12970 markings/sec, 190 secs
lola: sara is running 195 secs || 2336737 markings, 7835680 edges, 12538 markings/sec, 195 secs
lola: sara is running 200 secs || 2395850 markings, 8045304 edges, 11823 markings/sec, 200 secs
lola: sara is running 205 secs || 2453638 markings, 8247572 edges, 11558 markings/sec, 205 secs
lola: sara is running 210 secs || 2509124 markings, 8437176 edges, 11097 markings/sec, 210 secs
lola: sara is running 215 secs || 2570943 markings, 8619113 edges, 12364 markings/sec, 215 secs
lola: sara is running 220 secs || 2634741 markings, 8845836 edges, 12760 markings/sec, 220 secs
lola: sara is running 225 secs || 2695010 markings, 9063186 edges, 12054 markings/sec, 225 secs
lola: sara is running 230 secs || 2757490 markings, 9280381 edges, 12496 markings/sec, 230 secs
lola: sara is running 235 secs || 2820248 markings, 9493295 edges, 12552 markings/sec, 235 secs
lola: sara is running 240 secs || 2875813 markings, 9690141 edges, 11113 markings/sec, 240 secs
lola: sara is running 245 secs || 2930199 markings, 9882414 edges, 10877 markings/sec, 245 secs
lola: sara is running 250 secs || 2987173 markings, 10081478 edges, 11395 markings/sec, 250 secs
lola: sara is running 255 secs || 3043818 markings, 10271278 edges, 11329 markings/sec, 255 secs
lola: sara is running 260 secs || 3115536 markings, 10483785 edges, 14344 markings/sec, 260 secs
lola: sara is running 265 secs || 3181660 markings, 10725300 edges, 13225 markings/sec, 265 secs
lola: sara is running 270 secs || 3246784 markings, 10963572 edges, 13025 markings/sec, 270 secs
lola: sara is running 275 secs || 3315316 markings, 11200693 edges, 13706 markings/sec, 275 secs
lola: sara is running 280 secs || 3378427 markings, 11419331 edges, 12622 markings/sec, 280 secs
lola: sara is running 285 secs || 3436922 markings, 11622189 edges, 11699 markings/sec, 285 secs
lola: sara is running 290 secs || 3491933 markings, 11817538 edges, 11002 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown no no unknown unknown unknown unknown unknown no unknown unknown
lola: memory consumption: 252696 KB
lola: time consumption: 587 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((ROUTE_B <= SUR_PONT_A)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((ROUTE_B <= SUR_PONT_A)))
lola: processed formula length: 31
lola: 10 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (ROUTE_B <= SUR_PONT_A)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NB_ATTENTE_B_18 <= NB_ATTENTE_A_10)))
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_B_18 <= NB_ATTENTE_A_10)))
lola: processed formula length: 44
lola: 11 rewrites
lola: closed formula file ReachabilityCardinality.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: (NB_ATTENTE_A_10 + 1 <= NB_ATTENTE_B_18)
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: 64 markings, 63 edges
lola: ========================================
lola: subprocess 8 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((CAPACITE <= CHOIX_1 + CHOIX_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((CAPACITE <= CHOIX_1 + CHOIX_2)))
lola: processed formula length: 39
lola: 10 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CAPACITE <= CHOIX_1 + CHOIX_2)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((CONTROLEUR_1 + CONTROLEUR_2 <= CAPACITE)))
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 ((CONTROLEUR_1 + CONTROLEUR_2 <= CAPACITE)))
lola: processed formula length: 49
lola: 11 rewrites
lola: closed formula file ReachabilityCardinality.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: (CAPACITE + 1 <= CONTROLEUR_1 + CONTROLEUR_2)
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: 32 markings, 31 edges
lola: ========================================
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ROUTE_A <= ATTENTE_B) AND (ROUTE_B <= 1))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((ROUTE_A <= ATTENTE_B) AND (ROUTE_B <= 1))))
lola: processed formula length: 51
lola: 10 rewrites
lola: closed formula file ReachabilityCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 11 will run for 596 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((SUR_PONT_A <= ROUTE_A) OR (ATTENTE_A <= 0) OR (3 <= CAPACITE))))
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 (((SUR_PONT_A <= ROUTE_A) OR (ATTENTE_A <= 0) OR (3 <= CAPACITE))))
lola: processed formula length: 74
lola: 11 rewrites
lola: closed formula file ReachabilityCardinality.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: ((ROUTE_A + 1 <= SUR_PONT_A) AND (1 <= ATTENTE_A) AND (CAPACITE <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 12 will run for 745 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((COMPTEUR_22 <= NB_ATTENTE_A_13) AND (COMPTEUR_21 <= COMPTEUR_41))))
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 (((COMPTEUR_22 <= NB_ATTENTE_A_13) AND (COMPTEUR_21 <= COMPTEUR_41))))
lola: processed formula length: 75
lola: 11 rewrites
lola: closed formula file ReachabilityCardinality.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: ((NB_ATTENTE_A_13 + 1 <= COMPTEUR_22) OR (COMPTEUR_41 + 1 <= COMPTEUR_21))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 72 markings, 71 edges
lola: ========================================
lola: subprocess 13 will run for 994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= NB_ATTENTE_B_4)) AND ((ROUTE_B + 1 <= NB_ATTENTE_A_15) OR (NB_ATTENTE_A_18 + 1 <= COMPTEUR_6)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= NB_ATTENTE_B_4)) AND ((ROUTE_B + 1 <= NB_ATTENTE_A_15) OR (NB_ATTENTE_A_18 + 1 <= COMPTEUR_6)))))
lola: processed formula length: 112
lola: 10 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= NB_ATTENTE_B_4)) AND ((ROUTE_B + 1 <= NB_ATTENTE_A_15) OR (NB_ATTENTE_A_18 + 1 <= COMPTEUR_6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 14 will run for 1491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((COMPTEUR_29 <= NB_ATTENTE_A_9) OR (COMPTEUR_50 <= COMPTEUR_37) OR (NB_ATTENTE_B_4 + 1 <= COMPTEUR_25) OR (COMPTEUR_28 <= NB_ATTENTE_A_9))))
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 (((COMPTEUR_29 <= NB_ATTENTE_A_9) OR (COMPTEUR_50 <= COMPTEUR_37) OR (NB_ATTENTE_B_4 + 1 <= COMPTEUR_25) OR (COMPTEUR_28 <= NB_ATTENTE_A_9))))
lola: processed formula length: 150
lola: 11 rewrites
lola: closed formula file ReachabilityCardinality.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: ((NB_ATTENTE_A_9 + 1 <= COMPTEUR_29) AND (COMPTEUR_37 + 1 <= COMPTEUR_50) AND (COMPTEUR_25 <= NB_ATTENTE_B_4) AND (NB_ATTENTE_A_9 + 1 <= COMPTEUR_28))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2981 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((COMPTEUR_26 <= NB_ATTENTE_B_11) OR (COMPTEUR_12 <= NB_ATTENTE_A_18) OR ((VIDANGE_2 <= NB_ATTENTE_A_15) AND (1 <= ROUTE_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 (((COMPTEUR_26 <= NB_ATTENTE_B_11) OR (COMPTEUR_12 <= NB_ATTENTE_A_18) OR ((VIDANGE_2 <= NB_ATTENTE_A_15) AND (1 <= ROUTE_A)))))
lola: processed formula length: 135
lola: 11 rewrites
lola: closed formula file ReachabilityCardinality.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: ((NB_ATTENTE_B_11 + 1 <= COMPTEUR_26) AND (NB_ATTENTE_A_18 + 1 <= COMPTEUR_12) AND ((NB_ATTENTE_A_15 + 1 <= VIDANGE_2) OR (ROUTE_A <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= COMPTEUR_47)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= COMPTEUR_47)))
lola: processed formula length: 26
lola: 10 rewrites
lola: closed formula file ReachabilityCardinality.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= COMPTEUR_47)
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 ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 71837 markings, 183748 edges, 14367 markings/sec, 0 secs
lola: sara is running 5 secs || 141289 markings, 369127 edges, 13890 markings/sec, 5 secs
lola: sara is running 10 secs || 211019 markings, 560108 edges, 13946 markings/sec, 10 secs
lola: sara is running 15 secs || 277571 markings, 743816 edges, 13310 markings/sec, 15 secs
lola: sara is running 20 secs || 346186 markings, 930764 edges, 13723 markings/sec, 20 secs
lola: sara is running 25 secs || 408105 markings, 1104979 edges, 12384 markings/sec, 25 secs
lola: sara is running 30 secs || 471926 markings, 1283769 edges, 12764 markings/sec, 30 secs
lola: sara is running 35 secs || 534055 markings, 1449747 edges, 12426 markings/sec, 35 secs
lola: sara is running 40 secs || 593011 markings, 1630109 edges, 11791 markings/sec, 40 secs
lola: sara is running 45 secs || 655795 markings, 1804219 edges, 12557 markings/sec, 45 secs
lola: sara is running 50 secs || 716610 markings, 1967128 edges, 12163 markings/sec, 50 secs
lola: sara is running 55 secs || 782559 markings, 2167071 edges, 13190 markings/sec, 55 secs
lola: sara is running 60 secs || 848704 markings, 2361575 edges, 13229 markings/sec, 60 secs
lola: sara is running 65 secs || 918048 markings, 2550762 edges, 13869 markings/sec, 65 secs
lola: sara is running 70 secs || 984069 markings, 2730375 edges, 13204 markings/sec, 70 secs
lola: sara is running 75 secs || 1047470 markings, 2939204 edges, 12680 markings/sec, 75 secs
lola: sara is running 80 secs || 1112421 markings, 3129035 edges, 12990 markings/sec, 80 secs
lola: sara is running 85 secs || 1179197 markings, 3311679 edges, 13355 markings/sec, 85 secs
lola: sara is running 90 secs || 1244565 markings, 3490124 edges, 13074 markings/sec, 90 secs
lola: sara is running 95 secs || 1309117 markings, 3693459 edges, 12910 markings/sec, 95 secs
lola: sara is running 100 secs || 1370476 markings, 3897298 edges, 12272 markings/sec, 100 secs
lola: sara is running 105 secs || 1438882 markings, 4089029 edges, 13681 markings/sec, 105 secs
lola: sara is running 110 secs || 1505120 markings, 4269750 edges, 13248 markings/sec, 110 secs
lola: sara is running 115 secs || 1566921 markings, 4438744 edges, 12360 markings/sec, 115 secs
lola: sara is running 120 secs || 1629959 markings, 4632302 edges, 12608 markings/sec, 120 secs
lola: sara is running 125 secs || 1689745 markings, 4839611 edges, 11957 markings/sec, 125 secs
lola: sara is running 130 secs || 1747587 markings, 5022860 edges, 11568 markings/sec, 130 secs
lola: sara is running 135 secs || 1813135 markings, 5203065 edges, 13110 markings/sec, 135 secs
lola: sara is running 140 secs || 1877318 markings, 5378339 edges, 12837 markings/sec, 140 secs
lola: sara is running 145 secs || 1939847 markings, 5549360 edges, 12506 markings/sec, 145 secs
lola: sara is running 150 secs || 2008912 markings, 5761588 edges, 13813 markings/sec, 150 secs
lola: sara is running 155 secs || 2070558 markings, 5976190 edges, 12329 markings/sec, 155 secs
lola: sara is running 160 secs || 2131363 markings, 6181311 edges, 12161 markings/sec, 160 secs
lola: sara is running 165 secs || 2195080 markings, 6366560 edges, 12743 markings/sec, 165 secs
lola: sara is running 170 secs || 2261019 markings, 6547475 edges, 13188 markings/sec, 170 secs
lola: sara is running 175 secs || 2324627 markings, 6720169 edges, 12722 markings/sec, 175 secs
lola: sara is running 180 secs || 2387033 markings, 6891646 edges, 12481 markings/sec, 180 secs
lola: sara is running 185 secs || 2452090 markings, 7098703 edges, 13011 markings/sec, 185 secs
lola: sara is running 190 secs || 2514149 markings, 7317501 edges, 12412 markings/sec, 190 secs
lola: sara is running 195 secs || 2575994 markings, 7530067 edges, 12369 markings/sec, 195 secs
lola: sara is running 200 secs || 2634870 markings, 7719852 edges, 11775 markings/sec, 200 secs
lola: sara is running 205 secs || 2702538 markings, 7906269 edges, 13534 markings/sec, 205 secs
lola: sara is running 210 secs || 2767231 markings, 8083512 edges, 12939 markings/sec, 210 secs
lola: sara is running 215 secs || 2828474 markings, 8248827 edges, 12249 markings/sec, 215 secs
lola: sara is running 220 secs || 2895466 markings, 8432962 edges, 13398 markings/sec, 220 secs
lola: sara is running 225 secs || 2960093 markings, 8646579 edges, 12925 markings/sec, 225 secs
lola: sara is running 230 secs || 3025761 markings, 8881466 edges, 13134 markings/sec, 230 secs
lola: sara is running 235 secs || 3087676 markings, 9096743 edges, 12383 markings/sec, 235 secs
lola: sara is running 240 secs || 3149488 markings, 9305567 edges, 12362 markings/sec, 240 secs
lola: sara is running 245 secs || 3214780 markings, 9494083 edges, 13058 markings/sec, 245 secs
lola: sara is running 250 secs || 3283498 markings, 9683330 edges, 13744 markings/sec, 250 secs
lola: sara is running 255 secs || 3349690 markings, 9863871 edges, 13238 markings/sec, 255 secs
lola: sara is running 260 secs || 3408761 markings, 10019907 edges, 11814 markings/sec, 260 secs
lola: sara is running 265 secs || 3479436 markings, 10219586 edges, 14135 markings/sec, 265 secs
lola: sara is running 270 secs || 3544148 markings, 10451940 edges, 12942 markings/sec, 270 secs
lola: sara is running 275 secs || 3607818 markings, 10675620 edges, 12734 markings/sec, 275 secs
lola: sara is running 280 secs || 3669535 markings, 10895782 edges, 12343 markings/sec, 280 secs
lola: sara is running 285 secs || 3729398 markings, 11101427 edges, 11973 markings/sec, 285 secs
lola: sara is running 290 secs || 3786912 markings, 11286271 edges, 11503 markings/sec, 290 secs
lola: sara is running 295 secs || 3852772 markings, 11467658 edges, 13172 markings/sec, 295 secs
lola: sara is running 300 secs || 3917668 markings, 11646038 edges, 12979 markings/sec, 300 secs
lola: sara is running 305 secs || 3981685 markings, 11820622 edges, 12803 markings/sec, 305 secs
lola: sara is running 310 secs || 4041235 markings, 11978281 edges, 11910 markings/sec, 310 secs
lola: sara is running 315 secs || 4109780 markings, 12170652 edges, 13709 markings/sec, 315 secs
lola: sara is running 320 secs || 4175320 markings, 12405949 edges, 13108 markings/sec, 320 secs
lola: sara is running 325 secs || 4237469 markings, 12628316 edges, 12430 markings/sec, 325 secs
lola: sara is running 330 secs || 4300878 markings, 12851420 edges, 12682 markings/sec, 330 secs
lola: sara is running 335 secs || 4361339 markings, 13063509 edges, 12092 markings/sec, 335 secs
lola: sara is running 340 secs || 4420290 markings, 13268427 edges, 11790 markings/sec, 340 secs
lola: sara is running 345 secs || 4477768 markings, 13448267 edges, 11496 markings/sec, 345 secs
lola: sara is running 350 secs || 4542586 markings, 13627211 edges, 12964 markings/sec, 350 secs
lola: sara is running 355 secs || 4606123 markings, 13801975 edges, 12707 markings/sec, 355 secs
lola: sara is running 360 secs || 4651614 markings, 13926300 edges, 9098 markings/sec, 360 secs
lola: sara is running 365 secs || 4653831 markings, 13932302 edges, 443 markings/sec, 365 secs
lola: sara is running 370 secs || 4677867 markings, 13997703 edges, 4807 markings/sec, 370 secs
lola: sara is running 375 secs || 4678962 markings, 14000885 edges, 219 markings/sec, 375 secs
lola: sara is running 380 secs || 4686222 markings, 14020066 edges, 1452 markings/sec, 380 secs
lola: sara is running 385 secs || 4725625 markings, 14124422 edges, 7881 markings/sec, 385 secs
lola: sara is running 390 secs || 4795121 markings, 14315371 edges, 13899 markings/sec, 390 secs
lola: sara is running 395 secs || 4864152 markings, 14549920 edges, 13806 markings/sec, 395 secs
lola: sara is running 400 secs || 4930032 markings, 14783007 edges, 13176 markings/sec, 400 secs
lola: sara is running 405 secs || 4993671 markings, 15011115 edges, 12728 markings/sec, 405 secs
lola: sara is running 410 secs || 5056894 markings, 15233342 edges, 12645 markings/sec, 410 secs
lola: sara is running 415 secs || 5118634 markings, 15453414 edges, 12348 markings/sec, 415 secs
lola: sara is running 420 secs || 5181158 markings, 15668596 edges, 12505 markings/sec, 420 secs
lola: sara is running 425 secs || 5242381 markings, 15860935 edges, 12245 markings/sec, 425 secs
lola: sara is running 430 secs || 5311941 markings, 16053133 edges, 13912 markings/sec, 430 secs
lola: sara is running 435 secs || 5380092 markings, 16240639 edges, 13630 markings/sec, 435 secs
lola: sara is running 440 secs || 5446515 markings, 16421847 edges, 13285 markings/sec, 440 secs
lola: sara is running 445 secs || 5508039 markings, 16585432 edges, 12305 markings/sec, 445 secs
lola: sara is running 450 secs || 5580099 markings, 16783260 edges, 14412 markings/sec, 450 secs
lola: sara is running 455 secs || 5650385 markings, 17023820 edges, 14057 markings/sec, 455 secs
lola: sara is running 460 secs || 5719658 markings, 17268694 edges, 13855 markings/sec, 460 secs
lola: sara is running 465 secs || 5788676 markings, 17516837 edges, 13804 markings/sec, 465 secs
lola: sara is running 470 secs || 5855342 markings, 17755465 edges, 13333 markings/sec, 470 secs
lola: sara is running 475 secs || 5922476 markings, 17992245 edges, 13427 markings/sec, 475 secs
lola: sara is running 480 secs || 5985638 markings, 18214025 edges, 12632 markings/sec, 480 secs
lola: sara is running 485 secs || 6047110 markings, 18423495 edges, 12294 markings/sec, 485 secs
lola: sara is running 490 secs || 6107312 markings, 18601825 edges, 12040 markings/sec, 490 secs
lola: sara is running 495 secs || 6173157 markings, 18783471 edges, 13169 markings/sec, 495 secs
lola: sara is running 500 secs || 6237406 markings, 18960435 edges, 12850 markings/sec, 500 secs
lola: sara is running 505 secs || 6300247 markings, 19132076 edges, 12568 markings/sec, 505 secs
lola: sara is running 510 secs || 6359082 markings, 19289641 edges, 11767 markings/sec, 510 secs
lola: sara is running 515 secs || 6426115 markings, 19471788 edges, 13407 markings/sec, 515 secs
lola: sara is running 520 secs || 6495553 markings, 19689559 edges, 13888 markings/sec, 520 secs
lola: sara is running 525 secs || 6564500 markings, 19937116 edges, 13789 markings/sec, 525 secs
lola: sara is running 530 secs || 6633751 markings, 20185994 edges, 13850 markings/sec, 530 secs
lola: sara is running 535 secs || 6699020 markings, 20419163 edges, 13054 markings/sec, 535 secs
lola: sara is running 540 secs || 6762761 markings, 20644043 edges, 12748 markings/sec, 540 secs
lola: sara is running 545 secs || 6826452 markings, 20872134 edges, 12738 markings/sec, 545 secs
lola: sara is running 550 secs || 6888413 markings, 21089951 edges, 12392 markings/sec, 550 secs
lola: sara is running 555 secs || 6947650 markings, 21296586 edges, 11847 markings/sec, 555 secs
lola: sara is running 560 secs || 7005300 markings, 21486763 edges, 11530 markings/sec, 560 secs
lola: sara is running 565 secs || 7070049 markings, 21667745 edges, 12950 markings/sec, 565 secs
lola: sara is running 570 secs || 7135425 markings, 21848027 edges, 13075 markings/sec, 570 secs
lola: sara is running 575 secs || 7198094 markings, 22020119 edges, 12534 markings/sec, 575 secs
lola: sara is running 580 secs || 7261695 markings, 22193463 edges, 12720 markings/sec, 580 secs
lola: sara is running 585 secs || 7319863 markings, 22347894 edges, 11634 markings/sec, 585 secs
lola: sara is running 590 secs || 7390529 markings, 22540423 edges, 14133 markings/sec, 590 secs
lola: sara is running 595 secs || 7459236 markings, 22764288 edges, 13741 markings/sec, 595 secs
lola: sara is running 600 secs || 7524700 markings, 22999278 edges, 13093 markings/sec, 600 secs
lola: sara is running 605 secs || 7591526 markings, 23239114 edges, 13365 markings/sec, 605 secs
lola: sara is running 610 secs || 7661531 markings, 23490439 edges, 14001 markings/sec, 610 secs
lola: sara is running 615 secs || 7729865 markings, 23733903 edges, 13667 markings/sec, 615 secs
lola: sara is running 620 secs || 7797263 markings, 23973330 edges, 13480 markings/sec, 620 secs
lola: sara is running 625 secs || 7864227 markings, 24211200 edges, 13393 markings/sec, 625 secs
lola: sara is running 630 secs || 7928581 markings, 24438811 edges, 12871 markings/sec, 630 secs
lola: sara is running 635 secs || 7989609 markings, 24648783 edges, 12206 markings/sec, 635 secs
lola: sara is running 640 secs || 8049111 markings, 24837581 edges, 11900 markings/sec, 640 secs
lola: sara is running 645 secs || 8115515 markings, 25020833 edges, 13281 markings/sec, 645 secs
lola: sara is running 650 secs || 8180351 markings, 25199548 edges, 12967 markings/sec, 650 secs
lola: sara is running 655 secs || 8245572 markings, 25378471 edges, 13044 markings/sec, 655 secs
lola: sara is running 660 secs || 8307688 markings, 25547531 edges, 12423 markings/sec, 660 secs
lola: sara is running 665 secs || 8365095 markings, 25699428 edges, 11481 markings/sec, 665 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 8383114 markings, 25747861 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_33 <= ROUTE_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 ((COMPTEUR_33 <= ROUTE_A)))
lola: processed formula length: 32
lola: 11 rewrites
lola: closed formula file ReachabilityCardinality.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: (ROUTE_A + 1 <= COMPTEUR_33)
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 ReachabilityCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 61717 markings, 173388 edges, 12343 markings/sec, 0 secs
lola: sara is running 5 secs || 117316 markings, 347757 edges, 11120 markings/sec, 5 secs
lola: sara is running 10 secs || 171567 markings, 525979 edges, 10850 markings/sec, 10 secs
sara: warning, failure of lp_solve (at job 1028)
lola: sara is running 15 secs || 228460 markings, 709336 edges, 11379 markings/sec, 15 secs
lola: sara is running 20 secs || 282223 markings, 887290 edges, 10753 markings/sec, 20 secs
lola: sara is running 25 secs || 339509 markings, 1072983 edges, 11457 markings/sec, 25 secs
lola: sara is running 30 secs || 392948 markings, 1253445 edges, 10688 markings/sec, 30 secs
lola: sara is running 35 secs || 450287 markings, 1436755 edges, 11468 markings/sec, 35 secs
lola: sara is running 40 secs || 506845 markings, 1629235 edges, 11312 markings/sec, 40 secs
lola: sara is running 45 secs || 559975 markings, 1810596 edges, 10626 markings/sec, 45 secs
lola: sara is running 50 secs || 618357 markings, 1995669 edges, 11676 markings/sec, 50 secs
lola: sara is running 55 secs || 678094 markings, 2200665 edges, 11947 markings/sec, 55 secs
lola: sara is running 60 secs || 732249 markings, 2387697 edges, 10831 markings/sec, 60 secs
lola: sara is running 65 secs || 785757 markings, 2566275 edges, 10702 markings/sec, 65 secs
lola: sara is running 70 secs || 846451 markings, 2762514 edges, 12139 markings/sec, 70 secs
lola: sara is running 75 secs || 905715 markings, 2964830 edges, 11853 markings/sec, 75 secs
lola: sara is running 80 secs || 961647 markings, 3160676 edges, 11186 markings/sec, 80 secs
lola: sara is running 85 secs || 1015654 markings, 3344848 edges, 10801 markings/sec, 85 secs
lola: sara is running 90 secs || 1074080 markings, 3524479 edges, 11685 markings/sec, 90 secs
lola: sara is running 95 secs || 1133070 markings, 3732800 edges, 11798 markings/sec, 95 secs
lola: sara is running 100 secs || 1192062 markings, 3935371 edges, 11798 markings/sec, 100 secs
lola: sara is running 105 secs || 1247169 markings, 4127927 edges, 11021 markings/sec, 105 secs
lola: sara is running 110 secs || 1301679 markings, 4315010 edges, 10902 markings/sec, 110 secs
lola: sara is running 115 secs || 1359897 markings, 4494533 edges, 11644 markings/sec, 115 secs
lola: sara is running 120 secs || 1419959 markings, 4702909 edges, 12012 markings/sec, 120 secs
lola: sara is running 125 secs || 1479253 markings, 4909138 edges, 11859 markings/sec, 125 secs
lola: sara is running 130 secs || 1536603 markings, 5107370 edges, 11470 markings/sec, 130 secs
lola: sara is running 135 secs || 1590294 markings, 5295132 edges, 10738 markings/sec, 135 secs
lola: sara is running 140 secs || 1642956 markings, 5476974 edges, 10532 markings/sec, 140 secs
lola: sara is running 145 secs || 1698384 markings, 5649209 edges, 11086 markings/sec, 145 secs
lola: sara is running 150 secs || 1759800 markings, 5857031 edges, 12283 markings/sec, 150 secs
lola: sara is running 155 secs || 1819700 markings, 6067162 edges, 11980 markings/sec, 155 secs
lola: sara is running 160 secs || 1879678 markings, 6269816 edges, 11996 markings/sec, 160 secs
lola: sara is running 165 secs || 1933871 markings, 6463557 edges, 10839 markings/sec, 165 secs
lola: sara is running 170 secs || 1987704 markings, 6652240 edges, 10767 markings/sec, 170 secs
lola: sara is running 175 secs || 2040287 markings, 6833260 edges, 10517 markings/sec, 175 secs
lola: sara is running 180 secs || 2099962 markings, 7016467 edges, 11935 markings/sec, 180 secs
lola: sara is running 185 secs || 2164058 markings, 7234689 edges, 12819 markings/sec, 185 secs
lola: sara is running 190 secs || 2226916 markings, 7456162 edges, 12572 markings/sec, 190 secs
lola: sara is running 195 secs || 2286841 markings, 7665692 edges, 11985 markings/sec, 195 secs
lola: sara is running 200 secs || 2348349 markings, 7878034 edges, 12302 markings/sec, 200 secs
lola: sara is running 205 secs || 2404798 markings, 8077735 edges, 11290 markings/sec, 205 secs
lola: sara is running 210 secs || 2460177 markings, 8270872 edges, 11076 markings/sec, 210 secs
lola: sara is running 215 secs || 2512468 markings, 8447986 edges, 10458 markings/sec, 215 secs
lola: sara is running 220 secs || 2574879 markings, 8629020 edges, 12482 markings/sec, 220 secs
lola: sara is running 225 secs || 2637904 markings, 8857489 edges, 12605 markings/sec, 225 secs
lola: sara is running 230 secs || 2697956 markings, 9073534 edges, 12010 markings/sec, 230 secs
lola: sara is running 235 secs || 2760536 markings, 9290566 edges, 12516 markings/sec, 235 secs
lola: sara is running 240 secs || 2822530 markings, 9501667 edges, 12399 markings/sec, 240 secs
lola: sara is running 245 secs || 2877908 markings, 9697745 edges, 11076 markings/sec, 245 secs
lola: sara is running 250 secs || 2933162 markings, 9893104 edges, 11051 markings/sec, 250 secs
lola: sara is running 255 secs || 2986938 markings, 10080594 edges, 10755 markings/sec, 255 secs
lola: sara is running 260 secs || 3038868 markings, 10255955 edges, 10386 markings/sec, 260 secs
lola: sara is running 265 secs || 3102626 markings, 10437856 edges, 12752 markings/sec, 265 secs
lola: sara is running 270 secs || 3166493 markings, 10671160 edges, 12773 markings/sec, 270 secs
lola: sara is running 275 secs || 3228068 markings, 10895449 edges, 12315 markings/sec, 275 secs
lola: sara is running 280 secs || 3293226 markings, 11122317 edges, 13032 markings/sec, 280 secs
lola: sara is running 285 secs || 3355156 markings, 11340266 edges, 12386 markings/sec, 285 secs
lola: sara is running 290 secs || 3417697 markings, 11552866 edges, 12508 markings/sec, 290 secs
lola: sara is running 295 secs || 3473454 markings, 11750590 edges, 11151 markings/sec, 295 secs
lola: sara is running 300 secs || 3528013 markings, 11944317 edges, 10912 markings/sec, 300 secs
lola: sara is running 305 secs || 3581354 markings, 12130813 edges, 10668 markings/sec, 305 secs
lola: sara is running 310 secs || 3632155 markings, 12300871 edges, 10160 markings/sec, 310 secs
lola: sara is running 315 secs || 3697197 markings, 12485594 edges, 13008 markings/sec, 315 secs
lola: sara is running 320 secs || 3760423 markings, 12714899 edges, 12645 markings/sec, 320 secs
lola: sara is running 325 secs || 3822844 markings, 12942814 edges, 12484 markings/sec, 325 secs
lola: sara is running 330 secs || 3885384 markings, 13171723 edges, 12508 markings/sec, 330 secs
lola: sara is running 335 secs || 3950951 markings, 13397767 edges, 13113 markings/sec, 335 secs
lola: sara is running 340 secs || 4011587 markings, 13608496 edges, 12127 markings/sec, 340 secs
lola: sara is running 345 secs || 4072611 markings, 13817624 edges, 12205 markings/sec, 345 secs
lola: sara is running 350 secs || 4127309 markings, 14011327 edges, 10940 markings/sec, 350 secs
lola: sara is running 355 secs || 4181588 markings, 14205234 edges, 10856 markings/sec, 355 secs
lola: sara is running 360 secs || 4235130 markings, 14391553 edges, 10708 markings/sec, 360 secs
lola: sara is running 365 secs || 4287355 markings, 14569257 edges, 10445 markings/sec, 365 secs
lola: sara is running 370 secs || 4350913 markings, 14756126 edges, 12712 markings/sec, 370 secs
lola: sara is running 375 secs || 4417714 markings, 14980993 edges, 13360 markings/sec, 375 secs
lola: sara is running 380 secs || 4484536 markings, 15227913 edges, 13364 markings/sec, 380 secs
lola: sara is running 385 secs || 4549944 markings, 15466566 edges, 13082 markings/sec, 385 secs
lola: sara is running 390 secs || 4615393 markings, 15705108 edges, 13090 markings/sec, 390 secs
lola: sara is running 395 secs || 4684636 markings, 15942005 edges, 13849 markings/sec, 395 secs
lola: sara is running 400 secs || 4749199 markings, 16164649 edges, 12913 markings/sec, 400 secs
lola: sara is running 405 secs || 4811785 markings, 16382263 edges, 12517 markings/sec, 405 secs
lola: sara is running 410 secs || 4867953 markings, 16580984 edges, 11234 markings/sec, 410 secs
lola: sara is running 415 secs || 4924541 markings, 16781193 edges, 11318 markings/sec, 415 secs
lola: sara is running 420 secs || 4980807 markings, 16978752 edges, 11253 markings/sec, 420 secs
lola: sara is running 425 secs || 5035351 markings, 17162887 edges, 10909 markings/sec, 425 secs
lola: sara is running 430 secs || 5103198 markings, 17358630 edges, 13569 markings/sec, 430 secs
lola: sara is running 435 secs || 5170085 markings, 17588187 edges, 13377 markings/sec, 435 secs
lola: sara is running 440 secs || 5237173 markings, 17835926 edges, 13418 markings/sec, 440 secs
lola: sara is running 445 secs || 5298749 markings, 18062020 edges, 12315 markings/sec, 445 secs
lola: sara is running 450 secs || 5363152 markings, 18297856 edges, 12881 markings/sec, 450 secs
lola: sara is running 455 secs || 5425408 markings, 18522332 edges, 12451 markings/sec, 455 secs
lola: sara is running 460 secs || 5494300 markings, 18757029 edges, 13778 markings/sec, 460 secs
lola: sara is running 465 secs || 5559362 markings, 18980949 edges, 13012 markings/sec, 465 secs
lola: sara is running 470 secs || 5620475 markings, 19193359 edges, 12223 markings/sec, 470 secs
lola: sara is running 475 secs || 5677185 markings, 19394212 edges, 11342 markings/sec, 475 secs
lola: sara is running 480 secs || 5733271 markings, 19594597 edges, 11217 markings/sec, 480 secs
lola: sara is running 485 secs || 5789233 markings, 19790752 edges, 11192 markings/sec, 485 secs
lola: sara is running 490 secs || 5843833 markings, 19978117 edges, 10920 markings/sec, 490 secs
lola: sara is running 495 secs || 5902137 markings, 20157763 edges, 11661 markings/sec, 495 secs
lola: sara is running 500 secs || 5971407 markings, 20367610 edges, 13854 markings/sec, 500 secs
lola: sara is running 505 secs || 6036604 markings, 20606201 edges, 13039 markings/sec, 505 secs
lola: sara is running 510 secs || 6100452 markings, 20839534 edges, 12770 markings/sec, 510 secs
lola: sara is running 515 secs || 6165853 markings, 21081345 edges, 13080 markings/sec, 515 secs
lola: sara is running 520 secs || 6230639 markings, 21319669 edges, 12957 markings/sec, 520 secs
lola: sara is running 525 secs || 6293404 markings, 21547617 edges, 12553 markings/sec, 525 secs
lola: sara is running 530 secs || 6355883 markings, 21765748 edges, 12496 markings/sec, 530 secs
lola: sara is running 535 secs || 6425627 markings, 22004094 edges, 13949 markings/sec, 535 secs
lola: sara is running 540 secs || 6491023 markings, 22223223 edges, 13079 markings/sec, 540 secs
lola: sara is running 545 secs || 6547126 markings, 22424790 edges, 11221 markings/sec, 545 secs
lola: sara is running 550 secs || 6603065 markings, 22625130 edges, 11188 markings/sec, 550 secs
lola: sara is running 555 secs || 6658113 markings, 22819242 edges, 11010 markings/sec, 555 secs
lola: sara is running 560 secs || 6713707 markings, 23014243 edges, 11119 markings/sec, 560 secs
lola: sara is running 565 secs || 6767882 markings, 23198214 edges, 10835 markings/sec, 565 secs
lola: sara is running 570 secs || 6829346 markings, 23380416 edges, 12293 markings/sec, 570 secs
lola: sara is running 575 secs || 6897788 markings, 23595405 edges, 13688 markings/sec, 575 secs
lola: sara is running 580 secs || 6961600 markings, 23827420 edges, 12762 markings/sec, 580 secs
lola: sara is running 585 secs || 7025206 markings, 24061009 edges, 12721 markings/sec, 585 secs
lola: sara is running 590 secs || 7089998 markings, 24300481 edges, 12958 markings/sec, 590 secs
lola: sara is running 595 secs || 7154076 markings, 24537082 edges, 12816 markings/sec, 595 secs
lola: sara is running 600 secs || 7217338 markings, 24769071 edges, 12652 markings/sec, 600 secs
lola: sara is running 605 secs || 7280399 markings, 24998134 edges, 12612 markings/sec, 605 secs
lola: sara is running 610 secs || 7341812 markings, 25212079 edges, 12283 markings/sec, 610 secs
lola: sara is running 615 secs || 7414047 markings, 25457644 edges, 14447 markings/sec, 615 secs
lola: sara is running 620 secs || 7479481 markings, 25676393 edges, 13087 markings/sec, 620 secs
lola: sara is running 625 secs || 7535745 markings, 25878570 edges, 11253 markings/sec, 625 secs
lola: sara is running 630 secs || 7590846 markings, 26075973 edges, 11020 markings/sec, 630 secs
lola: sara is running 635 secs || 7645239 markings, 26268208 edges, 10879 markings/sec, 635 secs
lola: sara is running 640 secs || 7698519 markings, 26456925 edges, 10656 markings/sec, 640 secs
lola: sara is running 645 secs || 7751017 markings, 26637739 edges, 10500 markings/sec, 645 secs
lola: sara is running 650 secs || 7803657 markings, 26808919 edges, 10528 markings/sec, 650 secs
lola: sara is running 655 secs || 7876212 markings, 27005183 edges, 14511 markings/sec, 655 secs
lola: sara is running 660 secs || 7942055 markings, 27245065 edges, 13169 markings/sec, 660 secs
lola: sara is running 665 secs || 8007763 markings, 27486513 edges, 13142 markings/sec, 665 secs
lola: sara is running 670 secs || 8073006 markings, 27726721 edges, 13049 markings/sec, 670 secs
lola: sara is running 675 secs || 8137508 markings, 27964134 edges, 12900 markings/sec, 675 secs
lola: sara is running 680 secs || 8201244 markings, 28197257 edges, 12747 markings/sec, 680 secs
lola: sara is running 685 secs || 8267347 markings, 28441497 edges, 13221 markings/sec, 685 secs
lola: sara is running 690 secs || 8332343 markings, 28680361 edges, 12999 markings/sec, 690 secs
lola: sara is running 695 secs || 8395583 markings, 28906219 edges, 12648 markings/sec, 695 secs
lola: sara is running 700 secs || 8467787 markings, 29148312 edges, 14441 markings/sec, 700 secs
lola: sara is running 705 secs || 8533803 markings, 29373914 edges, 13203 markings/sec, 705 secs
lola: sara is running 710 secs || 8595524 markings, 29588071 edges, 12344 markings/sec, 710 secs
lola: sara is running 715 secs || 8650788 markings, 29786467 edges, 11053 markings/sec, 715 secs
lola: sara is running 720 secs || 8705049 markings, 29978215 edges, 10852 markings/sec, 720 secs
lola: sara is running 725 secs || 8758649 markings, 30168846 edges, 10720 markings/sec, 725 secs
lola: sara is running 730 secs || 8811606 markings, 30354312 edges, 10591 markings/sec, 730 secs
lola: sara is running 735 secs || 8863716 markings, 30533295 edges, 10422 markings/sec, 735 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8902723 markings, 30660815 edges
lola: RESULT
lola:
SUMMARY: yes no yes no no yes no no no yes no yes yes no yes no
lola:
preliminary result: yes no yes no no yes no no no yes no yes yes no yes no
lola: ========================================
lola: memory consumption: 72804 KB
lola: time consumption: 2008 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552528208228

--------------------
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-V20P10N50"
export BK_EXAMINATION="ReachabilityCardinality"
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-V20P10N50, examination is ReachabilityCardinality"
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-155225065700539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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