Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r030-oct2-158897741100049.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is BridgeAndVehicles-COL-V50P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-oct2-158897741100049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 25 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 12:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 12:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 42K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1589300961833

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V50P20N10 @ 3570 seconds

FORMULA BridgeAndVehicles-COL-V50P20N10-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P20N10-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2588
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V50P20N10

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 12 16:29:21 2020
",
"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": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p5 <= 0)",
"processed_size": 9,
"rewrites": 114
},
"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": 114
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 407
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 114
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 465
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 114
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 814
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p2)))",
"processed_size": 17,
"rewrites": 116
},
"result":
{
"edges": 0,
"markings": 0,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3256
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (F (G ((F ((p57 + p58 + 1 <= p60 + p61)) AND (p0 <= 0)))))",
"processed_size": 60,
"rewrites": 114
},
"result":
{
"edges": 424,
"markings": 423,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 97100,
"runtime": 958.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G((* OR X(F(*))))) : A(X((** OR F(**)))) : A((** OR F(G((** OR X(F(**))))))) : A(X(F((* OR X(X(*)))))) : A(F(G((F(*) AND *)))) : A(F((** AND (G(*) AND X(TRUE))))) : * : A(X(*)) : FALSE : A(F(**)) : A(X(TRUE)) : A(X(TRUE)) : A((X(G(**)) OR G(*))) : A(G(**)) : A(F(G(**))) : TRUE"
},
"net":
{
"arcs": 10010,
"conflict_clusters": 5,
"places": 128,
"places_significant": 121,
"singleton_clusters": 0,
"transitions": 1328
},
"result":
{
"preliminary_value": "no yes yes unknown no no no yes no no yes yes no no no yes ",
"value": "no yes yes unknown no no no yes no no yes yes no no no yes "
},
"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 High-Level net
lola: Places: 128, Transitions: 1328
lola: @ trans altern_cpt
lola: @ trans timeout_B
lola: @ trans enregistrement_B
lola: @ trans timeout_A
lola: @ trans liberation_B
lola: @ trans enregistrement_A
lola: @ trans liberation_A
lola: @ trans autorisation_B
lola: @ trans basculement
lola: @ trans decision
lola: @ trans autorisation_A
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 1456/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4096
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p60 + p61)
lola: place invariant simplifies atomic proposition
lola: before: (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p98 + p97 + p96 + p95 + p94 + p93 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p115)
lola: after: (1 <= p115)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p98 + p97 + p96 + p95 + p94 + p93 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (0 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p98 + p97 + p96 + p95 + p94 + p93 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)
lola: after: (0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p98 + p97 + p96 + p95 + p94 + p93 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p98 + p97 + p96 + p95 + p94 + p93 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 <= p2)
lola: after: (1 <= p2)
lola: LP says that atomic proposition is always false: (3 <= p57 + p58)
lola: LP says that atomic proposition is always false: (3 <= p57 + p58)
lola: place invariant simplifies atomic proposition
lola: before: (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= p5)
lola: after: (1 <= p5)
lola: LP says that atomic proposition is always false: (2 <= p3 + p4)
lola: LP says that atomic proposition is always false: (2 <= p3 + p4)
lola: place invariant simplifies atomic proposition
lola: before: (0 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56)
lola: after: (0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 <= p2)
lola: after: (1 <= p2)
lola: place invariant simplifies atomic proposition
lola: before: (p60 + p61 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56)
lola: after: (p60 + p61 <= 1)
lola: LP says that atomic proposition is always true: (p60 + p61 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p98 + p97 + p96 + p95 + p94 + p93 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p57 + p58)
lola: after: (1 <= p57 + p58)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56)
lola: after: (0 <= 0)
lola: A (NOT(F (((1 <= p3 + p4) AND X (G ((p5 <= p2))))))) : A ((X ((2 <= p5)) OR F (X ((2 <= p5))))) : A (((p2 <= p62) OR F (G (((p62 + 1 <= p2) OR X (F (((1 <= p60 + p61) AND ((1 <= p60 + p61) OR (p62 + 1 <= p2)))))))))) : A (F (X (NOT(((2 <= p60 + p61) OR ((2 <= p5) AND X (X ((1 <= p115))))))))) : A (((0 <= 0) AND X (NOT(G ((((0 <= 1) U G ((p60 + p61 <= p57 + p58))) OR (F ((0 <= 0)) U (1 <= p0)))))))) : A (F ((((p115 <= p2) AND NOT(F ((p114 <= p60 + p61)))) AND X (G (((p115 <= p2) OR G ((0 <= 0)))))))) : A (NOT((G (((1 <= p2) AND X ((G ((3 <= p57 + p58)) AND G (F ((3 <= p57 + p58))))))) U (1 <= p5)))) : A ((NOT(X (((p0 <= p116) AND F ((0 <= p60 + p61))))) OR NOT(((2 <= p3 + p4) U (p3 + p4 <= 1))))) : A ((F ((p2 <= p60 + p61)) AND NOT((((1 <= p60 + p61) U (p60 + p61 <= 0)) U (0 <= p115))))) : A ((F (((p59 <= p3 + p4) OR G ((0 <= 1)))) AND F ((p5 + 1 <= p116)))) : A (X (X (F ((X ((0 <= 0)) U G (F (X ((0 <= 0))))))))) : A ((X ((0 <= p115)) OR ((X ((0 <= 0)) U (G ((p2 <= p114)) U (0 <= 0))) U X ((0 <= 0))))) : A ((X (G ((2 <= p5))) OR NOT(F ((p115 + 1 <= p5))))) : A (G ((1 <= p2))) : A (((p60 + p61 <= 1) U F (G ((1 <= p57 + p58))))) : A ((F ((0 <= 0)) OR F (X (NOT(G (((1 <= 0) OR NOT(((1 <= p0) OR G ((1 <= p0)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:494
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 <= 0)
lola: processed formula length: 9
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 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: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p5 <= 1) OR X (X ((p115 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((p5 <= 1) OR X (X ((p115 <= 0)))))))
lola: processed formula length: 46
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1183308 markings, 3139869 edges, 236662 markings/sec, 0 secs
lola: 2142253 markings, 6466237 edges, 191789 markings/sec, 5 secs
lola: 3086626 markings, 9740856 edges, 188875 markings/sec, 10 secs
lola: 4030079 markings, 13055075 edges, 188691 markings/sec, 15 secs
lola: 4961946 markings, 16282306 edges, 186373 markings/sec, 20 secs
lola: 5911877 markings, 19578861 edges, 189986 markings/sec, 25 secs
lola: 6826599 markings, 22788923 edges, 182944 markings/sec, 30 secs
lola: 7770158 markings, 26043539 edges, 188712 markings/sec, 35 secs
lola: 8670437 markings, 29204688 edges, 180056 markings/sec, 40 secs
lola: 9610015 markings, 32449726 edges, 187916 markings/sec, 45 secs
lola: 10500623 markings, 35568923 edges, 178122 markings/sec, 50 secs
lola: 11419162 markings, 38774729 edges, 183708 markings/sec, 55 secs
lola: 12297673 markings, 41816566 edges, 175702 markings/sec, 60 secs
lola: 13169029 markings, 44894620 edges, 174271 markings/sec, 65 secs
lola: 14087296 markings, 48046107 edges, 183653 markings/sec, 70 secs
lola: 14958011 markings, 51107084 edges, 174143 markings/sec, 75 secs
lola: 15823872 markings, 54177693 edges, 173172 markings/sec, 80 secs
lola: 16720304 markings, 57238666 edges, 179286 markings/sec, 85 secs
lola: 17577330 markings, 60253392 edges, 171405 markings/sec, 90 secs
lola: 18436546 markings, 63309052 edges, 171843 markings/sec, 95 secs
lola: 19364412 markings, 66661236 edges, 185573 markings/sec, 100 secs
lola: 20294607 markings, 69839369 edges, 186039 markings/sec, 105 secs
lola: 21167820 markings, 72858191 edges, 174643 markings/sec, 110 secs
lola: 22033223 markings, 75910280 edges, 173081 markings/sec, 115 secs
lola: 22922121 markings, 79060079 edges, 177780 markings/sec, 120 secs
lola: 23831652 markings, 82123686 edges, 181906 markings/sec, 125 secs
lola: 24691143 markings, 85125670 edges, 171898 markings/sec, 130 secs
lola: 25547516 markings, 88152288 edges, 171275 markings/sec, 135 secs
lola: 26424510 markings, 91262974 edges, 175399 markings/sec, 140 secs
lola: 27331613 markings, 94336379 edges, 181421 markings/sec, 145 secs
lola: 28179799 markings, 97297555 edges, 169637 markings/sec, 150 secs
lola: 29026124 markings, 100291610 edges, 169265 markings/sec, 155 secs
lola: 29885916 markings, 103351327 edges, 171958 markings/sec, 160 secs
lola: 30796441 markings, 106503969 edges, 182105 markings/sec, 165 secs
lola: 31650253 markings, 109432055 edges, 170762 markings/sec, 170 secs
lola: 32485362 markings, 112385813 edges, 167022 markings/sec, 175 secs
lola: 33303733 markings, 115297606 edges, 163674 markings/sec, 180 secs
lola: 34150698 markings, 118325554 edges, 169393 markings/sec, 185 secs
lola: 35066025 markings, 121456967 edges, 183065 markings/sec, 190 secs
lola: 35911968 markings, 124389448 edges, 169189 markings/sec, 195 secs
lola: 36743054 markings, 127334653 edges, 166217 markings/sec, 200 secs
lola: 37572166 markings, 130300958 edges, 165822 markings/sec, 205 secs
lola: 38406949 markings, 133290610 edges, 166957 markings/sec, 210 secs
lola: 39311104 markings, 136407392 edges, 180831 markings/sec, 215 secs
lola: 40162675 markings, 139350753 edges, 170314 markings/sec, 220 secs
lola: 40993273 markings, 142299176 edges, 166120 markings/sec, 225 secs
lola: 41825821 markings, 145270020 edges, 166510 markings/sec, 230 secs
lola: 42651290 markings, 148240049 edges, 165094 markings/sec, 235 secs
lola: 43536412 markings, 151346387 edges, 177024 markings/sec, 240 secs
lola: 44399094 markings, 154306978 edges, 172536 markings/sec, 245 secs
lola: 45228511 markings, 157229473 edges, 165883 markings/sec, 250 secs
lola: 46048091 markings, 160161576 edges, 163916 markings/sec, 255 secs
lola: 46867442 markings, 163106179 edges, 163870 markings/sec, 260 secs
lola: 47695943 markings, 166082434 edges, 165700 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown no unknown no unknown unknown unknown unknown unknown unknown yes
lola: memory consumption: 7297072 KB
lola: time consumption: 290 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown no unknown no unknown unknown unknown unknown unknown unknown yes
lola: memory consumption: 7343044 KB
lola: time consumption: 292 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p115 <= p2) AND (G ((p60 + p61 + 1 <= p114)) AND X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((p115 <= p2) AND (G ((p60 + p61 + 1 <= p114)) AND X (TRUE)))))
lola: processed formula length: 69
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 423 markings, 423 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p3 + p4 <= 0) OR X (F ((p2 + 1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((p3 + p4 <= 0) OR X (F ((p2 + 1 <= p5))))))
lola: processed formula length: 50
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 451 markings, 451 edges
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p116 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p116 + 1 <= p0)))
lola: processed formula length: 24
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p5) OR F ((2 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((2 <= p5) OR F ((2 <= p5)))))
lola: processed formula length: 36
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= p5))) OR G ((p5 <= p115))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= p5))) OR G ((p5 <= p115))))
lola: processed formula length: 43
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 422 markings, 422 edges
lola: ========================================
lola: subprocess 11 will run for 651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p2 <= p62) OR F (G (((p62 + 1 <= p2) OR X (F (((1 <= p60 + p61) AND ((1 <= p60 + p61) OR (p62 + 1 <= p2))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p2 <= p62) OR F (G (((p62 + 1 <= p2) OR X (F (((1 <= p60 + p61) AND ((1 <= p60 + p61) OR (p62 + 1 <= p2))))))))))
lola: processed formula length: 119
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 814 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p2)))
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 ((1 <= p2)))
lola: processed formula length: 17
lola: 116 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1085 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p5 + 1 <= p116)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p116 <= p5)
lola: processed formula length: 12
lola: 116 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 425 markings, 424 edges
lola: ========================================
lola: subprocess 14 will run for 1628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p57 + p58))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p57 + p58))))
lola: processed formula length: 28
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 426 markings, 427 edges
lola: subprocess 15 will run for 3256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((p57 + p58 + 1 <= p60 + p61)) AND (p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((p57 + p58 + 1 <= p60 + p61)) AND (p0 <= 0)))))
lola: processed formula length: 60
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 423 markings, 424 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (F (((p5 <= 1) OR X (X ((p115 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((p5 <= 1) OR X (X ((p115 <= 0)))))))
lola: processed formula length: 46
lola: 114 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1198189 markings, 3183123 edges, 239638 markings/sec, 0 secs
lola: 2165620 markings, 6548879 edges, 193486 markings/sec, 5 secs
lola: 3125864 markings, 9877543 edges, 192049 markings/sec, 10 secs
lola: 4058385 markings, 13145956 edges, 186504 markings/sec, 15 secs
lola: 4976722 markings, 16337500 edges, 183667 markings/sec, 20 secs
lola: 5918705 markings, 19604073 edges, 188397 markings/sec, 25 secs
lola: 6825503 markings, 22785060 edges, 181360 markings/sec, 30 secs
lola: 7758438 markings, 26006129 edges, 186587 markings/sec, 35 secs
lola: 8649984 markings, 29138147 edges, 178309 markings/sec, 40 secs
lola: 9577376 markings, 32338018 edges, 185478 markings/sec, 45 secs
lola: 10457779 markings, 35420954 edges, 176081 markings/sec, 50 secs
lola: 11369577 markings, 38613793 edges, 182360 markings/sec, 55 secs
lola: 12252325 markings, 41652508 edges, 176550 markings/sec, 60 secs
lola: 13122370 markings, 44731991 edges, 174009 markings/sec, 65 secs
lola: 14046632 markings, 47906500 edges, 184852 markings/sec, 70 secs
lola: 14919580 markings, 50966863 edges, 174590 markings/sec, 75 secs
lola: 15799820 markings, 54091720 edges, 176048 markings/sec, 80 secs
lola: 16711870 markings, 57212508 edges, 182410 markings/sec, 85 secs
lola: 17578805 markings, 60259008 edges, 173387 markings/sec, 90 secs
lola: 18445001 markings, 63339960 edges, 173239 markings/sec, 95 secs
lola: 19376359 markings, 66704290 edges, 186272 markings/sec, 100 secs
lola: 20311379 markings, 69892839 edges, 187004 markings/sec, 105 secs
lola: 21186789 markings, 72926332 edges, 175082 markings/sec, 110 secs
lola: 22057879 markings, 75996827 edges, 174218 markings/sec, 115 secs
lola: 22952176 markings, 79169909 edges, 178859 markings/sec, 120 secs
lola: 23863722 markings, 82235534 edges, 182309 markings/sec, 125 secs
lola: 24730210 markings, 85258082 edges, 173298 markings/sec, 130 secs
lola: 25593089 markings, 88308918 edges, 172576 markings/sec, 135 secs
lola: 26473955 markings, 91442849 edges, 176173 markings/sec, 140 secs
lola: 27381468 markings, 94510949 edges, 181503 markings/sec, 145 secs
lola: 28234887 markings, 97488095 edges, 170684 markings/sec, 150 secs
lola: 29085566 markings, 100497259 edges, 170136 markings/sec, 155 secs
lola: 29931716 markings, 103516560 edges, 169230 markings/sec, 160 secs
lola: 30851917 markings, 106690761 edges, 184040 markings/sec, 165 secs
lola: 31710902 markings, 109649598 edges, 171797 markings/sec, 170 secs
lola: 32552714 markings, 112620819 edges, 168362 markings/sec, 175 secs
lola: 33394552 markings, 115615589 edges, 168368 markings/sec, 180 secs
lola: 34241587 markings, 118641289 edges, 169407 markings/sec, 185 secs
lola: 35146081 markings, 121736812 edges, 180899 markings/sec, 190 secs
lola: 35992060 markings, 124677361 edges, 169196 markings/sec, 195 secs
lola: 36824534 markings, 127630778 edges, 166495 markings/sec, 200 secs
lola: 37661858 markings, 130615385 edges, 167465 markings/sec, 205 secs
lola: 38493508 markings, 133604546 edges, 166330 markings/sec, 210 secs
lola: 39405271 markings, 136728940 edges, 182353 markings/sec, 215 secs
lola: 40252653 markings, 139667841 edges, 169476 markings/sec, 220 secs
lola: 41083773 markings, 142618111 edges, 166224 markings/sec, 225 secs
lola: 41912501 markings, 145586661 edges, 165746 markings/sec, 230 secs
lola: 42746347 markings, 148577181 edges, 166769 markings/sec, 235 secs
lola: 43637026 markings, 151691262 edges, 178136 markings/sec, 240 secs
lola: 44499682 markings, 154652447 edges, 172531 markings/sec, 245 secs
lola: 45327263 markings, 157586707 edges, 165516 markings/sec, 250 secs
lola: 46149687 markings, 160526345 edges, 164485 markings/sec, 255 secs
lola: 46977903 markings, 163499695 edges, 165643 markings/sec, 260 secs
lola: 47804003 markings, 166480501 edges, 165220 markings/sec, 265 secs
lola: 48710526 markings, 169601563 edges, 181305 markings/sec, 270 secs
lola: 49556865 markings, 172534673 edges, 169268 markings/sec, 275 secs
lola: 50380658 markings, 175473213 edges, 164759 markings/sec, 280 secs
lola: 51202559 markings, 178415582 edges, 164380 markings/sec, 285 secs
lola: 52019946 markings, 181366762 edges, 163477 markings/sec, 290 secs
lola: 52841676 markings, 184336720 edges, 164346 markings/sec, 295 secs
lola: 53739093 markings, 187438549 edges, 179483 markings/sec, 300 secs
lola: 54589783 markings, 190375728 edges, 170138 markings/sec, 305 secs
lola: 55413004 markings, 193311888 edges, 164644 markings/sec, 310 secs
lola: 56229753 markings, 196249122 edges, 163350 markings/sec, 315 secs
lola: 57043193 markings, 199189358 edges, 162688 markings/sec, 320 secs
lola: 57863167 markings, 202156786 edges, 163995 markings/sec, 325 secs
lola: 58756770 markings, 205274524 edges, 178721 markings/sec, 330 secs
lola: 59673302 markings, 208456127 edges, 183306 markings/sec, 335 secs
lola: 60534211 markings, 211462327 edges, 172182 markings/sec, 340 secs
lola: 61393814 markings, 214457265 edges, 171921 markings/sec, 345 secs
lola: 62224651 markings, 217383805 edges, 166167 markings/sec, 350 secs
lola: 63053417 markings, 220312948 edges, 165753 markings/sec, 355 secs
lola: 63878855 markings, 223271607 edges, 165088 markings/sec, 360 secs
lola: 64712988 markings, 226255863 edges, 166827 markings/sec, 365 secs
lola: 65607860 markings, 229359425 edges, 178974 markings/sec, 370 secs
lola: 66466495 markings, 232349632 edges, 171727 markings/sec, 375 secs
lola: 67324333 markings, 235351549 edges, 171568 markings/sec, 380 secs
lola: 68162235 markings, 238278097 edges, 167580 markings/sec, 385 secs
lola: 68980122 markings, 241190060 edges, 163577 markings/sec, 390 secs
lola: 69803054 markings, 244133832 edges, 164586 markings/sec, 395 secs
lola: 70624379 markings, 247082082 edges, 164265 markings/sec, 400 secs
lola: 71455206 markings, 250060080 edges, 166165 markings/sec, 405 secs
lola: 72353325 markings, 253116808 edges, 179624 markings/sec, 410 secs
lola: 73195271 markings, 256078896 edges, 168389 markings/sec, 415 secs
lola: 74034559 markings, 259010300 edges, 167858 markings/sec, 420 secs
lola: 74851926 markings, 261888181 edges, 163473 markings/sec, 425 secs
lola: 75660338 markings, 264782882 edges, 161682 markings/sec, 430 secs
lola: 76477508 markings, 267713886 edges, 163434 markings/sec, 435 secs
lola: 77300360 markings, 270679158 edges, 164570 markings/sec, 440 secs
lola: 78158097 markings, 273746725 edges, 171547 markings/sec, 445 secs
lola: 79035799 markings, 276719793 edges, 175540 markings/sec, 450 secs
lola: 79877997 markings, 279685215 edges, 168440 markings/sec, 455 secs
lola: 80720001 markings, 282643639 edges, 168401 markings/sec, 460 secs
lola: 81536720 markings, 285533599 edges, 163344 markings/sec, 465 secs
lola: 82349634 markings, 288432441 edges, 162583 markings/sec, 470 secs
lola: 83159093 markings, 291349950 edges, 161892 markings/sec, 475 secs
lola: 83979576 markings, 294310706 edges, 164097 markings/sec, 480 secs
lola: 84829949 markings, 297358737 edges, 170075 markings/sec, 485 secs
lola: 85714803 markings, 300366816 edges, 176971 markings/sec, 490 secs
lola: 86557350 markings, 303345902 edges, 168509 markings/sec, 495 secs
lola: 87404640 markings, 306312276 edges, 169458 markings/sec, 500 secs
lola: 88225370 markings, 309229593 edges, 164146 markings/sec, 505 secs
lola: 89043577 markings, 312139781 edges, 163641 markings/sec, 510 secs
lola: 89858370 markings, 315080247 edges, 162959 markings/sec, 515 secs
lola: 90674599 markings, 318029348 edges, 163246 markings/sec, 520 secs
lola: 91493930 markings, 320991672 edges, 163866 markings/sec, 525 secs
lola: 92396226 markings, 324070888 edges, 180459 markings/sec, 530 secs
lola: 93233187 markings, 327027106 edges, 167392 markings/sec, 535 secs
lola: 94086566 markings, 330031918 edges, 170676 markings/sec, 540 secs
lola: 94917353 markings, 332964240 edges, 166157 markings/sec, 545 secs
lola: 95740266 markings, 335871202 edges, 164583 markings/sec, 550 secs
lola: 96549116 markings, 338803947 edges, 161770 markings/sec, 555 secs
lola: 97364387 markings, 341751620 edges, 163054 markings/sec, 560 secs
lola: 98180307 markings, 344706719 edges, 163184 markings/sec, 565 secs
lola: 99029672 markings, 347769677 edges, 169873 markings/sec, 570 secs
lola: 99910785 markings, 350749593 edges, 176223 markings/sec, 575 secs
lola: 100750553 markings, 353725021 edges, 167954 markings/sec, 580 secs
lola: 101596942 markings, 356709414 edges, 169278 markings/sec, 585 secs
lola: 102422118 markings, 359629446 edges, 165035 markings/sec, 590 secs
lola: 103238244 markings, 362543292 edges, 163225 markings/sec, 595 secs
lola: 104050299 markings, 365481568 edges, 162411 markings/sec, 600 secs
lola: 104862918 markings, 368425127 edges, 162524 markings/sec, 605 secs
lola: 105679198 markings, 371384277 edges, 163256 markings/sec, 610 secs
lola: 106543557 markings, 374439688 edges, 172872 markings/sec, 615 secs
lola: 107407676 markings, 377425056 edges, 172824 markings/sec, 620 secs
lola: 107936337 markings, 379319429 edges, 105732 markings/sec, 625 secs
lola: 107950935 markings, 379365006 edges, 2920 markings/sec, 630 secs
lola: 107968018 markings, 379426747 edges, 3417 markings/sec, 635 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes yes unknown no no no yes no no yes yes no no no yes
lola:
preliminary result: no yes yes unknown no no no yes no no yes yes no no no yes
lola: memory consumption: 97100 KB
lola: time consumption: 958 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589301943444

--------------------
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-COL-V50P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is BridgeAndVehicles-COL-V50P20N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-oct2-158897741100049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P20N10.tgz
mv BridgeAndVehicles-COL-V50P20N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;