Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r170-oct2-155297750200096.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is SwimmingPool-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-155297750200096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.0K Feb 12 19:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 12 19:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 9 02:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 9 02:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 01:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K Feb 4 22:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 21:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 21:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 1 21:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 1 21:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 10 17:31 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1553106758183

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

FORMULA SwimmingPool-PT-06-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA SwimmingPool-PT-06-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SwimmingPool-PT-06-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA SwimmingPool-PT-06-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2771
rslt: Output for LTLCardinality @ SwimmingPool-PT-06

{
"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": "Wed Mar 20 18:32:38 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(Dressed <= Out)",
"processed_size": 16,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F ((Dress <= Cabins))))",
"processed_size": 29,
"rewrites": 18
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 254
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"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 (X (X (((Undress <= InBath) U (Dressed <= WaitBag)))))",
"processed_size": 56,
"rewrites": 18
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 274
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F ((InBath <= Dressed))))",
"processed_size": 31,
"rewrites": 18
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (X (F ((1 <= Entered)))))",
"processed_size": 30,
"rewrites": 18
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((F ((3 <= Cabins)) OR (G ((2 <= Bags)) AND F ((3 <= Cabins))))))",
"processed_size": 70,
"rewrites": 18
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (G ((2 <= Undress))))",
"processed_size": 26,
"rewrites": 18
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"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": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (G ((Bags <= Dressed))))",
"processed_size": 29,
"rewrites": 18
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((3 <= Dress)))",
"processed_size": 20,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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": 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 (F ((1 <= InBath))))",
"processed_size": 25,
"rewrites": 18
},
"result":
{
"edges": 43652,
"markings": 29379,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (F (G ((1 <= Cabins))))",
"processed_size": 25,
"rewrites": 18
},
"result":
{
"edges": 247,
"markings": 246,
"produced_by": "LTL model checker",
"value": false
},
"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": 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 ((Entered <= Dress))))",
"processed_size": 30,
"rewrites": 18
},
"result":
{
"edges": 1260,
"markings": 987,
"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": 1621
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F ((F ((3 <= Undress)) OR (G ((Entered <= Dress)) AND F ((3 <= Undress))))))",
"processed_size": 79,
"rewrites": 18
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3242
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 3,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((1 <= Dress) U (InBath <= Dressed)) U ((InBath <= Out) U (Dress <= Dressed))))",
"processed_size": 83,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 17068,
"runtime": 775.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(F(**))) : A((** U X(F(**)))) : A(G(F(**))) : A(X(F(**))) : A(X(X((** U **)))) : A(F(G(**))) : A(G(**)) : A(X(F(**))) : A(X(X(F(**)))) : A(F((F(**) OR (G(**) AND F(**))))) : A(X(G(**))) : A(X((F(**) OR (G(**) AND F(**))))) : A(X(G(**))) : A(((** U **) U (** U **))) : A(X(G(**))) : **"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no yes yes yes yes no no yes yes no unknown yes no yes no yes ",
"value": "no yes yes yes yes no no yes yes no unknown yes no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains 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 (X (F (F ((Entered <= Dress)))))) : A (((3 <= WaitBag) U F (X ((InBath <= Entered))))) : A (G (F ((1 <= InBath)))) : A (X (F ((Dress <= Cabins)))) : A (X ((X ((Undress <= InBath)) U X ((Dressed <= WaitBag))))) : A (G (G (F (G ((1 <= Cabins)))))) : A (G ((3 <= Dress))) : A (F (X (F (F ((InBath <= Dressed)))))) : A (F (X (X (F ((1 <= Entered)))))) : A (F ((G ((Entered <= Dress)) U F ((3 <= Undress))))) : A (X (G ((3 <= Out)))) : A (X ((G ((2 <= Bags)) U F ((3 <= Cabins))))) : A (X (G ((2 <= Undress)))) : A ((((1 <= Dress) U (InBath <= Dressed)) U ((InBath <= Out) U (Dress <= Dressed)))) : A (X (G ((Bags <= Dressed)))) : A ((Dressed <= Out))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Dressed <= Out)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= Out)
lola: processed formula length: 16
lola: 18 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((Dress <= Cabins))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Dress <= Cabins))))
lola: processed formula length: 29
lola: 18 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: 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((Undress <= InBath) U (Dressed <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((Undress <= InBath) U (Dressed <= WaitBag)))))
lola: processed formula length: 56
lola: 18 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((InBath <= Dressed))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((InBath <= Dressed))))
lola: processed formula length: 31
lola: 18 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: 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((1 <= Entered)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= Entered)))))
lola: processed formula length: 30
lola: 18 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: 15 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= Out))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= Out))))
lola: processed formula length: 22
lola: 18 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: 1772140 markings, 5785839 edges, 354428 markings/sec, 0 secs
lola: 3380031 markings, 11273616 edges, 321578 markings/sec, 5 secs
lola: 4571517 markings, 15385290 edges, 238297 markings/sec, 10 secs
lola: 5438895 markings, 18387331 edges, 173476 markings/sec, 15 secs
lola: 6260695 markings, 21250943 edges, 164360 markings/sec, 20 secs
lola: 7239255 markings, 24666711 edges, 195712 markings/sec, 25 secs
lola: 8501828 markings, 29096022 edges, 252515 markings/sec, 30 secs
lola: 9748126 markings, 33475007 edges, 249260 markings/sec, 35 secs
lola: 10977570 markings, 37808761 edges, 245889 markings/sec, 40 secs
lola: 12204606 markings, 42152961 edges, 245407 markings/sec, 45 secs
lola: 13411487 markings, 46427381 edges, 241376 markings/sec, 50 secs
lola: 14589922 markings, 50616430 edges, 235687 markings/sec, 55 secs
lola: 15764773 markings, 54793668 edges, 234970 markings/sec, 60 secs
lola: 16934795 markings, 58966198 edges, 234004 markings/sec, 65 secs
lola: 18097709 markings, 63119088 edges, 232583 markings/sec, 70 secs
lola: 19238693 markings, 67196516 edges, 228197 markings/sec, 75 secs
lola: 20337008 markings, 71132075 edges, 219663 markings/sec, 80 secs
lola: 21449147 markings, 75112060 edges, 222428 markings/sec, 85 secs
lola: 22547694 markings, 79051295 edges, 219709 markings/sec, 90 secs
lola: 23638795 markings, 82969752 edges, 218220 markings/sec, 95 secs
lola: 24718839 markings, 86847955 edges, 216009 markings/sec, 100 secs
lola: 25792513 markings, 90712197 edges, 214735 markings/sec, 105 secs
lola: 26882608 markings, 94635793 edges, 218019 markings/sec, 110 secs
lola: 27964209 markings, 98534846 edges, 216320 markings/sec, 115 secs
lola: 29035468 markings, 102394174 edges, 214252 markings/sec, 120 secs
lola: 30080759 markings, 106162140 edges, 209058 markings/sec, 125 secs
lola: 31126984 markings, 109935094 edges, 209245 markings/sec, 130 secs
lola: 32177995 markings, 113724604 edges, 210202 markings/sec, 135 secs
lola: 33205825 markings, 117434338 edges, 205566 markings/sec, 140 secs
lola: 34236615 markings, 121161424 edges, 206158 markings/sec, 145 secs
lola: 35271322 markings, 124910139 edges, 206941 markings/sec, 150 secs
lola: 36299390 markings, 128631598 edges, 205614 markings/sec, 155 secs
lola: 37327064 markings, 132347976 edges, 205535 markings/sec, 160 secs
lola: 38349046 markings, 136045155 edges, 204396 markings/sec, 165 secs
lola: 39364059 markings, 139720216 edges, 203003 markings/sec, 170 secs
lola: 40363991 markings, 143344803 edges, 199986 markings/sec, 175 secs
lola: 41359590 markings, 146955313 edges, 199120 markings/sec, 180 secs
lola: 42340175 markings, 150511564 edges, 196117 markings/sec, 185 secs
lola: 43323714 markings, 154087774 edges, 196708 markings/sec, 190 secs
lola: 44307928 markings, 157660854 edges, 196843 markings/sec, 195 secs
lola: 45288601 markings, 161219305 edges, 196135 markings/sec, 200 secs
lola: 46263340 markings, 164767436 edges, 194948 markings/sec, 205 secs
lola: 47254887 markings, 168368777 edges, 198309 markings/sec, 210 secs
lola: 48238188 markings, 171950936 edges, 196660 markings/sec, 215 secs
lola: 49220797 markings, 175525657 edges, 196522 markings/sec, 220 secs
lola: 50197960 markings, 179082238 edges, 195433 markings/sec, 225 secs
lola: 51181101 markings, 182660605 edges, 196628 markings/sec, 230 secs
lola: 52146177 markings, 186176343 edges, 193015 markings/sec, 235 secs
lola: 53120729 markings, 189722602 edges, 194910 markings/sec, 240 secs
lola: 54088578 markings, 193246403 edges, 193570 markings/sec, 245 secs
lola: 55062978 markings, 196790047 edges, 194880 markings/sec, 250 secs
lola: 56022936 markings, 200291946 edges, 191992 markings/sec, 255 secs
lola: 56982271 markings, 203790436 edges, 191867 markings/sec, 260 secs
lola: 57939162 markings, 207278288 edges, 191378 markings/sec, 265 secs
lola: 58902687 markings, 210797063 edges, 192705 markings/sec, 270 secs
lola: 59856875 markings, 214279380 edges, 190838 markings/sec, 275 secs
lola: 60814000 markings, 217779084 edges, 191425 markings/sec, 280 secs
lola: 61772370 markings, 221276960 edges, 191674 markings/sec, 285 secs
lola: 62726836 markings, 224766019 edges, 190893 markings/sec, 290 secs
lola: 63678523 markings, 228246817 edges, 190337 markings/sec, 295 secs
lola: 64629649 markings, 231727148 edges, 190225 markings/sec, 300 secs
lola: 65576061 markings, 235190780 edges, 189282 markings/sec, 305 secs
lola: 66503242 markings, 238588689 edges, 185436 markings/sec, 310 secs
lola: 67438661 markings, 242007505 edges, 187084 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown yes yes unknown unknown yes yes unknown unknown unknown unknown unknown unknown yes
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 (X ((F ((3 <= Cabins)) OR (G ((2 <= Bags)) AND F ((3 <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= Cabins)) OR (G ((2 <= Bags)) AND F ((3 <= Cabins))))))
lola: processed formula length: 70
lola: 18 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= Undress))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((2 <= Undress))))
lola: processed formula length: 26
lola: 18 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Bags <= Dressed))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Bags <= Dressed))))
lola: processed formula length: 29
lola: 18 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= WaitBag) U X (F ((InBath <= Entered)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= WaitBag) U X (F ((InBath <= Entered)))))
lola: processed formula length: 50
lola: 18 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Dress)))
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 ((3 <= Dress)))
lola: processed formula length: 20
lola: 20 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: SUBRESULT
lola: formula 0: (Dress <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to LTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= InBath))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= InBath))))
lola: processed formula length: 25
lola: 18 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: 29379 markings, 43652 edges
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= Cabins))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= Cabins))))
lola: processed formula length: 25
lola: 18 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: 246 markings, 247 edges
lola: ========================================
lola: subprocess 13 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Entered <= Dress))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Entered <= Dress))))
lola: processed formula length: 30
lola: 18 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: 987 markings, 1260 edges
lola: ========================================
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= Undress)) OR (G ((Entered <= Dress)) AND F ((3 <= Undress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((3 <= Undress)) OR (G ((Entered <= Dress)) AND F ((3 <= Undress))))))
lola: processed formula length: 79
lola: 18 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: 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 3242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= Dress) U (InBath <= Dressed)) U ((InBath <= Out) U (Dress <= Dressed))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= Dress) U (InBath <= Dressed)) U ((InBath <= Out) U (Dress <= Dressed))))
lola: processed formula length: 83
lola: 18 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: ========================================
lola: ...considering subproblem: A (X (G ((3 <= Out))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= Out))))
lola: processed formula length: 22
lola: 18 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: ========================================
sara: try reading problem file LTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: 1942289 markings, 6363224 edges, 388458 markings/sec, 0 secs
lola: 3544664 markings, 11838606 edges, 320475 markings/sec, 5 secs
lola: 4956529 markings, 16715677 edges, 282373 markings/sec, 10 secs
lola: 6300512 markings, 21389618 edges, 268797 markings/sec, 15 secs
lola: 7571610 markings, 25829406 edges, 254220 markings/sec, 20 secs
lola: 8840040 markings, 30280425 edges, 253686 markings/sec, 25 secs
lola: 10092047 markings, 34686630 edges, 250401 markings/sec, 30 secs
lola: 11329323 markings, 39055823 edges, 247455 markings/sec, 35 secs
lola: 12550334 markings, 43376524 edges, 244202 markings/sec, 40 secs
lola: 13759460 markings, 47661436 edges, 241825 markings/sec, 45 secs
lola: 14949429 markings, 51891837 edges, 237994 markings/sec, 50 secs
lola: 16120793 markings, 56066746 edges, 234273 markings/sec, 55 secs
lola: 17278733 markings, 60196926 edges, 231588 markings/sec, 60 secs
lola: 18424990 markings, 64286891 edges, 229251 markings/sec, 65 secs
lola: 19553498 markings, 68324346 edges, 225702 markings/sec, 70 secs
lola: 20645902 markings, 72236259 edges, 218481 markings/sec, 75 secs
lola: 21732217 markings, 76128021 edges, 217263 markings/sec, 80 secs
lola: 22809873 markings, 79992510 edges, 215531 markings/sec, 85 secs
lola: 23872487 markings, 83808893 edges, 212523 markings/sec, 90 secs
lola: 24957687 markings, 87708923 edges, 217040 markings/sec, 95 secs
lola: 26025295 markings, 91550708 edges, 213522 markings/sec, 100 secs
lola: 27068492 markings, 95304921 edges, 208639 markings/sec, 105 secs
lola: 28123828 markings, 99111622 edges, 211067 markings/sec, 110 secs
lola: 29169880 markings, 102877815 edges, 209210 markings/sec, 115 secs
lola: 30212312 markings, 106637968 edges, 208486 markings/sec, 120 secs
lola: 31248961 markings, 110372763 edges, 207330 markings/sec, 125 secs
lola: 32279768 markings, 114093597 edges, 206161 markings/sec, 130 secs
lola: 33313653 markings, 117824655 edges, 206777 markings/sec, 135 secs
lola: 34346516 markings, 121560480 edges, 206573 markings/sec, 140 secs
lola: 35372314 markings, 125277687 edges, 205160 markings/sec, 145 secs
lola: 36388803 markings, 128955232 edges, 203298 markings/sec, 150 secs
lola: 37405113 markings, 132630922 edges, 203262 markings/sec, 155 secs
lola: 38393765 markings, 136206888 edges, 197730 markings/sec, 160 secs
lola: 39390539 markings, 139815627 edges, 199355 markings/sec, 165 secs
lola: 40376472 markings, 143389800 edges, 197187 markings/sec, 170 secs
lola: 41360267 markings, 146957832 edges, 196759 markings/sec, 175 secs
lola: 42324183 markings, 150454397 edges, 192783 markings/sec, 180 secs
lola: 43275752 markings, 153912995 edges, 190314 markings/sec, 185 secs
lola: 44223246 markings, 157353453 edges, 189499 markings/sec, 190 secs
lola: 45154754 markings, 160733372 edges, 186302 markings/sec, 195 secs
lola: 46095094 markings, 164154493 edges, 188068 markings/sec, 200 secs
lola: 47037878 markings, 167584027 edges, 188557 markings/sec, 205 secs
lola: 47978587 markings, 171005534 edges, 188142 markings/sec, 210 secs
lola: 48943292 markings, 174513620 edges, 192941 markings/sec, 215 secs
lola: 49894752 markings, 177976865 edges, 190292 markings/sec, 220 secs
lola: 50847272 markings, 181448866 edges, 190504 markings/sec, 225 secs
lola: 51789659 markings, 184877009 edges, 188477 markings/sec, 230 secs
lola: 52715532 markings, 188246527 edges, 185175 markings/sec, 235 secs
lola: 53648534 markings, 191643637 edges, 186600 markings/sec, 240 secs
lola: 54578910 markings, 195028900 edges, 186075 markings/sec, 245 secs
lola: 55485609 markings, 198332345 edges, 181340 markings/sec, 250 secs
lola: 56363925 markings, 201534290 edges, 175663 markings/sec, 255 secs
lola: 57237395 markings, 204720211 edges, 174694 markings/sec, 260 secs
lola: 58113828 markings, 207917413 edges, 175287 markings/sec, 265 secs
lola: 58980492 markings, 211081966 edges, 173333 markings/sec, 270 secs
lola: 59849352 markings, 214251832 edges, 173772 markings/sec, 275 secs
lola: 60714574 markings, 217414711 edges, 173044 markings/sec, 280 secs
lola: 61580649 markings, 220579499 edges, 173215 markings/sec, 285 secs
lola: 62441950 markings, 223725538 edges, 172260 markings/sec, 290 secs
lola: 63301532 markings, 226870476 edges, 171916 markings/sec, 295 secs
lola: 64157948 markings, 230000953 edges, 171283 markings/sec, 300 secs
lola: 65039574 markings, 233225048 edges, 176325 markings/sec, 305 secs
lola: 65927315 markings, 236479018 edges, 177548 markings/sec, 310 secs
lola: 66810884 markings, 239712670 edges, 176714 markings/sec, 315 secs
lola: 67695448 markings, 242948764 edges, 176913 markings/sec, 320 secs
lola: 68580182 markings, 246177717 edges, 176947 markings/sec, 325 secs
lola: 69450766 markings, 249368448 edges, 174117 markings/sec, 330 secs
lola: 70306389 markings, 252506377 edges, 171125 markings/sec, 335 secs
lola: 71172412 markings, 255678579 edges, 173205 markings/sec, 340 secs
lola: 72031088 markings, 258823475 edges, 171735 markings/sec, 345 secs
lola: 72897558 markings, 262003355 edges, 173294 markings/sec, 350 secs
lola: 73765457 markings, 265190770 edges, 173580 markings/sec, 355 secs
lola: 74628938 markings, 268360154 edges, 172696 markings/sec, 360 secs
lola: 75467555 markings, 271435341 edges, 167723 markings/sec, 365 secs
lola: 76326465 markings, 274588384 edges, 171782 markings/sec, 370 secs
lola: 77193664 markings, 277773480 edges, 173440 markings/sec, 375 secs
lola: 78062549 markings, 280960284 edges, 173777 markings/sec, 380 secs
lola: 78931866 markings, 284150043 edges, 173863 markings/sec, 385 secs
lola: 79796003 markings, 287323801 edges, 172827 markings/sec, 390 secs
lola: 80661446 markings, 290500982 edges, 173089 markings/sec, 395 secs
lola: 81523250 markings, 293668424 edges, 172361 markings/sec, 400 secs
lola: 82389679 markings, 296854050 edges, 173286 markings/sec, 405 secs
lola: 83250852 markings, 300021770 edges, 172235 markings/sec, 410 secs
lola: 84110393 markings, 303183758 edges, 171908 markings/sec, 415 secs
lola: 84973894 markings, 306353676 edges, 172700 markings/sec, 420 secs
lola: 85833539 markings, 309518280 edges, 171929 markings/sec, 425 secs
lola: 86698033 markings, 312691878 edges, 172899 markings/sec, 430 secs
lola: 87519162 markings, 315711455 edges, 164226 markings/sec, 435 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no no yes yes no unknown yes no yes no yes
lola:
preliminary result: no yes yes yes yes no no yes yes no unknown yes no yes no yes
lola: memory consumption: 17068 KB
lola: time consumption: 775 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1553107557349

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is SwimmingPool-PT-06, 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 r170-oct2-155297750200096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-06.tgz
mv SwimmingPool-PT-06 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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
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 ;