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-159033411700049.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 Solitaire-PT-SqrNC5x5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411700049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 9 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 66K Apr 27 15:14 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 Solitaire-PT-SqrNC5x5-00
FORMULA_NAME Solitaire-PT-SqrNC5x5-01
FORMULA_NAME Solitaire-PT-SqrNC5x5-02
FORMULA_NAME Solitaire-PT-SqrNC5x5-03
FORMULA_NAME Solitaire-PT-SqrNC5x5-04
FORMULA_NAME Solitaire-PT-SqrNC5x5-05
FORMULA_NAME Solitaire-PT-SqrNC5x5-06
FORMULA_NAME Solitaire-PT-SqrNC5x5-07
FORMULA_NAME Solitaire-PT-SqrNC5x5-08
FORMULA_NAME Solitaire-PT-SqrNC5x5-09
FORMULA_NAME Solitaire-PT-SqrNC5x5-10
FORMULA_NAME Solitaire-PT-SqrNC5x5-11
FORMULA_NAME Solitaire-PT-SqrNC5x5-12
FORMULA_NAME Solitaire-PT-SqrNC5x5-13
FORMULA_NAME Solitaire-PT-SqrNC5x5-14
FORMULA_NAME Solitaire-PT-SqrNC5x5-15

=== Now, execution of the tool begins

BK_START 1590644118585

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Solitaire-PT-SqrNC5x5 @ 3570 seconds

FORMULA Solitaire-PT-SqrNC5x5-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Solitaire-PT-SqrNC5x5-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-SqrNC5x5-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2564
rslt: Output for LTLCardinality @ Solitaire-PT-SqrNC5x5

{
"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:35:18 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": "TRUE",
"processed_size": 4,
"rewrites": 134
},
"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": 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": 134
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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 (X (G (((F56 + 1 <= F22) OR (T65 <= 0)))))",
"processed_size": 45,
"rewrites": 134
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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 ((T56 <= F46)))",
"processed_size": 20,
"rewrites": 134
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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 ((F45 <= F25)))",
"processed_size": 20,
"rewrites": 134
},
"result":
{
"edges": 30,
"markings": 30,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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 (G ((F34 + 1 <= F24)))",
"processed_size": 24,
"rewrites": 136
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((T62 <= F25))))",
"processed_size": 24,
"rewrites": 134
},
"result":
{
"edges": 456980169,
"markings": 25915069,
"produced_by": "LTL model checker",
"value": true
},
"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": 601
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((F36 <= F23))))",
"processed_size": 24,
"rewrites": 134
},
"result":
{
"edges": 322260459,
"markings": 26012570,
"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": 641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((F55 <= T33))))",
"processed_size": 24,
"rewrites": 134
},
"result":
{
"edges": 24,
"markings": 23,
"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": 854
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((F23 <= T64) OR F (((T33 <= F62) AND (T33 <= F62)))) U (F62 + 1 <= T33)))",
"processed_size": 78,
"rewrites": 134
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 1282
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F ((((F52 <= T34) AND (1 <= F63)) AND F ((1 <= F43)))))",
"processed_size": 58,
"rewrites": 134
},
"result":
{
"edges": 118,
"markings": 113,
"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": 2564
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2564
},
"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 <= T63))))",
"processed_size": 22,
"rewrites": 134
},
"result":
{
"edges": 25,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"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": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 27004,
"runtime": 1006.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G(((X(*) R *) AND X((* AND X(*))))))) : A(X(**)) : (A(G(F(**))) AND A(F(G(**)))) : TRUE : FALSE : A(F(G(**))) : A(F(**)) : A(G(*)) : A(X(G(*))) : TRUE : A(((** OR F((** AND **))) U **)) : (A(X(**)) AND A(X(X(F(*))))) : A(F(G(**))) : A(G(F(**))) : TRUE : A(F((** AND F(**))))"
},
"net":
{
"arcs": 456,
"conflict_clusters": 1,
"places": 50,
"places_significant": 25,
"singleton_clusters": 0,
"transitions": 84
},
"result":
{
"preliminary_value": "no no no yes no no yes no no yes yes no yes yes yes no ",
"value": "no no no yes no no yes no no yes yes no yes yes 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: 134/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1600
lola: finding significant places
lola: 50 places, 84 transitions, 25 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= F32)
lola: LP says that atomic proposition is always false: (3 <= F44)
lola: LP says that atomic proposition is always false: (2 <= T23)
lola: LP says that atomic proposition is always false: (3 <= F55)
lola: LP says that atomic proposition is always false: (3 <= F55)
lola: LP says that atomic proposition is always false: (2 <= T54)
lola: LP says that atomic proposition is always false: (2 <= T54)
lola: LP says that atomic proposition is always false: (3 <= F52)
lola: LP says that atomic proposition is always false: (2 <= T52)
lola: LP says that atomic proposition is always false: (2 <= T52)
lola: LP says that atomic proposition is always false: (3 <= T56)
lola: LP says that atomic proposition is always false: (3 <= T56)
lola: LP says that atomic proposition is always false: (3 <= F22)
lola: LP says that atomic proposition is always false: (3 <= F35)
lola: LP says that atomic proposition is always false: (3 <= T54)
lola: LP says that atomic proposition is always false: (3 <= F62)
lola: LP says that atomic proposition is always false: (3 <= T62)
lola: LP says that atomic proposition is always false: (3 <= F62)
lola: A (G (NOT(X (((((0 <= T56) AND X ((F43 <= F66))) U (T64 <= F66)) OR X (((T45 <= F65) OR X ((T64 <= F66))))))))) : A ((((2 <= F32) AND G (((F46 <= F55) OR (T63 <= T52)))) U X ((X ((3 <= F44)) U (F45 <= F25))))) : A (X ((G ((G (F (X ((F46 <= F24)))) OR G ((2 <= T23)))) AND F (G ((1 <= T63)))))) : A ((NOT(F (())) OR (G (F ((F55 <= 2))) AND G (X (G ((T62 <= T66))))))) : A (X ((F (((T54 <= 1) AND (G ((T34 <= T55)) OR F ((1 <= F43))))) AND G (F ((2 <= T54)))))) : A (NOT(X (NOT(F (((3 <= F52) OR G (X (X (G (X ((F55 <= T33)))))))))))) : A ((((X ((T55 <= T26)) U G ((0 <= T32))) OR X (((T52 <= 1) U (2 <= T52)))) U (F64 <= F42))) : A ((F ((3 <= T56)) OR (F ((3 <= T56)) U NOT(((3 <= F22) U F ((F24 <= F34))))))) : A (G (X (NOT(F (((F ((F22 <= F56)) OR G (((0 <= T56) U (1 <= T65)))) U ((F22 <= F56) AND (1 <= T65)))))))) : A (((0 <= T53) OR G (X ((0 <= T62))))) : A ((((F23 <= T64) OR F (((T33 <= F62) AND ((T33 <= F62) OR G ((3 <= F35)))))) U (F62 + 1 <= T33))) : A (X (((T56 <= F46) AND NOT(X ((() AND G ((T56 <= F46)))))))) : A (F (G (X ((T62 <= F25))))) : A (F (G (X ((F (G ((0 <= F65))) U (G (X ((F23 + 1 <= F36))) U F ((F36 <= F23)))))))) : A ((() U NOT(((F46 <= T34) AND F (((3 <= T62) U (3 <= F62))))))) : A (F ((((F52 <= T34) U X ((1 <= F63))) U (((F52 <= T34) AND (1 <= F63)) AND F ((1 <= F43))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:551
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 134 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 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: 134 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 134 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 134 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((F56 + 1 <= F22) OR (T65 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((F56 + 1 <= F22) OR (T65 <= 0)))))
lola: processed formula length: 45
lola: 134 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((X ((F66 + 1 <= F43)) R (F66 + 1 <= T64)) AND X (((F65 + 1 <= T45) AND X ((F66 + 1 <= T64))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((X ((F66 + 1 <= F43)) R (F66 + 1 <= T64)) AND X (((F65 + 1 <= T45) AND X ((F66 + 1 <= T64))))))))
lola: processed formula length: 107
lola: 134 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((T56 <= F46))) AND A (X (X (F ((F46 + 1 <= T56))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((T56 <= F46)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((T56 <= F46)))
lola: processed formula length: 20
lola: 134 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: 23 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X ((F45 <= F25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F45 <= F25)))
lola: processed formula length: 20
lola: 134 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: 30 markings, 30 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F34 + 1 <= F24)))
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:788
lola: processed formula: A (G ((F34 + 1 <= F24)))
lola: processed formula length: 24
lola: 136 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (F24 <= F34)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F64 <= F42)))
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: (F42 + 1 <= F64)
lola: processed formula length: 16
lola: 136 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((T62 <= F25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((T62 <= F25))))
lola: processed formula length: 24
lola: 134 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: 548145 markings, 4573566 edges, 109629 markings/sec, 0 secs
lola: 1012930 markings, 9280800 edges, 92957 markings/sec, 5 secs
lola: 1441412 markings, 13966892 edges, 85696 markings/sec, 10 secs
lola: 1814043 markings, 18611668 edges, 74526 markings/sec, 15 secs
lola: 2191048 markings, 23167253 edges, 75401 markings/sec, 20 secs
lola: 2529773 markings, 27366749 edges, 67745 markings/sec, 25 secs
lola: 2854068 markings, 31869729 edges, 64859 markings/sec, 30 secs
lola: 3182592 markings, 36265912 edges, 65705 markings/sec, 35 secs
lola: 3480971 markings, 40313725 edges, 59676 markings/sec, 40 secs
lola: 3780575 markings, 44551613 edges, 59921 markings/sec, 45 secs
lola: 4056278 markings, 48769349 edges, 55141 markings/sec, 50 secs
lola: 4346656 markings, 52952114 edges, 58076 markings/sec, 55 secs
lola: 4672575 markings, 57607321 edges, 65184 markings/sec, 60 secs
lola: 4979633 markings, 62155212 edges, 61412 markings/sec, 65 secs
lola: 5303051 markings, 66708346 edges, 64684 markings/sec, 70 secs
lola: 5682844 markings, 71332520 edges, 75959 markings/sec, 75 secs
lola: 6018153 markings, 75915896 edges, 67062 markings/sec, 80 secs
lola: 6297356 markings, 80051549 edges, 55841 markings/sec, 85 secs
lola: 6593631 markings, 84004292 edges, 59255 markings/sec, 90 secs
lola: 6858184 markings, 88230358 edges, 52911 markings/sec, 95 secs
lola: 7163383 markings, 92518737 edges, 61040 markings/sec, 100 secs
lola: 7467447 markings, 97022690 edges, 60813 markings/sec, 105 secs
lola: 7763386 markings, 101700912 edges, 59188 markings/sec, 110 secs
lola: 8051920 markings, 106087785 edges, 57707 markings/sec, 115 secs
lola: 8323069 markings, 110690671 edges, 54230 markings/sec, 120 secs
lola: 8614827 markings, 115426795 edges, 58352 markings/sec, 125 secs
lola: 8894541 markings, 119873056 edges, 55943 markings/sec, 130 secs
lola: 9172650 markings, 124296591 edges, 55622 markings/sec, 135 secs
lola: 9431105 markings, 128653681 edges, 51691 markings/sec, 140 secs
lola: 9676491 markings, 132976123 edges, 49077 markings/sec, 145 secs
lola: 9919376 markings, 137125511 edges, 48577 markings/sec, 150 secs
lola: 10147709 markings, 141265482 edges, 45667 markings/sec, 155 secs
lola: 10381066 markings, 145625545 edges, 46671 markings/sec, 160 secs
lola: 10640448 markings, 150050971 edges, 51876 markings/sec, 165 secs
lola: 10876587 markings, 154255976 edges, 47228 markings/sec, 170 secs
lola: 11091648 markings, 158479697 edges, 43012 markings/sec, 175 secs
lola: 11330934 markings, 162597359 edges, 47857 markings/sec, 180 secs
lola: 11577072 markings, 166640363 edges, 49228 markings/sec, 185 secs
lola: 11840837 markings, 170873018 edges, 52753 markings/sec, 190 secs
lola: 12109014 markings, 174998328 edges, 53635 markings/sec, 195 secs
lola: 12355422 markings, 179109261 edges, 49282 markings/sec, 200 secs
lola: 12592256 markings, 183488012 edges, 47367 markings/sec, 205 secs
lola: 12862569 markings, 188063831 edges, 54063 markings/sec, 210 secs
lola: 13109677 markings, 192464693 edges, 49422 markings/sec, 215 secs
lola: 13345839 markings, 196980155 edges, 47232 markings/sec, 220 secs
lola: 13578875 markings, 201558637 edges, 46607 markings/sec, 225 secs
lola: 13792984 markings, 205658928 edges, 42822 markings/sec, 230 secs
lola: 14042780 markings, 209743326 edges, 49959 markings/sec, 235 secs
lola: 14265505 markings, 213771474 edges, 44545 markings/sec, 240 secs
lola: 14493043 markings, 217856562 edges, 45508 markings/sec, 245 secs
lola: 14704943 markings, 221955862 edges, 42380 markings/sec, 250 secs
lola: 14918401 markings, 226223836 edges, 42692 markings/sec, 255 secs
lola: 15124341 markings, 230617112 edges, 41188 markings/sec, 260 secs
lola: 15344766 markings, 234540803 edges, 44085 markings/sec, 265 secs
lola: 15549550 markings, 238323179 edges, 40957 markings/sec, 270 secs
lola: 15781109 markings, 242103434 edges, 46312 markings/sec, 275 secs
lola: 15990717 markings, 245963264 edges, 41922 markings/sec, 280 secs
lola: 16200695 markings, 249824944 edges, 41996 markings/sec, 285 secs
lola: 16400909 markings, 253730272 edges, 40043 markings/sec, 290 secs
lola: 16618644 markings, 257518826 edges, 43547 markings/sec, 295 secs
lola: 16828809 markings, 261431366 edges, 42033 markings/sec, 300 secs
lola: 17038885 markings, 265316880 edges, 42015 markings/sec, 305 secs
lola: 17233132 markings, 269191182 edges, 38849 markings/sec, 310 secs
lola: 17421960 markings, 273137626 edges, 37766 markings/sec, 315 secs
lola: 17611948 markings, 276955906 edges, 37998 markings/sec, 320 secs
lola: 17811696 markings, 280902360 edges, 39950 markings/sec, 325 secs
lola: 18014208 markings, 284976260 edges, 40502 markings/sec, 330 secs
lola: 18200357 markings, 289066398 edges, 37230 markings/sec, 335 secs
lola: 18388695 markings, 293036544 edges, 37668 markings/sec, 340 secs
lola: 18574249 markings, 297223751 edges, 37111 markings/sec, 345 secs
lola: 18769033 markings, 301011397 edges, 38957 markings/sec, 350 secs
lola: 18963478 markings, 304920691 edges, 38889 markings/sec, 355 secs
lola: 19144515 markings, 309000369 edges, 36207 markings/sec, 360 secs
lola: 19316402 markings, 312369827 edges, 34377 markings/sec, 365 secs
lola: 19527294 markings, 316263341 edges, 42178 markings/sec, 370 secs
lola: 19727791 markings, 320493658 edges, 40099 markings/sec, 375 secs
lola: 19939447 markings, 324456270 edges, 42331 markings/sec, 380 secs
lola: 20131544 markings, 328471253 edges, 38419 markings/sec, 385 secs
lola: 20312087 markings, 332391291 edges, 36109 markings/sec, 390 secs
lola: 20503991 markings, 336151150 edges, 38381 markings/sec, 395 secs
lola: 20685187 markings, 339839080 edges, 36239 markings/sec, 400 secs
lola: 20861010 markings, 343535236 edges, 35165 markings/sec, 405 secs
lola: 21032913 markings, 347181388 edges, 34381 markings/sec, 410 secs
lola: 21206171 markings, 350936213 edges, 34652 markings/sec, 415 secs
lola: 21388492 markings, 354721497 edges, 36464 markings/sec, 420 secs
lola: 21571114 markings, 358777206 edges, 36524 markings/sec, 425 secs
lola: 21743370 markings, 362919683 edges, 34451 markings/sec, 430 secs
lola: 21912665 markings, 366979000 edges, 33859 markings/sec, 435 secs
lola: 22084942 markings, 371030986 edges, 34455 markings/sec, 440 secs
lola: 22255249 markings, 374915868 edges, 34061 markings/sec, 445 secs
lola: 22431991 markings, 378999618 edges, 35348 markings/sec, 450 secs
lola: 22612146 markings, 383162213 edges, 36031 markings/sec, 455 secs
lola: 22785097 markings, 387010327 edges, 34590 markings/sec, 460 secs
lola: 22959141 markings, 391038927 edges, 34809 markings/sec, 465 secs
lola: 23127283 markings, 394807517 edges, 33628 markings/sec, 470 secs
lola: 23286349 markings, 398677308 edges, 31813 markings/sec, 475 secs
lola: 23447383 markings, 402559042 edges, 32207 markings/sec, 480 secs
lola: 23598556 markings, 406658702 edges, 30235 markings/sec, 485 secs
lola: 23790224 markings, 410552116 edges, 38334 markings/sec, 490 secs
lola: 23989683 markings, 414186672 edges, 39892 markings/sec, 495 secs
lola: 24180732 markings, 418040507 edges, 38210 markings/sec, 500 secs
lola: 24362665 markings, 421835306 edges, 36387 markings/sec, 505 secs
lola: 24541148 markings, 425587024 edges, 35697 markings/sec, 510 secs
lola: 24715272 markings, 428939242 edges, 34825 markings/sec, 515 secs
lola: 24878073 markings, 432628100 edges, 32560 markings/sec, 520 secs
lola: 25050582 markings, 436216806 edges, 34502 markings/sec, 525 secs
lola: 25213712 markings, 440033823 edges, 32626 markings/sec, 530 secs
lola: 25388536 markings, 443906245 edges, 34965 markings/sec, 535 secs
lola: 25556193 markings, 448119002 edges, 33531 markings/sec, 540 secs
lola: 25712297 markings, 451918549 edges, 31221 markings/sec, 545 secs
lola: 25861417 markings, 455683946 edges, 29824 markings/sec, 550 secs
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: 25915069 markings, 456980169 edges
lola: ========================================
lola: subprocess 11 will run for 601 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((F36 <= F23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((F36 <= F23))))
lola: processed formula length: 24
lola: 134 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: 670013 markings, 4187852 edges, 134003 markings/sec, 0 secs
lola: 1215058 markings, 8423417 edges, 109009 markings/sec, 5 secs
lola: 1740573 markings, 12677993 edges, 105103 markings/sec, 10 secs
lola: 2201728 markings, 16902454 edges, 92231 markings/sec, 15 secs
lola: 2665110 markings, 21065796 edges, 92676 markings/sec, 20 secs
lola: 3097001 markings, 25234316 edges, 86378 markings/sec, 25 secs
lola: 3568624 markings, 28931287 edges, 94325 markings/sec, 30 secs
lola: 3894227 markings, 33251191 edges, 65121 markings/sec, 35 secs
lola: 4315544 markings, 36996396 edges, 84263 markings/sec, 40 secs
lola: 4623016 markings, 41281875 edges, 61494 markings/sec, 45 secs
lola: 4996505 markings, 45302597 edges, 74698 markings/sec, 50 secs
lola: 5370184 markings, 49476248 edges, 74736 markings/sec, 55 secs
lola: 5724101 markings, 53638793 edges, 70783 markings/sec, 60 secs
lola: 6166089 markings, 57647421 edges, 88398 markings/sec, 65 secs
lola: 6556842 markings, 61496562 edges, 78151 markings/sec, 70 secs
lola: 6899436 markings, 65352972 edges, 68519 markings/sec, 75 secs
lola: 7274067 markings, 69342139 edges, 74926 markings/sec, 80 secs
lola: 7618060 markings, 73415578 edges, 68799 markings/sec, 85 secs
lola: 8000009 markings, 77219587 edges, 76390 markings/sec, 90 secs
lola: 8374660 markings, 81098327 edges, 74930 markings/sec, 95 secs
lola: 8715079 markings, 84769102 edges, 68084 markings/sec, 100 secs
lola: 9080359 markings, 88324306 edges, 73056 markings/sec, 105 secs
lola: 9409798 markings, 91934197 edges, 65888 markings/sec, 110 secs
lola: 9690866 markings, 95763047 edges, 56214 markings/sec, 115 secs
lola: 10034571 markings, 99308118 edges, 68741 markings/sec, 120 secs
lola: 10316187 markings, 103265838 edges, 56323 markings/sec, 125 secs
lola: 10634398 markings, 107070787 edges, 63642 markings/sec, 130 secs
lola: 10931974 markings, 110844831 edges, 59515 markings/sec, 135 secs
lola: 11240219 markings, 114735493 edges, 61649 markings/sec, 140 secs
lola: 11536604 markings, 118670924 edges, 59277 markings/sec, 145 secs
lola: 11882982 markings, 122471937 edges, 69276 markings/sec, 150 secs
lola: 12201079 markings, 126385184 edges, 63619 markings/sec, 155 secs
lola: 12515067 markings, 130297457 edges, 62798 markings/sec, 160 secs
lola: 12815376 markings, 133928876 edges, 60062 markings/sec, 165 secs
lola: 13086442 markings, 137591194 edges, 54213 markings/sec, 170 secs
lola: 13382895 markings, 141174324 edges, 59291 markings/sec, 175 secs
lola: 13677839 markings, 144772575 edges, 58989 markings/sec, 180 secs
lola: 13972596 markings, 148454730 edges, 58951 markings/sec, 185 secs
lola: 14247722 markings, 151985705 edges, 55025 markings/sec, 190 secs
lola: 14541555 markings, 155566036 edges, 58767 markings/sec, 195 secs
lola: 14809206 markings, 159067450 edges, 53530 markings/sec, 200 secs
lola: 15077526 markings, 162667285 edges, 53664 markings/sec, 205 secs
lola: 15340244 markings, 166105166 edges, 52544 markings/sec, 210 secs
lola: 15655289 markings, 169384136 edges, 63009 markings/sec, 215 secs
lola: 15888337 markings, 173269921 edges, 46610 markings/sec, 220 secs
lola: 16251626 markings, 176305201 edges, 72658 markings/sec, 225 secs
lola: 16487312 markings, 180152756 edges, 47137 markings/sec, 230 secs
lola: 16729947 markings, 184002271 edges, 48527 markings/sec, 235 secs
lola: 16979398 markings, 187625720 edges, 49890 markings/sec, 240 secs
lola: 17253154 markings, 191288904 edges, 54751 markings/sec, 245 secs
lola: 17502773 markings, 194921130 edges, 49924 markings/sec, 250 secs
lola: 17766327 markings, 198540630 edges, 52711 markings/sec, 255 secs
lola: 18013075 markings, 202045239 edges, 49350 markings/sec, 260 secs
lola: 18239022 markings, 205603273 edges, 45189 markings/sec, 265 secs
lola: 18471902 markings, 209108202 edges, 46576 markings/sec, 270 secs
lola: 18730207 markings, 212837644 edges, 51661 markings/sec, 275 secs
lola: 18962360 markings, 216349834 edges, 46431 markings/sec, 280 secs
lola: 19200098 markings, 219900811 edges, 47548 markings/sec, 285 secs
lola: 19447357 markings, 223496925 edges, 49452 markings/sec, 290 secs
lola: 19689121 markings, 227053401 edges, 48353 markings/sec, 295 secs
lola: 19904855 markings, 230414251 edges, 43147 markings/sec, 300 secs
lola: 20165320 markings, 233817650 edges, 52093 markings/sec, 305 secs
lola: 20435445 markings, 237256881 edges, 54025 markings/sec, 310 secs
lola: 20683841 markings, 240477097 edges, 49679 markings/sec, 315 secs
lola: 20933152 markings, 243920216 edges, 49862 markings/sec, 320 secs
lola: 21158381 markings, 247211032 edges, 45046 markings/sec, 325 secs
lola: 21380706 markings, 250412456 edges, 44465 markings/sec, 330 secs
lola: 21603490 markings, 253630964 edges, 44557 markings/sec, 335 secs
lola: 21837275 markings, 257043897 edges, 46757 markings/sec, 340 secs
lola: 22068130 markings, 260496437 edges, 46171 markings/sec, 345 secs
lola: 22290088 markings, 263860094 edges, 44392 markings/sec, 350 secs
lola: 22500795 markings, 267081449 edges, 42141 markings/sec, 355 secs
lola: 22726966 markings, 270253139 edges, 45234 markings/sec, 360 secs
lola: 22947705 markings, 273393701 edges, 44148 markings/sec, 365 secs
lola: 23166384 markings, 276686283 edges, 43736 markings/sec, 370 secs
lola: 23365546 markings, 279809997 edges, 39832 markings/sec, 375 secs
lola: 23560656 markings, 282921422 edges, 39022 markings/sec, 380 secs
lola: 23792959 markings, 286373850 edges, 46461 markings/sec, 385 secs
lola: 24038930 markings, 289665171 edges, 49194 markings/sec, 390 secs
lola: 24241498 markings, 293212265 edges, 40514 markings/sec, 395 secs
lola: 24451172 markings, 296687101 edges, 41935 markings/sec, 400 secs
lola: 24659785 markings, 300168240 edges, 41723 markings/sec, 405 secs
lola: 24866978 markings, 303445792 edges, 41439 markings/sec, 410 secs
lola: 25066456 markings, 306644670 edges, 39896 markings/sec, 415 secs
lola: 25264146 markings, 310128473 edges, 39538 markings/sec, 420 secs
lola: 25474760 markings, 313479950 edges, 42123 markings/sec, 425 secs
lola: 25686646 markings, 316888079 edges, 42377 markings/sec, 430 secs
lola: 25877770 markings, 320015922 edges, 38225 markings/sec, 435 secs
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: 26012570 markings, 322260459 edges
lola: ========================================
lola: subprocess 12 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F55 <= T33))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F55 <= T33))))
lola: processed formula length: 24
lola: 134 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: 23 markings, 24 edges
lola: ========================================
lola: subprocess 13 will run for 854 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((F23 <= T64) OR F (((T33 <= F62) AND (T33 <= F62)))) U (F62 + 1 <= T33)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((F23 <= T64) OR F (((T33 <= F62) AND (T33 <= F62)))) U (F62 + 1 <= T33)))
lola: processed formula length: 78
lola: 134 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 14 will run for 1282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((F52 <= T34) AND (1 <= F63)) AND F ((1 <= F43)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((((F52 <= T34) AND (1 <= F63)) AND F ((1 <= F43)))))
lola: processed formula length: 58
lola: 134 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: 113 markings, 118 edges
lola: ========================================
lola: subprocess 15 will run for 2564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((F46 <= F24)))) AND A (F (G ((1 <= T63)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= T63))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= T63))))
lola: processed formula length: 22
lola: 134 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: 24 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no yes no no yes yes no yes yes yes no
lola:
preliminary result: no no no yes no no yes no no yes yes no yes yes yes no
lola: memory consumption: 27004 KB
lola: time consumption: 1006 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590645124249

--------------------
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="Solitaire-PT-SqrNC5x5"
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 Solitaire-PT-SqrNC5x5, 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-159033411700049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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