Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 3.7K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 12:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 218K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1590263518466

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-100100 @ 3570 seconds

FORMULA RefineWMG-PT-100100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2164
rslt: Output for LTLCardinality @ RefineWMG-PT-100100

{
"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": "Sat May 23 19:51:58 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 231
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((F ((p247 <= p449)) U ((p449 + 1 <= p247) OR (p309 <= p136))) OR ((p309 <= p136) U G (((p247 <= p449) AND X ((3 <= p97)))))))",
"processed_size": 130,
"rewrites": 113
},
"result":
{
"edges": 101,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 287
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((F (G ((p23 <= p433))) OR X (F ((p392 <= p82)))))",
"processed_size": 52,
"rewrites": 113
},
"result":
{
"edges": 101,
"markings": 102,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 371
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 371
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p479 <= p209)))",
"processed_size": 22,
"rewrites": 115
},
"result":
{
"edges": 1,
"markings": 2,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"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": "(p209 <= p174)",
"processed_size": 14,
"rewrites": 113
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 957
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F ((((p267 <= 0) AND ((p438 + 1 <= p125) OR (1 <= p122))) AND F ((p125 <= p438)))))",
"processed_size": 87,
"rewrites": 113
},
"result":
{
"edges": 7,
"markings": 7,
"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": 1436
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2873
},
"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 ((p439 + 1 <= p366)))",
"processed_size": 26,
"rewrites": 115
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2873
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p320 <= p198) OR (p210 <= p249))",
"processed_size": 35,
"rewrites": 115
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24128,
"runtime": 1382.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G(*))) : A(((F(**) U **) OR (** U G((** AND X(**)))))) : A(X(F((G((F(**) AND (** OR **))) AND (* OR G(*)))))) : A(G(F((* OR (X(*) R *))))) : A(G(F((X(**) OR (F(*) AND F(G(*))))))) : A((F(G(**)) OR X(F(**)))) : A((X((** AND G(**))) OR F(G(**)))) : (A(G(*)) AND A(F(**))) : A(X((* R (X(G(*)) R *)))) : (A(G(**)) AND A(X(G(**)))) : (** AND (A(F(**)) AND A(X(F(*))))) : A(((X(**) AND (X(**) U **)) OR (F(**) U **))) : A(X(F((G(**) OR G(**))))) : (A(F(*)) AND A(G(F(**)))) : A((G(**) OR F(**))) : A(F((** AND F(**))))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "unknown no unknown unknown unknown yes unknown no unknown no no no unknown no yes no ",
"value": "unknown no unknown unknown unknown yes unknown no unknown no no no unknown no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 907/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 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 (NOT(X (F ((((3 <= p413) OR ((p202 + 1 <= p453) U (3 <= p413))) U F ((p453 <= p202))))))) : A (((F ((p247 <= p449)) U ((p449 + 1 <= p247) OR (p309 <= p136))) OR ((p309 <= p136) U G (((p247 <= p449) AND X ((3 <= p97))))))) : A (X (F ((G (((p479 <= p400) U (p110 <= p364))) AND NOT(((p273 <= p159) AND F ((1 <= p211)))))))) : A (G (F (X (X (NOT(X (G (((p4 <= p21) AND (X ((3 <= p477)) U (3 <= p477))))))))))) : A (G (NOT(G (NOT(F ((X ((2 <= p23)) OR NOT((G ((2 <= p23)) OR G (F ((pprime <= p445)))))))))))) : A ((X (F (X (F (X (G ((p23 <= p433))))))) OR X (F ((p392 <= p82))))) : A ((X (((1 <= p328) AND G ((p328 <= 0)))) OR F (G ((p181 <= p260))))) : A ((NOT(F ((p366 <= p439))) AND F ((p321 <= 1)))) : A (X (NOT(((p51 <= p474) U (F (X ((1 <= p17))) U (1 <= p17)))))) : A (G (((p479 <= p209) AND X (G ((p222 <= 2)))))) : A ((((p209 <= p174) AND F ((3 <= p167))) AND F ((F ((p304 + 1 <= p94)) U NOT(X ((3 <= p167))))))) : A (((X ((3 <= p117)) AND (X ((3 <= p117)) U (p186 <= p443))) OR (F ((3 <= p117)) U (p39 + 1 <= p289)))) : A (F (NOT(X (G (NOT((G ((3 <= p241)) OR G ((p122 <= psecond))))))))) : A (NOT((G (((p320 <= p198) OR (p210 <= p249))) OR F (NOT(F ((NOT(G (X ((p456 <= p151)))) U (p456 <= p151)))))))) : A ((G ((p404 <= p347)) OR F ((((3 <= p76) U (p459 <= p498)) U (F ((p404 <= p347)) U (p459 <= p498)))))) : A (F ((((p267 <= 0) AND ((p438 + 1 <= p125) OR (1 <= p122))) AND F ((p125 <= p438)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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: A (X (G ((p202 + 1 <= p453))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p202 + 1 <= p453))))
lola: processed formula length: 30
lola: 113 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: 1376640 markings, 2071755 edges, 275328 markings/sec, 0 secs
lola: 2682994 markings, 4037809 edges, 261271 markings/sec, 5 secs
lola: 3998048 markings, 6017017 edges, 263011 markings/sec, 10 secs
lola: 5309957 markings, 7991404 edges, 262382 markings/sec, 15 secs
lola: 6592238 markings, 9921267 edges, 256456 markings/sec, 20 secs
lola: 7881594 markings, 11861724 edges, 257871 markings/sec, 25 secs
lola: 9151795 markings, 13773349 edges, 254040 markings/sec, 30 secs
lola: 10422646 markings, 15686031 edges, 254170 markings/sec, 35 secs
lola: 11699228 markings, 17607250 edges, 255316 markings/sec, 40 secs
lola: 12958543 markings, 19502534 edges, 251863 markings/sec, 45 secs
lola: 14228823 markings, 21414290 edges, 254056 markings/sec, 50 secs
lola: 15489503 markings, 23311593 edges, 252136 markings/sec, 55 secs
lola: 16766056 markings, 25232842 edges, 255311 markings/sec, 60 secs
lola: 18045062 markings, 27157734 edges, 255801 markings/sec, 65 secs
lola: 19295106 markings, 29039029 edges, 250009 markings/sec, 70 secs
lola: 20577636 markings, 30969241 edges, 256506 markings/sec, 75 secs
lola: 21876038 markings, 32923340 edges, 259680 markings/sec, 80 secs
lola: 23143973 markings, 34831592 edges, 253587 markings/sec, 85 secs
lola: 24436165 markings, 36776363 edges, 258438 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F ((p247 <= p449)) U ((p449 + 1 <= p247) OR (p309 <= p136))) OR ((p309 <= p136) U G (((p247 <= p449) AND X ((3 <= p97)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((p247 <= p449)) U ((p449 + 1 <= p247) OR (p309 <= p136))) OR ((p309 <= p136) U G (((p247 <= p449) AND X ((3 <= p97)))))))
lola: processed formula length: 130
lola: 113 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 101 markings, 101 edges
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((G ((F ((p110 <= p364)) AND ((p479 <= p400) OR (p110 <= p364)))) AND ((p159 + 1 <= p273) OR G ((p211 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((G ((F ((p110 <= p364)) AND ((p479 <= p400) OR (p110 <= p364)))) AND ((p159 + 1 <= p273) OR G ((p211 <= 0)))))))
lola: processed formula length: 121
lola: 113 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1374967 markings, 2069224 edges, 274993 markings/sec, 0 secs
lola: 2678751 markings, 4031445 edges, 260757 markings/sec, 5 secs
lola: 3989840 markings, 6004623 edges, 262218 markings/sec, 10 secs
lola: 5300135 markings, 7976606 edges, 262059 markings/sec, 15 secs
lola: 6588409 markings, 9915511 edges, 257655 markings/sec, 20 secs
lola: 7900775 markings, 11890592 edges, 262473 markings/sec, 25 secs
lola: 9198788 markings, 13844065 edges, 259603 markings/sec, 30 secs
lola: 10486400 markings, 15782000 edges, 257522 markings/sec, 35 secs
lola: 11769716 markings, 17713364 edges, 256663 markings/sec, 40 secs
lola: 13035518 markings, 19618382 edges, 253160 markings/sec, 45 secs
lola: 14312467 markings, 21540180 edges, 255390 markings/sec, 50 secs
lola: 15578238 markings, 23445148 edges, 253154 markings/sec, 55 secs
lola: 16840446 markings, 25344754 edges, 252442 markings/sec, 60 secs
lola: 18101329 markings, 27242396 edges, 252177 markings/sec, 65 secs
lola: 19342242 markings, 29109986 edges, 248183 markings/sec, 70 secs
lola: 20596842 markings, 30998146 edges, 250920 markings/sec, 75 secs
lola: 21849412 markings, 32883267 edges, 250514 markings/sec, 80 secs
lola: 23071498 markings, 34722524 edges, 244417 markings/sec, 85 secs
lola: 24323138 markings, 36606225 edges, 250328 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p21 + 1 <= p4) OR (X ((p477 <= 2)) R (p477 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p21 + 1 <= p4) OR (X ((p477 <= 2)) R (p477 <= 2))))))
lola: processed formula length: 64
lola: 113 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: 1369800 markings, 2061480 edges, 273960 markings/sec, 0 secs
lola: 2663078 markings, 4007809 edges, 258656 markings/sec, 5 secs
lola: 3984805 markings, 5997065 edges, 264345 markings/sec, 10 secs
lola: 5290660 markings, 7962325 edges, 261171 markings/sec, 15 secs
lola: 6570855 markings, 9889106 edges, 256039 markings/sec, 20 secs
lola: 7871898 markings, 11847144 edges, 260209 markings/sec, 25 secs
lola: 9155350 markings, 13778678 edges, 256690 markings/sec, 30 secs
lola: 10439697 markings, 15711666 edges, 256869 markings/sec, 35 secs
lola: 11724327 markings, 17645018 edges, 256926 markings/sec, 40 secs
lola: 13011796 markings, 19582673 edges, 257494 markings/sec, 45 secs
lola: 14307258 markings, 21532382 edges, 259092 markings/sec, 50 secs
lola: 15605289 markings, 23485887 edges, 259606 markings/sec, 55 secs
lola: 16910576 markings, 25450345 edges, 261057 markings/sec, 60 secs
lola: 18222323 markings, 27424506 edges, 262349 markings/sec, 65 secs
lola: 19507259 markings, 29358312 edges, 256987 markings/sec, 70 secs
lola: 20780400 markings, 31274410 edges, 254628 markings/sec, 75 secs
lola: 22061158 markings, 33201933 edges, 256152 markings/sec, 80 secs
lola: 23325523 markings, 35104826 edges, 252873 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((X ((2 <= p23)) OR (F ((p23 <= 1)) AND F (G ((p445 + 1 <= pprime))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((X ((2 <= p23)) OR (F ((p23 <= 1)) AND F (G ((p445 + 1 <= pprime))))))))
lola: processed formula length: 81
lola: 113 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: 1401540 markings, 2109147 edges, 280308 markings/sec, 0 secs
lola: 2782003 markings, 4186566 edges, 276093 markings/sec, 5 secs
lola: 4133443 markings, 6220542 edges, 270288 markings/sec, 10 secs
lola: 5437018 markings, 8182610 edges, 260715 markings/sec, 15 secs
lola: 6743314 markings, 10148476 edges, 261259 markings/sec, 20 secs
lola: 8060091 markings, 12130098 edges, 263355 markings/sec, 25 secs
lola: 9406672 markings, 14156662 edges, 269316 markings/sec, 30 secs
lola: 10750873 markings, 16179785 edges, 268840 markings/sec, 35 secs
lola: 12027817 markings, 18101656 edges, 255389 markings/sec, 40 secs
lola: 13340431 markings, 20077252 edges, 262523 markings/sec, 45 secs
lola: 14651265 markings, 22049918 edges, 262167 markings/sec, 50 secs
lola: 15975088 markings, 24042230 edges, 264765 markings/sec, 55 secs
lola: 17273355 markings, 25996227 edges, 259653 markings/sec, 60 secs
lola: 18556210 markings, 27926975 edges, 256571 markings/sec, 65 secs
lola: 19863487 markings, 29894323 edges, 261455 markings/sec, 70 secs
lola: 21220648 markings, 31936714 edges, 271432 markings/sec, 75 secs
lola: 22622347 markings, 34046280 edges, 280340 markings/sec, 80 secs
lola: 23987543 markings, 36101051 edges, 273039 markings/sec, 85 secs
lola: 25315480 markings, 38099553 edges, 265587 markings/sec, 90 secs
lola: 26611138 markings, 40049521 edges, 259132 markings/sec, 95 secs
lola: 27972610 markings, 42098485 edges, 272294 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p23 <= p433))) OR X (F ((p392 <= p82)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p23 <= p433))) OR X (F ((p392 <= p82)))))
lola: processed formula length: 52
lola: 113 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: 102 markings, 101 edges
lola: ========================================
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (((1 <= p328) AND G ((p328 <= 0)))) OR F (G ((p181 <= p260)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (((1 <= p328) AND G ((p328 <= 0)))) OR F (G ((p181 <= p260)))))
lola: processed formula length: 69
lola: 113 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1377981 markings, 2073747 edges, 275596 markings/sec, 0 secs
lola: 2673418 markings, 4023432 edges, 259087 markings/sec, 5 secs
lola: 3981314 markings, 5991805 edges, 261579 markings/sec, 10 secs
lola: 5298057 markings, 7973496 edges, 263349 markings/sec, 15 secs
lola: 6581797 markings, 9905526 edges, 256748 markings/sec, 20 secs
lola: 7879579 markings, 11858703 edges, 259556 markings/sec, 25 secs
lola: 9176802 markings, 13810985 edges, 259445 markings/sec, 30 secs
lola: 10471435 markings, 15759448 edges, 258927 markings/sec, 35 secs
lola: 11777776 markings, 17725469 edges, 261268 markings/sec, 40 secs
lola: 13062653 markings, 19659183 edges, 256975 markings/sec, 45 secs
lola: 14360429 markings, 21612397 edges, 259555 markings/sec, 50 secs
lola: 15655535 markings, 23561459 edges, 259021 markings/sec, 55 secs
lola: 16939965 markings, 25494564 edges, 256886 markings/sec, 60 secs
lola: 18229673 markings, 27435574 edges, 257942 markings/sec, 65 secs
lola: 19500093 markings, 29347550 edges, 254084 markings/sec, 70 secs
lola: 20776099 markings, 31267973 edges, 255201 markings/sec, 75 secs
lola: 22046403 markings, 33179713 edges, 254061 markings/sec, 80 secs
lola: 23306084 markings, 35075543 edges, 251936 markings/sec, 85 secs
lola: 24600763 markings, 37024117 edges, 258936 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p474 + 1 <= p51) R (X (G ((p17 <= 0))) R (p17 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p474 + 1 <= p51) R (X (G ((p17 <= 0))) R (p17 <= 0)))))
lola: processed formula length: 63
lola: 113 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1377241 markings, 2072661 edges, 275448 markings/sec, 0 secs
lola: 2679504 markings, 4032575 edges, 260453 markings/sec, 5 secs
lola: 3983753 markings, 5995465 edges, 260850 markings/sec, 10 secs
lola: 5290849 markings, 7962615 edges, 261419 markings/sec, 15 secs
lola: 6579384 markings, 9901880 edges, 257707 markings/sec, 20 secs
lola: 7902968 markings, 11893867 edges, 264717 markings/sec, 25 secs
lola: 9218267 markings, 13873420 edges, 263060 markings/sec, 30 secs
lola: 10527847 markings, 15844386 edges, 261916 markings/sec, 35 secs
lola: 11842826 markings, 17823358 edges, 262996 markings/sec, 40 secs
lola: 13136168 markings, 19769828 edges, 258668 markings/sec, 45 secs
lola: 14428202 markings, 21714391 edges, 258407 markings/sec, 50 secs
lola: 15717760 markings, 23655111 edges, 257912 markings/sec, 55 secs
lola: 16999453 markings, 25584090 edges, 256339 markings/sec, 60 secs
lola: 18270518 markings, 27497048 edges, 254213 markings/sec, 65 secs
lola: 19507889 markings, 29359269 edges, 247474 markings/sec, 70 secs
lola: 20772603 markings, 31262698 edges, 252943 markings/sec, 75 secs
lola: 22036902 markings, 33165439 edges, 252860 markings/sec, 80 secs
lola: 23274463 markings, 35027993 edges, 247512 markings/sec, 85 secs
lola: 24544078 markings, 36938780 edges, 253923 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p479 <= p209))) AND A (X (G ((p222 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p479 <= p209)))
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 ((p479 <= p209)))
lola: processed formula length: 22
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p209 + 1 <= p479)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p209 <= p174) AND (A (F ((3 <= p167))) AND A (X (F ((p167 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p209 <= p174)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p209 <= p174)
lola: processed formula length: 14
lola: 113 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 10 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p167)))
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: (p167 <= 2)
lola: processed formula length: 11
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((X ((3 <= p117)) AND (X ((3 <= p117)) U (p186 <= p443))) OR (F ((3 <= p117)) U (p39 + 1 <= p289))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X ((3 <= p117)) AND (X ((3 <= p117)) U (p186 <= p443))) OR (F ((3 <= p117)) U (p39 + 1 <= p289))))
lola: processed formula length: 103
lola: 113 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 101 markings, 101 edges
lola: ========================================
lola: subprocess 11 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((G ((3 <= p241)) OR G ((p122 <= psecond))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((G ((3 <= p241)) OR G ((p122 <= psecond))))))
lola: processed formula length: 54
lola: 113 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: 1362605 markings, 2050620 edges, 272521 markings/sec, 0 secs
lola: 2659326 markings, 4002217 edges, 259344 markings/sec, 5 secs
lola: 3970147 markings, 5975001 edges, 262164 markings/sec, 10 secs
lola: 5277830 markings, 7943042 edges, 261537 markings/sec, 15 secs
lola: 6561708 markings, 9875280 edges, 256776 markings/sec, 20 secs
lola: 7868205 markings, 11841541 edges, 261299 markings/sec, 25 secs
lola: 9162159 markings, 13788969 edges, 258791 markings/sec, 30 secs
lola: 10455248 markings, 15735053 edges, 258618 markings/sec, 35 secs
lola: 11750963 markings, 17685151 edges, 259143 markings/sec, 40 secs
lola: 13026374 markings, 19604605 edges, 255082 markings/sec, 45 secs
lola: 14319900 markings, 21551383 edges, 258705 markings/sec, 50 secs
lola: 15607917 markings, 23489853 edges, 257603 markings/sec, 55 secs
lola: 16895283 markings, 25427359 edges, 257473 markings/sec, 60 secs
lola: 18197150 markings, 27386666 edges, 260373 markings/sec, 65 secs
lola: 19461243 markings, 29289082 edges, 252819 markings/sec, 70 secs
lola: 20740995 markings, 31215122 edges, 255950 markings/sec, 75 secs
lola: 22027664 markings, 33151542 edges, 257334 markings/sec, 80 secs
lola: 23281288 markings, 35038273 edges, 250725 markings/sec, 85 secs
lola: 24568167 markings, 36975009 edges, 257376 markings/sec, 90 secs
lola: 24617661 markings, 37049484 edges, 9899 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((p404 <= p347)) OR F ((p459 <= p498))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((p404 <= p347)) OR F ((p459 <= p498))))
lola: processed formula length: 46
lola: 113 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 957 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p267 <= 0) AND ((p438 + 1 <= p125) OR (1 <= p122))) AND F ((p125 <= p438)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((((p267 <= 0) AND ((p438 + 1 <= p125) OR (1 <= p122))) AND F ((p125 <= p438)))))
lola: processed formula length: 87
lola: 113 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 14 will run for 1436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p439 + 1 <= p366))) AND A (F ((p321 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p321 <= 1)))
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: (2 <= p321)
lola: processed formula length: 11
lola: 115 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 15 will run for 2873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p439 + 1 <= p366)))
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 ((p439 + 1 <= p366)))
lola: processed formula length: 26
lola: 115 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: (p366 <= p439)
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p198 + 1 <= p320) AND (p249 + 1 <= p210)))) AND A (G (F ((p456 <= p151)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p198 + 1 <= p320) AND (p249 + 1 <= p210))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p320 <= p198) OR (p210 <= p249))
lola: processed formula length: 35
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (G ((p202 + 1 <= p453))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p202 + 1 <= p453))))
lola: processed formula length: 30
lola: 113 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: 1380093 markings, 2076955 edges, 276019 markings/sec, 0 secs
lola: 2701202 markings, 4065207 edges, 264222 markings/sec, 5 secs
lola: 4013316 markings, 6039993 edges, 262423 markings/sec, 10 secs
lola: 5319255 markings, 8005399 edges, 261188 markings/sec, 15 secs
lola: 6621791 markings, 9965712 edges, 260507 markings/sec, 20 secs
lola: 7945898 markings, 11958497 edges, 264821 markings/sec, 25 secs
lola: 9267782 markings, 13947919 edges, 264377 markings/sec, 30 secs
lola: 10575094 markings, 15915459 edges, 261462 markings/sec, 35 secs
lola: 11885944 markings, 17888242 edges, 262170 markings/sec, 40 secs
lola: 13177404 markings, 19831902 edges, 258292 markings/sec, 45 secs
lola: 14461619 markings, 21764693 edges, 256843 markings/sec, 50 secs
lola: 15743518 markings, 23693894 edges, 256380 markings/sec, 55 secs
lola: 17018727 markings, 25613119 edges, 255042 markings/sec, 60 secs
lola: 18303147 markings, 27546164 edges, 256884 markings/sec, 65 secs
lola: 19582871 markings, 29472136 edges, 255945 markings/sec, 70 secs
lola: 20855270 markings, 31387128 edges, 254480 markings/sec, 75 secs
lola: 22128370 markings, 33303080 edges, 254620 markings/sec, 80 secs
lola: 23380106 markings, 35187000 edges, 250347 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (F ((G ((F ((p110 <= p364)) AND ((p479 <= p400) OR (p110 <= p364)))) AND ((p159 + 1 <= p273) OR G ((p211 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((G ((F ((p110 <= p364)) AND ((p479 <= p400) OR (p110 <= p364)))) AND ((p159 + 1 <= p273) OR G ((p211 <= 0)))))))
lola: processed formula length: 121
lola: 113 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1342236 markings, 2019977 edges, 268447 markings/sec, 0 secs
lola: 2642521 markings, 3976892 edges, 260057 markings/sec, 5 secs
lola: 3952947 markings, 5949146 edges, 262085 markings/sec, 10 secs
lola: 5261174 markings, 7917964 edges, 261645 markings/sec, 15 secs
lola: 6544192 markings, 9848959 edges, 256604 markings/sec, 20 secs
lola: 7850311 markings, 11814663 edges, 261224 markings/sec, 25 secs
lola: 9132902 markings, 13744894 edges, 256518 markings/sec, 30 secs
lola: 10405596 markings, 15660393 edges, 254539 markings/sec, 35 secs
lola: 11675891 markings, 17572103 edges, 254059 markings/sec, 40 secs
lola: 12941672 markings, 19477114 edges, 253156 markings/sec, 45 secs
lola: 14215426 markings, 21394135 edges, 254751 markings/sec, 50 secs
lola: 15470816 markings, 23283470 edges, 251078 markings/sec, 55 secs
lola: 16737976 markings, 25190566 edges, 253432 markings/sec, 60 secs
lola: 18003965 markings, 27095837 edges, 253198 markings/sec, 65 secs
lola: 19250342 markings, 28971645 edges, 249275 markings/sec, 70 secs
lola: 20518746 markings, 30880663 edges, 253681 markings/sec, 75 secs
lola: 21790288 markings, 32794294 edges, 254308 markings/sec, 80 secs
lola: 23036154 markings, 34669335 edges, 249173 markings/sec, 85 secs
lola: 24307554 markings, 36582750 edges, 254280 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F (((p21 + 1 <= p4) OR (X ((p477 <= 2)) R (p477 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p21 + 1 <= p4) OR (X ((p477 <= 2)) R (p477 <= 2))))))
lola: processed formula length: 64
lola: 113 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: 1361458 markings, 2048919 edges, 272292 markings/sec, 0 secs
lola: 2672850 markings, 4022600 edges, 262278 markings/sec, 5 secs
lola: 3988793 markings, 6003024 edges, 263189 markings/sec, 10 secs
lola: 5291275 markings, 7963242 edges, 260496 markings/sec, 15 secs
lola: 6569287 markings, 9886731 edges, 255602 markings/sec, 20 secs
lola: 7866196 markings, 11838513 edges, 259382 markings/sec, 25 secs
lola: 9151896 markings, 13773469 edges, 257140 markings/sec, 30 secs
lola: 10437109 markings, 15707777 edges, 257043 markings/sec, 35 secs
lola: 11722994 markings, 17642989 edges, 257177 markings/sec, 40 secs
lola: 12991832 markings, 19552647 edges, 253768 markings/sec, 45 secs
lola: 14271206 markings, 21478052 edges, 255875 markings/sec, 50 secs
lola: 15543831 markings, 23393362 edges, 254525 markings/sec, 55 secs
lola: 16820077 markings, 25314118 edges, 255249 markings/sec, 60 secs
lola: 18101741 markings, 27243021 edges, 256333 markings/sec, 65 secs
lola: 19363015 markings, 29141231 edges, 252255 markings/sec, 70 secs
lola: 20639725 markings, 31062723 edges, 255342 markings/sec, 75 secs
lola: 21908188 markings, 32971718 edges, 253693 markings/sec, 80 secs
lola: 23150628 markings, 34841625 edges, 248488 markings/sec, 85 secs
lola: 24429494 markings, 36766310 edges, 255773 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F ((X ((2 <= p23)) OR (F ((p23 <= 1)) AND F (G ((p445 + 1 <= pprime))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((X ((2 <= p23)) OR (F ((p23 <= 1)) AND F (G ((p445 + 1 <= pprime))))))))
lola: processed formula length: 81
lola: 113 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: 1380611 markings, 2077544 edges, 276122 markings/sec, 0 secs
lola: 2778359 markings, 4181099 edges, 279550 markings/sec, 5 secs
lola: 4139309 markings, 6229307 edges, 272190 markings/sec, 10 secs
lola: 5441080 markings, 8188657 edges, 260354 markings/sec, 15 secs
lola: 6741147 markings, 10145352 edges, 260013 markings/sec, 20 secs
lola: 8035764 markings, 12093540 edges, 258923 markings/sec, 25 secs
lola: 9364271 markings, 14092949 edges, 265701 markings/sec, 30 secs
lola: 10681450 markings, 16075299 edges, 263436 markings/sec, 35 secs
lola: 11968486 markings, 18012400 edges, 257407 markings/sec, 40 secs
lola: 13263878 markings, 19961873 edges, 259078 markings/sec, 45 secs
lola: 14557021 markings, 21908002 edges, 258629 markings/sec, 50 secs
lola: 15892939 markings, 23918623 edges, 267184 markings/sec, 55 secs
lola: 17188406 markings, 25868332 edges, 259093 markings/sec, 60 secs
lola: 18468007 markings, 27794176 edges, 255920 markings/sec, 65 secs
lola: 19751419 markings, 29725696 edges, 256682 markings/sec, 70 secs
lola: 21043110 markings, 31669569 edges, 258338 markings/sec, 75 secs
lola: 22376448 markings, 33676250 edges, 266668 markings/sec, 80 secs
lola: 23680396 markings, 35638765 edges, 260790 markings/sec, 85 secs
lola: 24973193 markings, 37584593 edges, 258559 markings/sec, 90 secs
lola: 26264039 markings, 39527257 edges, 258169 markings/sec, 95 secs
lola: 27592714 markings, 41526683 edges, 265735 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((X (((1 <= p328) AND G ((p328 <= 0)))) OR F (G ((p181 <= p260)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (((1 <= p328) AND G ((p328 <= 0)))) OR F (G ((p181 <= p260)))))
lola: processed formula length: 69
lola: 113 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1353829 markings, 2037428 edges, 270766 markings/sec, 0 secs
lola: 2652865 markings, 3992527 edges, 259807 markings/sec, 5 secs
lola: 3978405 markings, 5987483 edges, 265108 markings/sec, 10 secs
lola: 5309019 markings, 7989978 edges, 266123 markings/sec, 15 secs
lola: 6614010 markings, 9954001 edges, 260998 markings/sec, 20 secs
lola: 7937619 markings, 11946077 edges, 264722 markings/sec, 25 secs
lola: 9250450 markings, 13921801 edges, 262566 markings/sec, 30 secs
lola: 10545559 markings, 15871010 edges, 259022 markings/sec, 35 secs
lola: 11833496 markings, 17809342 edges, 257587 markings/sec, 40 secs
lola: 13108568 markings, 19728291 edges, 255014 markings/sec, 45 secs
lola: 14397829 markings, 21668655 edges, 257852 markings/sec, 50 secs
lola: 15708863 markings, 23641751 edges, 262207 markings/sec, 55 secs
lola: 17017862 markings, 25611818 edges, 261800 markings/sec, 60 secs
lola: 18318718 markings, 27569607 edges, 260171 markings/sec, 65 secs
lola: 19604602 markings, 29504808 edges, 257177 markings/sec, 70 secs
lola: 20893399 markings, 31444497 edges, 257759 markings/sec, 75 secs
lola: 22181926 markings, 33383688 edges, 257705 markings/sec, 80 secs
lola: 23432085 markings, 35265147 edges, 250032 markings/sec, 85 secs
lola: 24614421 markings, 37044591 edges, 236467 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (((p474 + 1 <= p51) R (X (G ((p17 <= 0))) R (p17 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p474 + 1 <= p51) R (X (G ((p17 <= 0))) R (p17 <= 0)))))
lola: processed formula length: 63
lola: 113 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1390973 markings, 2093361 edges, 278195 markings/sec, 0 secs
lola: 2709719 markings, 4078029 edges, 263749 markings/sec, 5 secs
lola: 4037162 markings, 6075904 edges, 265489 markings/sec, 10 secs
lola: 5366748 markings, 8076902 edges, 265917 markings/sec, 15 secs
lola: 6668376 markings, 10035838 edges, 260326 markings/sec, 20 secs
lola: 7992065 markings, 12027980 edges, 264738 markings/sec, 25 secs
lola: 9323187 markings, 14031299 edges, 266224 markings/sec, 30 secs
lola: 10635258 markings, 16005992 edges, 262414 markings/sec, 35 secs
lola: 11946046 markings, 17978709 edges, 262158 markings/sec, 40 secs
lola: 13245909 markings, 19934998 edges, 259973 markings/sec, 45 secs
lola: 14557264 markings, 21908584 edges, 262271 markings/sec, 50 secs
lola: 15862628 markings, 23873153 edges, 261073 markings/sec, 55 secs
lola: 17146772 markings, 25805804 edges, 256829 markings/sec, 60 secs
lola: 18418849 markings, 27720288 edges, 254415 markings/sec, 65 secs
lola: 19683725 markings, 29623911 edges, 252975 markings/sec, 70 secs
lola: 20945492 markings, 31522857 edges, 252353 markings/sec, 75 secs
lola: 22220549 markings, 33441850 edges, 255011 markings/sec, 80 secs
lola: 23448006 markings, 35289145 edges, 245491 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (F ((G ((3 <= p241)) OR G ((p122 <= psecond))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((G ((3 <= p241)) OR G ((p122 <= psecond))))))
lola: processed formula length: 54
lola: 113 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: 1383319 markings, 2081829 edges, 276664 markings/sec, 0 secs
lola: 2701037 markings, 4064940 edges, 263544 markings/sec, 5 secs
lola: 4021170 markings, 6051821 edges, 264027 markings/sec, 10 secs
lola: 5336982 markings, 8032041 edges, 263162 markings/sec, 15 secs
lola: 6633789 markings, 9983765 edges, 259361 markings/sec, 20 secs
lola: 7955871 markings, 11973512 edges, 264416 markings/sec, 25 secs
lola: 9271408 markings, 13953364 edges, 263107 markings/sec, 30 secs
lola: 10562008 markings, 15895756 edges, 258120 markings/sec, 35 secs
lola: 11862290 markings, 17852651 edges, 260056 markings/sec, 40 secs
lola: 13139027 markings, 19774158 edges, 255347 markings/sec, 45 secs
lola: 14417276 markings, 21697923 edges, 255650 markings/sec, 50 secs
lola: 15693672 markings, 23618862 edges, 255279 markings/sec, 55 secs
lola: 16965236 markings, 25532569 edges, 254313 markings/sec, 60 secs
lola: 18245911 markings, 27460010 edges, 256135 markings/sec, 65 secs
lola: 19494629 markings, 29339306 edges, 249744 markings/sec, 70 secs
lola: 20754636 markings, 31235652 edges, 252001 markings/sec, 75 secs
lola: 22014349 markings, 33131542 edges, 251943 markings/sec, 80 secs
lola: 23280400 markings, 35036901 edges, 253210 markings/sec, 85 secs
lola: 24556489 markings, 36957434 edges, 255218 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no unknown unknown unknown yes unknown no unknown no no no unknown no yes no
lola:
preliminary result: unknown no unknown unknown unknown yes unknown no unknown no no no unknown no yes no
lola: memory consumption: 24128 KB
lola: time consumption: 1382 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590264924339

--------------------
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="RefineWMG-PT-100100"
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 RefineWMG-PT-100100, 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 r165-oct2-158972938900029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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