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.r105-oct2-158940199600031.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 HexagonalGrid-PT-816, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-oct2-158940199600031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rwxr-xr-x 1 mcc users 3.9M Apr 27 14:36 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 HexagonalGrid-PT-816-00
FORMULA_NAME HexagonalGrid-PT-816-01
FORMULA_NAME HexagonalGrid-PT-816-02
FORMULA_NAME HexagonalGrid-PT-816-03
FORMULA_NAME HexagonalGrid-PT-816-04
FORMULA_NAME HexagonalGrid-PT-816-05
FORMULA_NAME HexagonalGrid-PT-816-06
FORMULA_NAME HexagonalGrid-PT-816-07
FORMULA_NAME HexagonalGrid-PT-816-08
FORMULA_NAME HexagonalGrid-PT-816-09
FORMULA_NAME HexagonalGrid-PT-816-10
FORMULA_NAME HexagonalGrid-PT-816-11
FORMULA_NAME HexagonalGrid-PT-816-12
FORMULA_NAME HexagonalGrid-PT-816-13
FORMULA_NAME HexagonalGrid-PT-816-14
FORMULA_NAME HexagonalGrid-PT-816-15

=== Now, execution of the tool begins

BK_START 1589715146100

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ HexagonalGrid-PT-816 @ 3570 seconds

FORMULA HexagonalGrid-PT-816-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-816-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2584
rslt: Output for LTLCardinality @ HexagonalGrid-PT-816

{
"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": "Sun May 17 11:32:26 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (X (F ((((pb4_4_1 + 1 <= pi3_8_11) OR (pi2_14_3 <= pb4_7_5)) AND X (G (((pb4_4_1 + 1 <= pi3_8_11) AND (pb2_5_1 + 1 <= pbl_2_5))))))))",
"processed_size": 136,
"rewrites": 115
},
"result":
{
"edges": 17128,
"markings": 17128,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (G ((((pb1_3_1 + 1 <= po2_10_6) AND (po2_10_6 <= pb1_3_1)) OR G ((pil3_13_7 + 1 <= po2_4_8))))))",
"processed_size": 101,
"rewrites": 115
},
"result":
{
"edges": 17128,
"markings": 17128,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 347
},
"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": 115
},
"result":
{
"edges": 1014,
"markings": 1015,
"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": 391
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F ((pil1_9_6 + 1 <= po1_11_11))))",
"processed_size": 39,
"rewrites": 115
},
"result":
{
"edges": 18198,
"markings": 18198,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 447
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (((X (F (((pi1_14_5 <= pi1_8_2) AND G ((pi2_15_3 <= pb3_9_14))))) R F ((pb5_9_3 + 1 <= pb2_13_3))) U (pb2_13_3 <= pb5_9_3)))",
"processed_size": 126,
"rewrites": 115
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 521
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F ((((po2_9_11 <= pol2_2_1) U G ((po2_9_11 <= pol2_2_1))) OR X (F ((1 <= pil3_12_8))))))",
"processed_size": 91,
"rewrites": 115
},
"result":
{
"edges": 8543443,
"markings": 5105830,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (F (((pb1_6_9 <= pol1_7_10) OR (F ((pb1_6_9 <= pol1_7_10)) AND F (G ((pb3_8_11 <= 0))))))))",
"processed_size": 96,
"rewrites": 115
},
"result":
{
"edges": 38157,
"markings": 38143,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 739
},
"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": "(pol1_9_2 <= pb5_2_3)",
"processed_size": 21,
"rewrites": 117
},
"result":
{
"edges": 14308,
"markings": 14309,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1373
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((po2_5_5 <= pol2_1_4))))",
"processed_size": 33,
"rewrites": 115
},
"result":
{
"edges": 506830,
"markings": 174435,
"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": 2609
},
"child":
[

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

{
"child":
[

{
"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 <= pol2_13_4)))",
"processed_size": 24,
"rewrites": 117
},
"result":
{
"edges": 1,
"markings": 2,
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 140588,
"runtime": 961.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G((* OR G(*))))) : A(X(TRUE)) : A(((X(F((* AND G(*)))) R F(*)) U **)) : A(G(F(**))) : A(F(((** U G(**)) OR X(F(**))))) : A(X(F((** AND X(G(**)))))) : (** AND A(F((** OR F(G(**)))))) : FALSE : (A(X(TRUE)) AND A(G(**))) : TRUE : A(F(**)) : A(X(F(*))) : FALSE : A(G(F(**))) : FALSE : A(X(F((** OR (F(**) AND F(G(*)))))))"
},
"net":
{
"arcs": 24696,
"conflict_clusters": 1273,
"places": 3391,
"places_significant": 2117,
"singleton_clusters": 0,
"transitions": 6174
},
"result":
{
"preliminary_value": "no yes yes no no no no no no yes no no no no no no ",
"value": "no yes yes no no no no no no yes no no no no no 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: 9565/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 108512
lola: finding significant places
lola: 3391 places, 6174 transitions, 2117 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= pol2_13_1)
lola: LP says that atomic proposition is always false: (2 <= po2_4_10)
lola: LP says that atomic proposition is always false: (2 <= po2_4_10)
lola: LP says that atomic proposition is always false: (2 <= pol3_7_13)
lola: LP says that atomic proposition is always false: (3 <= po5_15_1)
lola: LP says that atomic proposition is always false: (3 <= pol2_11_9)
lola: LP says that atomic proposition is always false: (3 <= po5_15_1)
lola: LP says that atomic proposition is always false: (3 <= po2_9_2)
lola: LP says that atomic proposition is always false: (3 <= pil2_6_7)
lola: LP says that atomic proposition is always false: (3 <= pil2_6_7)
lola: LP says that atomic proposition is always false: (3 <= pil2_6_7)
lola: LP says that atomic proposition is always false: (2 <= pol1_8_6)
lola: LP says that atomic proposition is always false: (3 <= pol1_7_5)
lola: A (X (NOT(F ((((po2_10_6 <= pb1_3_1) OR (pb1_3_1 + 1 <= po2_10_6)) AND F (((po2_4_8 <= pil3_13_7) AND F ((0 <= pil6_1_3))))))))) : A (X (((NOT(G ((3 <= pol2_13_1))) OR G (((pb4_13_6 <= pol3_11_7) OR NOT(F ((pb4_13_6 <= pol3_11_7)))))) OR F (X ((pi6_5_1 <= pol1_13_5)))))) : A ((NOT((X (G (((pi1_8_2 + 1 <= pi1_14_5) OR F ((pb3_9_14 + 1 <= pi2_15_3))))) U G ((pb2_13_3 <= pb5_9_3)))) U (pb2_13_3 <= pb5_9_3))) : A ((X ((pbl_13_7 <= pil3_15_4)) U G (X (G (F ((pil1_5_5 <= pi2_7_1))))))) : A ((G (F ((po2_4_10 <= 1))) U (((po2_9_11 <= pol2_2_1) U G ((po2_9_11 <= pol2_2_1))) OR X (((2 <= po2_4_10) OR F ((1 <= pil3_12_8))))))) : A (X (F ((((pb4_4_1 + 1 <= pi3_8_11) OR (pi2_14_3 <= pb4_7_5)) AND G (X (((pb4_4_1 + 1 <= pi3_8_11) AND (pb2_5_1 + 1 <= pbl_2_5)))))))) : A (((pb5_14_2 <= po3_15_2) AND F ((((1 <= pil1_9_4)) OR G (F (G ((pb5_14_2 <= po3_15_2)))))))) : A ((NOT((NOT(((3 <= po5_15_1) OR (X ((3 <= pol2_11_9)) U (po3_2_9 <= pol1_9_4)))) OR ((pil2_13_7 <= pb6_2_9) U (po3_2_9 <= pol1_9_4)))) U G ((3 <= po5_15_1)))) : A (G ((X ((0 <= pol3_15_7)) AND G (((1 <= pol2_13_4) OR (F ((3 <= po2_9_2)) U (pol3_15_7 + 1 <= 0))))))) : A (NOT(F (NOT(((0 <= pb1_1_1) U G (X ((0 <= pb1_1_1)))))))) : A (((pb1_14_1 <= 1) U F ((pb5_2_3 + 1 <= pol1_9_2)))) : A (F (NOT(X ((po1_11_11 <= pil1_9_6))))) : A ((G ((((po1_14_7 <= pol3_6_5)) OR G (F (NOT(F (X ((3 <= pil2_6_7)))))))) U (3 <= pil2_6_7))) : A ((F (NOT(((2 <= pol1_8_6) AND X (G ((po2_5_5 <= pol2_1_4)))))) AND G (X (F ((po2_5_5 <= pol2_1_4)))))) : A ((G (X ((3 <= pol1_7_5))) AND F (X (((pol3_13_5 <= pol3_15_2) AND X ((pol3_13_5 <= pol3_15_2))))))) : A (F (X ((F (NOT(G (X (G (X (G (F ((1 <= pb3_8_11))))))))) U (pb1_6_9 <= pol1_7_10)))))
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 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: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 233 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: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 250 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: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 269 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: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((((pb4_4_1 + 1 <= pi3_8_11) OR (pi2_14_3 <= pb4_7_5)) AND X (G (((pb4_4_1 + 1 <= pi3_8_11) AND (pb2_5_1 + 1 <= pbl_2_5))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((((pb4_4_1 + 1 <= pi3_8_11) OR (pi2_14_3 <= pb4_7_5)) AND X (G (((pb4_4_1 + 1 <= pi3_8_11) AND (pb2_5_1 + 1 <= pbl_2_5))))))))
lola: processed formula length: 136
lola: 115 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17128 markings, 17128 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((((pb1_3_1 + 1 <= po2_10_6) AND (po2_10_6 <= pb1_3_1)) OR G ((pil3_13_7 + 1 <= po2_4_8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((((pb1_3_1 + 1 <= po2_10_6) AND (po2_10_6 <= pb1_3_1)) OR G ((pil3_13_7 + 1 <= po2_4_8))))))
lola: processed formula length: 101
lola: 115 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17128 markings, 17128 edges
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (TRUE)) AND A (G ((1 <= pol2_13_4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown no unknown no unknown yes unknown unknown no unknown no unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: no unknown unknown unknown unknown no unknown no unknown yes unknown unknown no unknown no unknown
lola: memory consumption: 140272 KB
lola: time consumption: 415 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: memory consumption: 140272 KB
lola: time consumption: 415 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 7 will run for 347 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: 115 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: 1015 markings, 1014 edges
lola: ========================================
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((pil1_9_6 + 1 <= po1_11_11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((pil1_9_6 + 1 <= po1_11_11))))
lola: processed formula length: 39
lola: 115 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: 18198 markings, 18198 edges
lola: ========================================
lola: subprocess 9 will run for 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((X (F (((pi1_14_5 <= pi1_8_2) AND G ((pi2_15_3 <= pb3_9_14))))) R F ((pb5_9_3 + 1 <= pb2_13_3))) U (pb2_13_3 <= pb5_9_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X (F (((pi1_14_5 <= pi1_8_2) AND G ((pi2_15_3 <= pb3_9_14))))) R F ((pb5_9_3 + 1 <= pb2_13_3))) U (pb2_13_3 <= pb5_9_3)))
lola: processed formula length: 126
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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 10 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((po2_9_11 <= pol2_2_1) U G ((po2_9_11 <= pol2_2_1))) OR X (F ((1 <= pil3_12_8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((((po2_9_11 <= pol2_2_1) U G ((po2_9_11 <= pol2_2_1))) OR X (F ((1 <= pil3_12_8))))))
lola: processed formula length: 91
lola: 115 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: 210926 markings, 269100 edges, 42185 markings/sec, 0 secs
lola: 392329 markings, 538971 edges, 36281 markings/sec, 5 secs
lola: 552068 markings, 789074 edges, 31948 markings/sec, 10 secs
lola: 671820 markings, 1028687 edges, 23950 markings/sec, 15 secs
lola: 790185 markings, 1270780 edges, 23673 markings/sec, 20 secs
lola: 961051 markings, 1533279 edges, 34173 markings/sec, 25 secs
lola: 1121492 markings, 1789792 edges, 32088 markings/sec, 30 secs
lola: 1268113 markings, 2027328 edges, 29324 markings/sec, 35 secs
lola: 1376992 markings, 2262767 edges, 21776 markings/sec, 40 secs
lola: 1476368 markings, 2496898 edges, 19875 markings/sec, 45 secs
lola: 1611739 markings, 2748410 edges, 27074 markings/sec, 50 secs
lola: 1790625 markings, 3017308 edges, 35777 markings/sec, 55 secs
lola: 1939152 markings, 3276387 edges, 29705 markings/sec, 60 secs
lola: 2074144 markings, 3527217 edges, 26998 markings/sec, 65 secs
lola: 2177945 markings, 3765527 edges, 20760 markings/sec, 70 secs
lola: 2292194 markings, 4012057 edges, 22850 markings/sec, 75 secs
lola: 2450663 markings, 4274721 edges, 31694 markings/sec, 80 secs
lola: 2592154 markings, 4523983 edges, 28298 markings/sec, 85 secs
lola: 2728744 markings, 4757645 edges, 27318 markings/sec, 90 secs
lola: 2828499 markings, 4987104 edges, 19951 markings/sec, 95 secs
lola: 2913402 markings, 5207403 edges, 16981 markings/sec, 100 secs
lola: 3002376 markings, 5434919 edges, 17795 markings/sec, 105 secs
lola: 3183516 markings, 5710152 edges, 36228 markings/sec, 110 secs
lola: 3353176 markings, 5987588 edges, 33932 markings/sec, 115 secs
lola: 3551865 markings, 6258082 edges, 39738 markings/sec, 120 secs
lola: 3747835 markings, 6520913 edges, 39194 markings/sec, 125 secs
lola: 3939786 markings, 6775046 edges, 38390 markings/sec, 130 secs
lola: 4126957 markings, 7028304 edges, 37434 markings/sec, 135 secs
lola: 4284686 markings, 7272678 edges, 31546 markings/sec, 140 secs
lola: 4419723 markings, 7514469 edges, 27007 markings/sec, 145 secs
lola: 4562617 markings, 7739533 edges, 28579 markings/sec, 150 secs
lola: 4713465 markings, 7952953 edges, 30170 markings/sec, 155 secs
lola: 4861546 markings, 8171032 edges, 29616 markings/sec, 160 secs
lola: 5006186 markings, 8387195 edges, 28928 markings/sec, 165 secs
lola: add low 3812
lola: add low 4652
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: 5105830 markings, 8543443 edges
lola: ========================================
lola: subprocess 11 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((pb1_6_9 <= pol1_7_10) OR (F ((pb1_6_9 <= pol1_7_10)) AND F (G ((pb3_8_11 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((pb1_6_9 <= pol1_7_10) OR (F ((pb1_6_9 <= pol1_7_10)) AND F (G ((pb3_8_11 <= 0))))))))
lola: processed formula length: 96
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 38143 markings, 38157 edges
lola: subprocess 12 will run for 739 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pb5_2_3 + 1 <= pol1_9_2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: lola: ========================================
rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (pol1_9_2 <= pb5_2_3)
lola: processed formula length: 21
lola: 117 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: 1948 markings, 1947 edges, 390 markings/sec, 0 secs
lola: 2023 markings, 2022 edges, 15 markings/sec, 5 secs
lola: 2104 markings, 2103 edges, 16 markings/sec, 10 secs
lola: 2176 markings, 2175 edges, 14 markings/sec, 15 secs
lola: 2277 markings, 2276 edges, 20 markings/sec, 20 secs
lola: 2394 markings, 2393 edges, 23 markings/sec, 25 secs
lola: 2929 markings, 2928 edges, 107 markings/sec, 30 secs
lola: 3461 markings, 3460 edges, 106 markings/sec, 35 secs
lola: 3906 markings, 3905 edges, 89 markings/sec, 40 secs
lola: 4580 markings, 4579 edges, 135 markings/sec, 45 secs
lola: 5157 markings, 5156 edges, 115 markings/sec, 50 secs
lola: 5368 markings, 5367 edges, 42 markings/sec, 55 secs
lola: 5766 markings, 5765 edges, 80 markings/sec, 60 secs
lola: 6563 markings, 6562 edges, 159 markings/sec, 65 secs
lola: 9670 markings, 9669 edges, 621 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 14309 markings, 14308 edges
lola: ========================================
lola: subprocess 13 will run for 959 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((pil1_5_5 <= pi2_7_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((pil1_5_5 <= pi2_7_1))))
lola: processed formula length: 33
lola: 115 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: 1913 markings, 1912 edges, 383 markings/sec, 0 secs
lola: 2117 markings, 2116 edges, 41 markings/sec, 5 secs
lola: 2163 markings, 2162 edges, 9 markings/sec, 10 secs
lola: 2223 markings, 2222 edges, 12 markings/sec, 15 secs
lola: 2282 markings, 2281 edges, 12 markings/sec, 20 secs
lola: 2390 markings, 2389 edges, 22 markings/sec, 25 secs
lola: 2583 markings, 2582 edges, 39 markings/sec, 30 secs
lola: 2742 markings, 2741 edges, 32 markings/sec, 35 secs
lola: 2959 markings, 2958 edges, 43 markings/sec, 40 secs
lola: 3260 markings, 3259 edges, 60 markings/sec, 45 secs
lola: 3421 markings, 3420 edges, 32 markings/sec, 50 secs
lola: 3517 markings, 3516 edges, 19 markings/sec, 55 secs
lola: 3654 markings, 3653 edges, 27 markings/sec, 60 secs
lola: 3761 markings, 3760 edges, 21 markings/sec, 65 secs
lola: 3906 markings, 3905 edges, 29 markings/sec, 70 secs
lola: 4152 markings, 4151 edges, 49 markings/sec, 75 secs
lola: 4482 markings, 4481 edges, 66 markings/sec, 80 secs
lola: 4640 markings, 4639 edges, 32 markings/sec, 85 secs
lola: 4787 markings, 4786 edges, 29 markings/sec, 90 secs
lola: 5385 markings, 5384 edges, 120 markings/sec, 95 secs
lola: 5891 markings, 5890 edges, 101 markings/sec, 100 secs
lola: 6494 markings, 6493 edges, 121 markings/sec, 105 secs
lola: 7085 markings, 7084 edges, 118 markings/sec, 110 secs
lola: 7704 markings, 7703 edges, 124 markings/sec, 115 secs
lola: 8504 markings, 8503 edges, 160 markings/sec, 120 secs
lola: 10523 markings, 10522 edges, 404 markings/sec, 125 secs
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: 14779 markings, 14779 edges
lola: ========================================
lola: subprocess 14 will run for 1373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((po2_5_5 <= pol2_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((po2_5_5 <= pol2_1_4))))
lola: processed formula length: 33
lola: 115 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: 2051 markings, 2050 edges, 410 markings/sec, 0 secs
lola: 2097 markings, 2096 edges, 9 markings/sec, 5 secs
lola: 2137 markings, 2136 edges, 8 markings/sec, 10 secs
lola: 2180 markings, 2179 edges, 9 markings/sec, 15 secs
lola: 2257 markings, 2256 edges, 15 markings/sec, 20 secs
lola: 2289 markings, 2288 edges, 6 markings/sec, 25 secs
lola: 2327 markings, 2326 edges, 8 markings/sec, 30 secs
lola: 2382 markings, 2381 edges, 11 markings/sec, 35 secs
lola: 2427 markings, 2426 edges, 9 markings/sec, 40 secs
lola: 2491 markings, 2490 edges, 13 markings/sec, 45 secs
lola: 2602 markings, 2601 edges, 22 markings/sec, 50 secs
lola: 2719 markings, 2718 edges, 23 markings/sec, 55 secs
lola: 2829 markings, 2828 edges, 22 markings/sec, 60 secs
lola: 2974 markings, 2973 edges, 29 markings/sec, 65 secs
lola: 3119 markings, 3118 edges, 29 markings/sec, 70 secs
lola: 3321 markings, 3320 edges, 40 markings/sec, 75 secs
lola: 3526 markings, 3525 edges, 41 markings/sec, 80 secs
lola: 4150 markings, 4149 edges, 125 markings/sec, 85 secs
lola: 4700 markings, 4699 edges, 110 markings/sec, 90 secs
lola: 5724 markings, 5723 edges, 205 markings/sec, 95 secs
lola: 6790 markings, 6789 edges, 213 markings/sec, 100 secs
lola: 7559 markings, 7558 edges, 154 markings/sec, 105 secs
lola: 8989 markings, 8988 edges, 286 markings/sec, 110 secs
lola: 11809 markings, 11808 edges, 564 markings/sec, 115 secs
lola: 39753 markings, 82366 edges, 5589 markings/sec, 120 secs
lola: 94122 markings, 258146 edges, 10874 markings/sec, 125 secs
lola: 147112 markings, 444975 edges, 10598 markings/sec, 130 secs
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: 174435 markings, 506830 edges
lola: ========================================
lola: subprocess 15 will run for 2609 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((pb5_14_2 <= po3_15_2) AND A (F ((((1 <= pil1_9_4)) OR F (G ((pb5_14_2 <= po3_15_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2609 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (pb5_14_2 <= po3_15_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb5_14_2 <= po3_15_2)
lola: processed formula length: 22
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (X (TRUE)) AND A (G ((1 <= pol2_13_4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pol2_13_4)))
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 <= pol2_13_4)))
lola: processed formula length: 24
lola: 117 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: (pol2_13_4 <= 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: 2 markings, 1 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no no no no no yes no no no no no no
lola:
preliminary result: no yes yes no no no no no no yes no no no no no no
lola: ========================================
lola: memory consumption: 140588 KB
lola: time consumption: 961 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589716132076

--------------------
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="HexagonalGrid-PT-816"
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 HexagonalGrid-PT-816, 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 r105-oct2-158940199600031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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