Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r204-csrt-159033411700069.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is SwimmingPool-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411700069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 4.2K Apr 12 18:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 12 18:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 20:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 21:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 21:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 24 05:38 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 SwimmingPool-PT-05-00
FORMULA_NAME SwimmingPool-PT-05-01
FORMULA_NAME SwimmingPool-PT-05-02
FORMULA_NAME SwimmingPool-PT-05-03
FORMULA_NAME SwimmingPool-PT-05-04
FORMULA_NAME SwimmingPool-PT-05-05
FORMULA_NAME SwimmingPool-PT-05-06
FORMULA_NAME SwimmingPool-PT-05-07
FORMULA_NAME SwimmingPool-PT-05-08
FORMULA_NAME SwimmingPool-PT-05-09
FORMULA_NAME SwimmingPool-PT-05-10
FORMULA_NAME SwimmingPool-PT-05-11
FORMULA_NAME SwimmingPool-PT-05-12
FORMULA_NAME SwimmingPool-PT-05-13
FORMULA_NAME SwimmingPool-PT-05-14
FORMULA_NAME SwimmingPool-PT-05-15

=== Now, execution of the tool begins

BK_START 1590644651447

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SwimmingPool-PT-05 @ 3570 seconds

FORMULA SwimmingPool-PT-05-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SwimmingPool-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2525
rslt: Output for LTLCardinality @ SwimmingPool-PT-05

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 28 05:44:11 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": 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": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": "(Out <= Undress)",
"processed_size": 16,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((2 <= WaitBag) OR F (G ((F ((Dressed <= Cabins)) AND ((Dressed <= Cabins) OR (X ((Out <= Entered)) OR (Dressed <= Cabins))))))))",
"processed_size": 132,
"rewrites": 74
},
"result":
{
"edges": 302,
"markings": 156,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (((Undress <= Out) OR G ((Dressed <= Cabins)))))",
"processed_size": 53,
"rewrites": 74
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((F ((Bags <= Dress)) U X ((X (((Dress + 1 <= Bags) OR G ((3 <= Bags)))) OR F ((Bags <= Dress))))))",
"processed_size": 101,
"rewrites": 74
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 360
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"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": "A (F (G ((Entered + 1 <= Out))))",
"processed_size": 32,
"rewrites": 74
},
"result":
{
"edges": 154855,
"markings": 100881,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"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": "(Dressed <= 0)",
"processed_size": 14,
"rewrites": 76
},
"result":
{
"edges": 12075,
"markings": 8701,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 462
},
"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": "(WaitBag <= Entered)",
"processed_size": 20,
"rewrites": 76
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"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": "A (F (G ((Undress + 1 <= Bags))))",
"processed_size": 33,
"rewrites": 74
},
"result":
{
"edges": 388,
"markings": 386,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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 (((Undress <= Out) OR (G ((2 <= Dress)) AND F ((Undress <= Out)))))",
"processed_size": 69,
"rewrites": 74
},
"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": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 810
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "A (((Dress <= 2) OR F ((InBath <= Dressed))))",
"processed_size": 45,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1080
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((Undress <= Entered) OR (G (F ((1 <= Bags))) OR F ((Undress <= 1)))))",
"processed_size": 73,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1620
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (F (((Cabins + 1 <= Undress) AND (Out + 1 <= WaitBag)))))",
"processed_size": 62,
"rewrites": 74
},
"result":
{
"edges": 8,
"markings": 8,
"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": 3240
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3240
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 1,
"visible_transitions": 0
},
"processed": "A (((2 <= Out) U (Out <= 1)))",
"processed_size": 29,
"rewrites": 78
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22228,
"runtime": 1045.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((** OR (G(**) AND F(**)))) : A((** OR F(G((F(**) AND (** OR (X(**) OR **))))))) : A((** OR F(**))) : A(X((** OR G(**)))) : A(F(**)) : (** AND A((G(**) OR (** U X(F(**)))))) : FALSE : A((** OR (G(F(**)) OR F(*)))) : FALSE : (** AND (A((** U **)) AND A((** U **)))) : A(F(*)) : A(F(G(*))) : A(F(G((X(G(**)) OR F((** OR (** AND (** U **)))))))) : A(G(F(**))) : A((F(**) U X((X((** OR G(*))) OR F(**))))) : (A(F(G(*))) AND A(X(F(**))))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "yes no yes yes yes no no yes no no no no unknown no yes no ",
"value": "yes no yes yes yes no no yes no no no no unknown no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 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: A ((G ((2 <= Dress)) U (Undress <= Out))) : A (((2 <= WaitBag) OR G (F (G ((((Dressed <= Cabins) OR X ((Out <= Entered))) U (Dressed <= Cabins))))))) : A (((Dress <= 2) OR (G ((0 <= Dress)) AND (((3 <= Dress) U (0 <= Entered)) U (InBath <= Dressed))))) : A (X (((Undress <= Out) OR G ((Dressed <= Cabins))))) : A (((G (NOT(((1 <= Bags) AND X (G ((Undress <= Entered)))))) U G (X ((1 <= Bags)))) U F ((1 <= Dressed)))) : A (((Out <= Undress) AND (G ((Dress <= Entered)) OR ((Dress <= Entered) U F (X (F ((Out <= Undress)))))))) : A (NOT(F (X (X ((NOT(G ((1 <= Undress))) U ((Bags <= InBath) U (0 <= Cabins)))))))) : A ((((Undress <= Entered) OR G (F ((1 <= Bags)))) OR F (NOT(G ((2 <= Undress)))))) : A (G (NOT((() U ())))) : A ((((Dressed <= Out) AND ((Cabins <= WaitBag) U (Dressed <= Out))) AND ((2 <= Out) U (Out <= 1)))) : A (NOT(G ((WaitBag <= Entered)))) : A (F (NOT((G ((X (X ((InBath <= Cabins))) U (0 <= Out))) U (Bags <= Undress))))) : A (X (F (G ((G (X ((Dressed <= InBath))) OR F (((1 <= Cabins) OR ((Bags <= Out) AND ((1 <= Cabins) U (Dressed <= InBath)))))))))) : A (G (X (G (F (X (((Cabins + 1 <= Undress) AND (Out + 1 <= WaitBag)))))))) : A ((F ((Bags <= Dress)) U X ((X (((Dress + 1 <= Bags) OR NOT(F ((Bags <= 2))))) OR F ((Bags <= Dress)))))) : A (X ((F (NOT(F ((Out <= Entered)))) AND ((1 <= Out) OR F ((1 <= Out))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:142
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:500
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 74 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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Out <= Undress) AND A ((G ((Dress <= Entered)) OR ((Dress <= Entered) U X (F ((Out <= Undress)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Out <= Undress)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Out <= Undress)
lola: processed formula length: 16
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= WaitBag) OR F (G ((F ((Dressed <= Cabins)) AND ((Dressed <= Cabins) OR (X ((Out <= Entered)) OR (Dressed <= Cabins))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= WaitBag) OR F (G ((F ((Dressed <= Cabins)) AND ((Dressed <= Cabins) OR (X ((Out <= Entered)) OR (Dressed <= Cabins))))))))
lola: processed formula length: 132
lola: 74 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: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
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: 156 markings, 302 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((Undress <= Out) OR G ((Dressed <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((Undress <= Out) OR G ((Dressed <= Cabins)))))
lola: processed formula length: 53
lola: 74 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((X (G ((Dressed <= InBath))) OR F (((1 <= Cabins) OR ((Bags <= Out) AND ((1 <= Cabins) U (Dressed <= InBath)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((X (G ((Dressed <= InBath))) OR F (((1 <= Cabins) OR ((Bags <= Out) AND ((1 <= Cabins) U (Dressed <= InBath)))))))))
lola: processed formula length: 125
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 1672755 markings, 6436400 edges, 334551 markings/sec, 0 secs
lola: 2988713 markings, 11869160 edges, 263192 markings/sec, 5 secs
lola: 4238697 markings, 19874803 edges, 249997 markings/sec, 10 secs
lola: 5351666 markings, 29327484 edges, 222594 markings/sec, 15 secs
lola: 6431696 markings, 37828977 edges, 216006 markings/sec, 20 secs
lola: 7474470 markings, 47161680 edges, 208555 markings/sec, 25 secs
lola: 8433633 markings, 55239089 edges, 191833 markings/sec, 30 secs
lola: 9337564 markings, 63511863 edges, 180786 markings/sec, 35 secs
lola: 10327716 markings, 72348610 edges, 198030 markings/sec, 40 secs
lola: 11259089 markings, 80362060 edges, 186275 markings/sec, 45 secs
lola: 12069563 markings, 88602089 edges, 162095 markings/sec, 50 secs
lola: 12939554 markings, 96788520 edges, 173998 markings/sec, 55 secs
lola: 13756018 markings, 104859976 edges, 163293 markings/sec, 60 secs
lola: 14643546 markings, 113998893 edges, 177506 markings/sec, 65 secs
lola: 15580871 markings, 122491953 edges, 187465 markings/sec, 70 secs
lola: 16540185 markings, 131676773 edges, 191863 markings/sec, 75 secs
lola: 17458383 markings, 140781161 edges, 183640 markings/sec, 80 secs
lola: 18305265 markings, 148884088 edges, 169376 markings/sec, 85 secs
lola: 19209506 markings, 157735110 edges, 180848 markings/sec, 90 secs
lola: 20155229 markings, 166523521 edges, 189145 markings/sec, 95 secs
lola: 21016072 markings, 174888837 edges, 172169 markings/sec, 100 secs
lola: 21871644 markings, 183467092 edges, 171114 markings/sec, 105 secs
lola: 22746368 markings, 192451136 edges, 174945 markings/sec, 110 secs
lola: 23574109 markings, 200958953 edges, 165548 markings/sec, 115 secs
lola: 24455244 markings, 210107503 edges, 176227 markings/sec, 120 secs
lola: 25292164 markings, 218066046 edges, 167384 markings/sec, 125 secs
lola: 26088643 markings, 226704531 edges, 159296 markings/sec, 130 secs
lola: 26884697 markings, 235048742 edges, 159211 markings/sec, 135 secs
lola: 27696083 markings, 243479023 edges, 162277 markings/sec, 140 secs
lola: 28547704 markings, 252691113 edges, 170324 markings/sec, 145 secs
lola: 29355355 markings, 261761073 edges, 161530 markings/sec, 150 secs
lola: 30196524 markings, 270138084 edges, 168234 markings/sec, 155 secs
lola: 31024465 markings, 279241840 edges, 165588 markings/sec, 160 secs
lola: 31929367 markings, 288148512 edges, 180980 markings/sec, 165 secs
lola: 32922231 markings, 297025995 edges, 198573 markings/sec, 170 secs
lola: 33733743 markings, 305637661 edges, 162302 markings/sec, 175 secs
lola: 34549559 markings, 314127288 edges, 163163 markings/sec, 180 secs
lola: 35323628 markings, 322507111 edges, 154814 markings/sec, 185 secs
lola: 36090616 markings, 330733253 edges, 153398 markings/sec, 190 secs
lola: 36899596 markings, 338621585 edges, 161796 markings/sec, 195 secs
lola: 37648812 markings, 346987042 edges, 149843 markings/sec, 200 secs
lola: 38472094 markings, 355205970 edges, 164656 markings/sec, 205 secs
lola: 39282411 markings, 364193681 edges, 162063 markings/sec, 210 secs
lola: 40112670 markings, 373176627 edges, 166052 markings/sec, 215 secs
lola: 40917561 markings, 381855917 edges, 160978 markings/sec, 220 secs
lola: 41734870 markings, 390630464 edges, 163462 markings/sec, 225 secs
lola: 42551619 markings, 399060826 edges, 163350 markings/sec, 230 secs
lola: 43360672 markings, 407432841 edges, 161811 markings/sec, 235 secs
lola: 44198415 markings, 415909104 edges, 167549 markings/sec, 240 secs
lola: 44994347 markings, 424327954 edges, 159186 markings/sec, 245 secs
lola: 45789374 markings, 432763029 edges, 159005 markings/sec, 250 secs
lola: 46546079 markings, 441436712 edges, 151341 markings/sec, 255 secs
lola: 47392041 markings, 450437511 edges, 169192 markings/sec, 260 secs
lola: 48168084 markings, 458224322 edges, 155209 markings/sec, 265 secs
lola: 48954376 markings, 466283613 edges, 157258 markings/sec, 270 secs
lola: 49763162 markings, 474348909 edges, 161757 markings/sec, 275 secs
lola: 50604977 markings, 483027056 edges, 168363 markings/sec, 280 secs
lola: 51426537 markings, 491459236 edges, 164312 markings/sec, 285 secs
lola: 52242264 markings, 499467608 edges, 163145 markings/sec, 290 secs
lola: 53069401 markings, 507685041 edges, 165427 markings/sec, 295 secs
lola: 53855900 markings, 516132462 edges, 157300 markings/sec, 300 secs
lola: 54614924 markings, 524568350 edges, 151805 markings/sec, 305 secs
lola: 55390003 markings, 532678097 edges, 155016 markings/sec, 310 secs
lola: 56155443 markings, 540168153 edges, 153088 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown yes unknown no no unknown no unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8313040 KB
lola: time consumption: 330 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((Bags <= Dress)) U X ((X (((Dress + 1 <= Bags) OR G ((3 <= Bags)))) OR F ((Bags <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((Bags <= Dress)) U X ((X (((Dress + 1 <= Bags) OR G ((3 <= Bags)))) OR F ((Bags <= Dress))))))
lola: processed formula length: 101
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 9 markings, 8 edges
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((Entered + 1 <= Out)))) AND A (X (F ((1 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Entered + 1 <= Out))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Entered + 1 <= Out))))
lola: processed formula length: 32
lola: 74 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: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
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: 100881 markings, 154855 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= Dressed)))
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: (Dressed <= 0)
lola: processed formula length: 14
lola: 76 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 8701 markings, 12075 edges
lola: ========================================
lola: subprocess 9 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Entered + 1 <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (WaitBag <= Entered)
lola: processed formula length: 20
lola: 76 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Undress + 1 <= Bags))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Undress + 1 <= Bags))))
lola: processed formula length: 33
lola: 74 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: 386 markings, 388 edges
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Undress <= Out) OR (G ((2 <= Dress)) AND F ((Undress <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Undress <= Out) OR (G ((2 <= Dress)) AND F ((Undress <= Out)))))
lola: processed formula length: 69
lola: 74 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Dress <= 2) OR F ((InBath <= Dressed))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Dress <= 2) OR F ((InBath <= Dressed))))
lola: processed formula length: 45
lola: 74 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: 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 13 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Undress <= Entered) OR (G (F ((1 <= Bags))) OR F ((Undress <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Undress <= Entered) OR (G (F ((1 <= Bags))) OR F ((Undress <= 1)))))
lola: processed formula length: 73
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((Cabins + 1 <= Undress) AND (Out + 1 <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((Cabins + 1 <= Undress) AND (Out + 1 <= WaitBag)))))
lola: processed formula length: 62
lola: 74 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 15 will run for 3240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Dressed <= Out) AND (A (((Cabins <= WaitBag) U (Dressed <= Out))) AND A (((2 <= Out) U (Out <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= Out) U (Out <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((2 <= Out) U (Out <= 1)))
lola: processed formula length: 29
lola: 78 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 7 markings, 7 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((X (G ((Dressed <= InBath))) OR F (((1 <= Cabins) OR ((Bags <= Out) AND ((1 <= Cabins) U (Dressed <= InBath)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((X (G ((Dressed <= InBath))) OR F (((1 <= Cabins) OR ((Bags <= Out) AND ((1 <= Cabins) U (Dressed <= InBath)))))))))
lola: processed formula length: 125
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 1688782 markings, 6489817 edges, 337756 markings/sec, 0 secs
lola: 3022959 markings, 11985844 edges, 266835 markings/sec, 5 secs
lola: 4284268 markings, 20286358 edges, 252262 markings/sec, 10 secs
lola: 5407086 markings, 29645656 edges, 224564 markings/sec, 15 secs
lola: 6526248 markings, 38810924 edges, 223832 markings/sec, 20 secs
lola: 7579841 markings, 48310741 edges, 210719 markings/sec, 25 secs
lola: 8610548 markings, 56448612 edges, 206141 markings/sec, 30 secs
lola: 9609749 markings, 66080149 edges, 199840 markings/sec, 35 secs
lola: 10665702 markings, 75151269 edges, 211191 markings/sec, 40 secs
lola: 11645111 markings, 84039073 edges, 195882 markings/sec, 45 secs
lola: 12574513 markings, 93450836 edges, 185880 markings/sec, 50 secs
lola: 13522261 markings, 102636886 edges, 189550 markings/sec, 55 secs
lola: 14450932 markings, 112020366 edges, 185734 markings/sec, 60 secs
lola: 15414676 markings, 120984171 edges, 192749 markings/sec, 65 secs
lola: 16434324 markings, 130372710 edges, 203930 markings/sec, 70 secs
lola: 17354142 markings, 139713156 edges, 183964 markings/sec, 75 secs
lola: 18242155 markings, 148130505 edges, 177603 markings/sec, 80 secs
lola: 19179524 markings, 157442181 edges, 187474 markings/sec, 85 secs
lola: 20154881 markings, 166516657 edges, 195071 markings/sec, 90 secs
lola: 21042020 markings, 174981353 edges, 177428 markings/sec, 95 secs
lola: 21920936 markings, 183938966 edges, 175783 markings/sec, 100 secs
lola: 22828338 markings, 193335862 edges, 181480 markings/sec, 105 secs
lola: 23697300 markings, 202094676 edges, 173792 markings/sec, 110 secs
lola: 24579285 markings, 211610120 edges, 176397 markings/sec, 115 secs
lola: 25465202 markings, 219776094 edges, 177183 markings/sec, 120 secs
lola: 26274052 markings, 228604338 edges, 161770 markings/sec, 125 secs
lola: 27086197 markings, 237086094 edges, 162429 markings/sec, 130 secs
lola: 27896399 markings, 245443426 edges, 162040 markings/sec, 135 secs
lola: 28691721 markings, 254242881 edges, 159064 markings/sec, 140 secs
lola: 29476152 markings, 262913476 edges, 156886 markings/sec, 145 secs
lola: 30275763 markings, 271072036 edges, 159922 markings/sec, 150 secs
lola: 31063126 markings, 279574497 edges, 157473 markings/sec, 155 secs
lola: 31920697 markings, 288031229 edges, 171514 markings/sec, 160 secs
lola: 32852955 markings, 296241626 edges, 186452 markings/sec, 165 secs
lola: 33639454 markings, 304594535 edges, 157300 markings/sec, 170 secs
lola: 34459516 markings, 313235370 edges, 164012 markings/sec, 175 secs
lola: 35296136 markings, 322151062 edges, 167324 markings/sec, 180 secs
lola: 36134927 markings, 331064112 edges, 167758 markings/sec, 185 secs
lola: 37023225 markings, 339984042 edges, 177660 markings/sec, 190 secs
lola: 37825101 markings, 348746053 edges, 160375 markings/sec, 195 secs
lola: 38650730 markings, 357098703 edges, 165126 markings/sec, 200 secs
lola: 39442290 markings, 366071953 edges, 158312 markings/sec, 205 secs
lola: 40286725 markings, 374889306 edges, 168887 markings/sec, 210 secs
lola: 41120748 markings, 384175754 edges, 166805 markings/sec, 215 secs
lola: 41948610 markings, 393047697 edges, 165572 markings/sec, 220 secs
lola: 42789783 markings, 401541440 edges, 168235 markings/sec, 225 secs
lola: 43627182 markings, 410309163 edges, 167480 markings/sec, 230 secs
lola: 44486810 markings, 418795298 edges, 171926 markings/sec, 235 secs
lola: 45299270 markings, 427420607 edges, 162492 markings/sec, 240 secs
lola: 46105638 markings, 436375176 edges, 161274 markings/sec, 245 secs
lola: 46914567 markings, 445762260 edges, 161786 markings/sec, 250 secs
lola: 47704378 markings, 453348013 edges, 157962 markings/sec, 255 secs
lola: 48436518 markings, 461056032 edges, 146428 markings/sec, 260 secs
lola: 49190665 markings, 468598336 edges, 150829 markings/sec, 265 secs
lola: 49971532 markings, 476746077 edges, 156173 markings/sec, 270 secs
lola: 50878015 markings, 485844370 edges, 181297 markings/sec, 275 secs
lola: 51698293 markings, 494078716 edges, 164056 markings/sec, 280 secs
lola: 52523095 markings, 502118121 edges, 164960 markings/sec, 285 secs
lola: 53311623 markings, 510335300 edges, 157706 markings/sec, 290 secs
lola: 54115308 markings, 519154345 edges, 160737 markings/sec, 295 secs
lola: 54933826 markings, 527966679 edges, 163704 markings/sec, 300 secs
lola: 55724089 markings, 536248902 edges, 158053 markings/sec, 305 secs
lola: 56498261 markings, 543771309 edges, 154834 markings/sec, 310 secs
lola: 57305247 markings, 551723273 edges, 161397 markings/sec, 315 secs
lola: 58061538 markings, 560247769 edges, 151258 markings/sec, 320 secs
lola: 58863066 markings, 568647484 edges, 160306 markings/sec, 325 secs
lola: 59698339 markings, 578104596 edges, 167055 markings/sec, 330 secs
lola: 60492569 markings, 586618802 edges, 158846 markings/sec, 335 secs
lola: 61250975 markings, 593929352 edges, 151681 markings/sec, 340 secs
lola: 61960521 markings, 601275884 edges, 141909 markings/sec, 345 secs
lola: 62694772 markings, 608507281 edges, 146850 markings/sec, 350 secs
lola: 63440853 markings, 615558491 edges, 149216 markings/sec, 355 secs
lola: 64172185 markings, 623224510 edges, 146266 markings/sec, 360 secs
lola: 64892563 markings, 630518290 edges, 144076 markings/sec, 365 secs
lola: 65713913 markings, 638458038 edges, 164270 markings/sec, 370 secs
lola: 66512481 markings, 646623015 edges, 159714 markings/sec, 375 secs
lola: 67261325 markings, 654007996 edges, 149769 markings/sec, 380 secs
lola: 68022905 markings, 661873280 edges, 152316 markings/sec, 385 secs
lola: 68791979 markings, 670049533 edges, 153815 markings/sec, 390 secs
lola: 69585988 markings, 677785097 edges, 158802 markings/sec, 395 secs
lola: 70363468 markings, 685616806 edges, 155496 markings/sec, 400 secs
lola: 71085347 markings, 693477408 edges, 144376 markings/sec, 405 secs
lola: 71826724 markings, 700985878 edges, 148275 markings/sec, 410 secs
lola: 72601831 markings, 708864194 edges, 155021 markings/sec, 415 secs
lola: 73364876 markings, 716634374 edges, 152609 markings/sec, 420 secs
lola: 74113090 markings, 725282868 edges, 149643 markings/sec, 425 secs
lola: 74829077 markings, 732805171 edges, 143197 markings/sec, 430 secs
lola: 75553465 markings, 739551392 edges, 144878 markings/sec, 435 secs
lola: 76287695 markings, 747229153 edges, 146846 markings/sec, 440 secs
lola: 77046993 markings, 754936030 edges, 151860 markings/sec, 445 secs
lola: 77797026 markings, 762838989 edges, 150007 markings/sec, 450 secs
lola: 78568605 markings, 770664938 edges, 154316 markings/sec, 455 secs
lola: 79262706 markings, 777838447 edges, 138820 markings/sec, 460 secs
lola: 79976083 markings, 785164321 edges, 142675 markings/sec, 465 secs
lola: 80733519 markings, 793058971 edges, 151487 markings/sec, 470 secs
lola: 81528880 markings, 800599483 edges, 159072 markings/sec, 475 secs
lola: 82285284 markings, 808085112 edges, 151281 markings/sec, 480 secs
lola: 83053844 markings, 815953519 edges, 153712 markings/sec, 485 secs
lola: 83821806 markings, 823726774 edges, 153592 markings/sec, 490 secs
lola: 84535076 markings, 831062776 edges, 142654 markings/sec, 495 secs
lola: 85298835 markings, 838902427 edges, 152752 markings/sec, 500 secs
lola: 86043001 markings, 847110250 edges, 148833 markings/sec, 505 secs
lola: 86759132 markings, 854531011 edges, 143226 markings/sec, 510 secs
lola: 87497003 markings, 861341627 edges, 147574 markings/sec, 515 secs
lola: 88239372 markings, 868946489 edges, 148474 markings/sec, 520 secs
lola: 88974143 markings, 876302329 edges, 146954 markings/sec, 525 secs
lola: 89732460 markings, 884046487 edges, 151663 markings/sec, 530 secs
lola: 90438636 markings, 892153755 edges, 141235 markings/sec, 535 secs
lola: 91196000 markings, 899978499 edges, 151473 markings/sec, 540 secs
lola: 91951968 markings, 907701719 edges, 151194 markings/sec, 545 secs
lola: 92686554 markings, 914895764 edges, 146917 markings/sec, 550 secs
lola: 93412392 markings, 922450076 edges, 145168 markings/sec, 555 secs
lola: 94154684 markings, 929367749 edges, 148458 markings/sec, 560 secs
lola: 94897051 markings, 937011116 edges, 148473 markings/sec, 565 secs
lola: 95643127 markings, 944848724 edges, 149215 markings/sec, 570 secs
lola: 96367228 markings, 952465327 edges, 144820 markings/sec, 575 secs
lola: 97099902 markings, 959618413 edges, 146535 markings/sec, 580 secs
lola: 97840642 markings, 966387162 edges, 148148 markings/sec, 585 secs
lola: 98572165 markings, 974603896 edges, 146305 markings/sec, 590 secs
lola: 99316671 markings, 981661057 edges, 148901 markings/sec, 595 secs
lola: 100108429 markings, 989236854 edges, 158352 markings/sec, 600 secs
lola: 100829951 markings, 995914743 edges, 144304 markings/sec, 605 secs
lola: 101591262 markings, 1003441512 edges, 152262 markings/sec, 610 secs
lola: 102299771 markings, 1010001820 edges, 141702 markings/sec, 615 secs
lola: 102976816 markings, 1017659486 edges, 135409 markings/sec, 620 secs
lola: 103650838 markings, 1023437555 edges, 134804 markings/sec, 625 secs
lola: 104364796 markings, 1030637672 edges, 142792 markings/sec, 630 secs
lola: 105069335 markings, 1037388232 edges, 140908 markings/sec, 635 secs
lola: 105780188 markings, 1044398236 edges, 142171 markings/sec, 640 secs
lola: 106440046 markings, 1051097339 edges, 131972 markings/sec, 645 secs
lola: 107127156 markings, 1057278956 edges, 137422 markings/sec, 650 secs
lola: 107827928 markings, 1063964877 edges, 140154 markings/sec, 655 secs
lola: 108514122 markings, 1070537376 edges, 137239 markings/sec, 660 secs
lola: 109204635 markings, 1077385877 edges, 138103 markings/sec, 665 secs
lola: 109671509 markings, 1081811358 edges, 93375 markings/sec, 670 secs
lola: 109937836 markings, 1084258223 edges, 53265 markings/sec, 675 secs
lola: 109992543 markings, 1084735465 edges, 10941 markings/sec, 680 secs
lola: 110002364 markings, 1084834760 edges, 1964 markings/sec, 685 secs
lola: 110005211 markings, 1084872826 edges, 569 markings/sec, 690 secs
lola: 110012821 markings, 1084970923 edges, 1522 markings/sec, 695 secs
lola: 110027551 markings, 1085073222 edges, 2946 markings/sec, 700 secs
lola: 110091029 markings, 1085503091 edges, 12696 markings/sec, 705 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no no yes no no no no unknown no yes no
lola:
preliminary result: yes no yes yes yes no no yes no no no no unknown no yes no
lola: memory consumption: 22228 KB
lola: time consumption: 1045 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590645696811

--------------------
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="SwimmingPool-PT-05"
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 SwimmingPool-PT-05, 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 r204-csrt-159033411700069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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