Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r105-oct2-158940199700103.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 JoinFreeModules-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-oct2-158940199700103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.3K Apr 7 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 7 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 20:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 6 20:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 6 04:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 6 04:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 5 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 5 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 57K Mar 24 05:37 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 JoinFreeModules-PT-0010-00
FORMULA_NAME JoinFreeModules-PT-0010-01
FORMULA_NAME JoinFreeModules-PT-0010-02
FORMULA_NAME JoinFreeModules-PT-0010-03
FORMULA_NAME JoinFreeModules-PT-0010-04
FORMULA_NAME JoinFreeModules-PT-0010-05
FORMULA_NAME JoinFreeModules-PT-0010-06
FORMULA_NAME JoinFreeModules-PT-0010-07
FORMULA_NAME JoinFreeModules-PT-0010-08
FORMULA_NAME JoinFreeModules-PT-0010-09
FORMULA_NAME JoinFreeModules-PT-0010-10
FORMULA_NAME JoinFreeModules-PT-0010-11
FORMULA_NAME JoinFreeModules-PT-0010-12
FORMULA_NAME JoinFreeModules-PT-0010-13
FORMULA_NAME JoinFreeModules-PT-0010-14
FORMULA_NAME JoinFreeModules-PT-0010-15

=== Now, execution of the tool begins

BK_START 1589722473614

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-0010 @ 3570 seconds

FORMULA JoinFreeModules-PT-0010-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2788
rslt: Output for LTLCardinality @ JoinFreeModules-PT-0010

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((X ((p4 <= 1)) U (F (G ((3 <= p31))) AND G (((2 <= p4) OR G ((3 <= p31)))))) U X (((2 <= p4) OR (3 <= p2)))))",
"processed_size": 113,
"rewrites": 108
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 49
},
"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": 282
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F (((p29 <= 1) OR ((2 <= p18) R (p29 <= 1))))))",
"processed_size": 53,
"rewrites": 108
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 307
},
"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": "(p13 + 1 <= p38)",
"processed_size": 16,
"rewrites": 110
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "A (G (((p21 <= p33) R X (X ((p33 + 1 <= p21))))))",
"processed_size": 49,
"rewrites": 108
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 3,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A ((F ((p4 <= p10)) U ((1 <= p41) U ((X ((p25 <= p3)) OR F ((p50 <= p6))) U (2 <= p6)))))",
"processed_size": 89,
"rewrites": 108
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 376
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X (F ((p1 <= p19)))))",
"processed_size": 27,
"rewrites": 108
},
"result":
{
"edges": 5,
"markings": 5,
"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": 423
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 423
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X ((3 <= p39)))",
"processed_size": 18,
"rewrites": 108
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 564
},
"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": "(p32 <= p37)",
"processed_size": 12,
"rewrites": 108
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 677
},
"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 ((p32 <= p37))))",
"processed_size": 24,
"rewrites": 108
},
"result":
{
"edges": 1291203,
"markings": 748351,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 676
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"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 (X (X (G (((p25 <= p26) AND (1 <= p47)))))))",
"processed_size": 49,
"rewrites": 108
},
"result":
{
"edges": 391,
"markings": 342,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 846
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p35 <= 1)))",
"processed_size": 18,
"rewrites": 110
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": 1128
},
"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 ((p19 + 1 <= p25)))",
"processed_size": 24,
"rewrites": 110
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

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

{
"child":
[

{
"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": "(p15 + 1 <= p48)",
"processed_size": 16,
"rewrites": 108
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (F ((p48 <= 2))))",
"processed_size": 22,
"rewrites": 108
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23252,
"runtime": 758.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(**)) AND A(G((* R X(X(*)))))) : A(((X(**) U (F(G(**)) AND G((** OR G(**))))) U X((** OR **)))) : A(F(G((** OR X(TRUE))))) : A(G((G((G(**) OR X(*))) OR (G(**) AND F(G((G(**) OR X(*)))))))) : A(X(F((* OR (* R *))))) : TRUE : (** AND A(G(F(*)))) : A(G(*)) : A((F(**) U (** U ((X(**) OR F(**)) U **)))) : A(X(X(F(**)))) : (A(X(**)) AND A(X(F((F(**) OR (F(**) AND F(G(**)))))))) : A(G(*)) : A(G(((* AND F(*)) OR X((** AND F(**)))))) : (** AND (A(F(G(**))) AND A((G((F(**) AND (** OR **))) OR (** AND X(**)))))) : A(F((* AND ((F(*) OR G(*)) AND G(*))))) : A(X(X(X(G(*)))))"
},
"net":
{
"arcs": 232,
"conflict_clusters": 41,
"places": 51,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no unknown unknown yes yes no no yes no no no no no unknown no ",
"value": "no no unknown unknown yes yes no no yes no no no no no unknown 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: 132/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1632
lola: finding significant places
lola: 51 places, 81 transitions, 40 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: place invariant simplifies atomic proposition
lola: before: (1 <= p)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p18 <= p)
lola: after: (p18 <= 1)
lola: A ((F ((p38 <= p13)) AND G (NOT(((p33 + 1 <= p21) U X (X ((p21 <= p33)))))))) : A (((X ((p4 <= 1)) U G (((2 <= p4) U G ((3 <= p31))))) U (X ((2 <= p4)) OR X ((3 <= p2))))) : A (X (G (F (G ((((3 <= p8) AND (p37 <= p10)) OR F (X (F ((0 <= 0)))))))))) : A (G ((G ((p50 <= p11)) U G ((G ((p48 <= p28)) OR NOT(X (((p16 <= p34) OR (3 <= p12))))))))) : A ((G ((0 <= p3)) AND F (X (NOT(((2 <= p29) AND ((p18 <= 1) U (2 <= p29)))))))) : A (((F ((0 <= p13)) OR X ((p3 <= 0))) OR G ((p4 + 1 <= p41)))) : A (((p15 + 1 <= p48) AND NOT(X (X ((((p31 <= p24) OR X ((p6 <= p21))) U F (G (X ((3 <= p48)))))))))) : A (G (NOT((F ((2 <= p35)) OR ((p19 + 1 <= 0) AND ((p4 <= p39) OR NOT(X ((2 <= p35))))))))) : A ((F ((p4 <= p10)) U ((1 <= p41) U ((X ((p25 <= p3)) OR F ((p50 <= p6))) U (2 <= p6))))) : A (F ((G ((0 <= p36)) U X (X ((p1 <= p19)))))) : A (X (((3 <= p39) AND F ((F (G ((p13 <= p29))) U F ((p46 <= 1))))))) : A (NOT(F ((p25 <= p19)))) : A (NOT(F ((((p10 + 1 <= p2) OR G ((2 <= p11))) AND X (NOT(((2 <= p32) AND F ((2 <= p11))))))))) : A ((((p32 <= p37) AND F (G ((p32 <= p37)))) AND (G (((p20 <= p19) U (2 <= p19))) OR ((p32 <= p37) AND X ((2 <= p19)))))) : A (NOT(G (((X ((0 <= p6)) AND (G ((2 <= p32)) U (1 <= p15))) OR F ((X ((1 <= p15)) U (1 <= p15))))))) : A (X (X (NOT(X (F (((p26 + 1 <= p25) OR (p47 <= 0))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:422
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k: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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: 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: 108 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: A (((X ((p4 <= 1)) U (F (G ((3 <= p31))) AND G (((2 <= p4) OR G ((3 <= p31)))))) U X (((2 <= p4) OR (3 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X ((p4 <= 1)) U (F (G ((3 <= p31))) AND G (((2 <= p4) OR G ((3 <= p31)))))) U X (((2 <= p4) OR (3 <= p2)))))
lola: processed formula length: 113
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 49 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((((3 <= p8) AND (p37 <= p10)) OR X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((((3 <= p8) AND (p37 <= p10)) OR X (TRUE)))))
lola: processed formula length: 54
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4531882 markings, 5252516 edges, 906376 markings/sec, 0 secs
lola: 8865779 markings, 10275645 edges, 866779 markings/sec, 5 secs
lola: 12927641 markings, 14983457 edges, 812372 markings/sec, 10 secs
lola: 16882425 markings, 19567189 edges, 790957 markings/sec, 15 secs
lola: 20808441 markings, 24117546 edges, 785203 markings/sec, 20 secs
lola: 24879002 markings, 28835460 edges, 814112 markings/sec, 25 secs
lola: 28909274 markings, 33506667 edges, 806054 markings/sec, 30 secs
lola: 32870515 markings, 38097879 edges, 792248 markings/sec, 35 secs
lola: 36721451 markings, 42561224 edges, 770187 markings/sec, 40 secs
lola: 40544416 markings, 46992165 edges, 764593 markings/sec, 45 secs
lola: 44478809 markings, 51552252 edges, 786879 markings/sec, 50 secs
lola: 48301272 markings, 55982589 edges, 764493 markings/sec, 55 secs
lola: 52241429 markings, 60549355 edges, 788031 markings/sec, 60 secs
lola: 56207324 markings, 65145968 edges, 793179 markings/sec, 65 secs
lola: 60031610 markings, 69578407 edges, 764857 markings/sec, 70 secs
lola: 63742319 markings, 73879247 edges, 742142 markings/sec, 75 secs
lola: 65547911 markings, 75971981 edges, 361118 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((G ((p48 <= p28)) OR X (((p34 + 1 <= p16) AND (p12 <= 2))))) OR (G ((p50 <= p11)) AND F (G ((G ((p48 <= p28)) OR X (((p34 + 1 <= p16) AND (p12 <= 2))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((G ((p48 <= p28)) OR X (((p34 + 1 <= p16) AND (p12 <= 2))))) OR (G ((p50 <= p11)) AND F (G ((G ((p48 <= p28)) OR X (((p34 + 1 <= p16) AND (p12 <= 2))))))))))
lola: processed formula length: 167
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 46 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: 4423022 markings, 5239820 edges, 884604 markings/sec, 0 secs
lola: 8723679 markings, 10334750 edges, 860131 markings/sec, 5 secs
lola: 12966840 markings, 15361590 edges, 848632 markings/sec, 10 secs
lola: 17090218 markings, 20246534 edges, 824676 markings/sec, 15 secs
lola: 21136701 markings, 25040382 edges, 809297 markings/sec, 20 secs
lola: 25271823 markings, 29939251 edges, 827024 markings/sec, 25 secs
lola: 29144422 markings, 34527066 edges, 774520 markings/sec, 30 secs
lola: 32938296 markings, 39021674 edges, 758775 markings/sec, 35 secs
lola: 36731202 markings, 43515116 edges, 758581 markings/sec, 40 secs
lola: 40727330 markings, 48249258 edges, 799226 markings/sec, 45 secs
lola: 44727890 markings, 52988674 edges, 800112 markings/sec, 50 secs
lola: 48588552 markings, 57562418 edges, 772132 markings/sec, 55 secs
lola: 52420612 markings, 62102211 edges, 766412 markings/sec, 60 secs
lola: 56282948 markings, 66677888 edges, 772467 markings/sec, 65 secs
lola: 59886157 markings, 70946623 edges, 720642 markings/sec, 70 secs
lola: 63463515 markings, 75184651 edges, 715472 markings/sec, 75 secs
lola: 67063059 markings, 79449069 edges, 719909 markings/sec, 80 secs
lola: 69567648 markings, 82416224 edges, 500918 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p29 <= 1) OR ((2 <= p18) R (p29 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((p29 <= 1) OR ((2 <= p18) R (p29 <= 1))))))
lola: processed formula length: 53
lola: 108 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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p38 <= p13))) AND A (G (((p21 <= p33) R X (X ((p33 + 1 <= p21)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p38 <= p13)))
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: (p13 + 1 <= p38)
lola: processed formula length: 16
lola: 110 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 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p21 <= p33) R X (X ((p33 + 1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((p21 <= p33) R X (X ((p33 + 1 <= p21))))))
lola: processed formula length: 49
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p4 <= p10)) U ((1 <= p41) U ((X ((p25 <= p3)) OR F ((p50 <= p6))) U (2 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p4 <= p10)) U ((1 <= p41) U ((X ((p25 <= p3)) OR F ((p50 <= p6))) U (2 <= p6)))))
lola: processed formula length: 89
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p1 <= p19)))))
lola: processed formula length: 27
lola: 108 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((3 <= p39))) AND A (X (F ((F ((p46 <= 1)) OR (F ((p46 <= 1)) AND F (G ((p13 <= p29)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p39)))
lola: processed formula length: 18
lola: 108 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: 5 markings, 5 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2 <= p10) AND F ((p11 <= 1))) OR X (((2 <= p32) AND F ((2 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((((p2 <= p10) AND F ((p11 <= 1))) OR X (((2 <= p32) AND F ((2 <= p11)))))))
lola: processed formula length: 81
lola: 108 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: 5 markings, 5 edges
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p32 <= p37) AND (A (F (G ((p32 <= p37)))) AND A ((G ((F ((2 <= p19)) AND ((p20 <= p19) OR (2 <= p19)))) OR ((p32 <= p37) AND X ((2 <= p19)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p32 <= p37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p32 <= p37)
lola: processed formula length: 12
lola: 108 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 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p32 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p32 <= p37))))
lola: processed formula length: 24
lola: 108 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: ========================================
lola: add low 78
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: 748351 markings, 1291203 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G (((p25 <= p26) AND (1 <= p47)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G (((p25 <= p26) AND (1 <= p47)))))))
lola: processed formula length: 49
lola: 108 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: 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: 342 markings, 391 edges
lola: ========================================
lola: subprocess 12 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p35 <= 1)))
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 ((p35 <= 1)))
lola: processed formula length: 18
lola: 110 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: (2 <= p35)
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 1128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p19 + 1 <= p25)))
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 ((p19 + 1 <= p25)))
lola: processed formula length: 24
lola: 110 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p15 <= 0) AND ((F ((p32 <= 1)) OR G ((p15 <= 0))) AND G ((p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((p15 <= 0) AND ((F ((p32 <= 1)) OR G ((p15 <= 0))) AND G ((p15 <= 0))))))
lola: processed formula length: 80
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3340043 markings, 5770401 edges, 668009 markings/sec, 0 secs
lola: 6606954 markings, 11415334 edges, 653382 markings/sec, 5 secs
lola: 9912167 markings, 17130622 edges, 661043 markings/sec, 10 secs
lola: 13179204 markings, 22779922 edges, 653407 markings/sec, 15 secs
lola: 16426589 markings, 28395186 edges, 649477 markings/sec, 20 secs
lola: 19591227 markings, 33867350 edges, 632928 markings/sec, 25 secs
lola: 22786174 markings, 39392032 edges, 638989 markings/sec, 30 secs
lola: 25856927 markings, 44698739 edges, 614151 markings/sec, 35 secs
lola: 28993313 markings, 50117312 edges, 627277 markings/sec, 40 secs
lola: 32205768 markings, 55670294 edges, 642491 markings/sec, 45 secs
lola: 35373542 markings, 61145906 edges, 633555 markings/sec, 50 secs
lola: 38491793 markings, 66535618 edges, 623650 markings/sec, 55 secs
lola: 41602623 markings, 71912166 edges, 622166 markings/sec, 60 secs
lola: 44685388 markings, 77239780 edges, 616553 markings/sec, 65 secs
lola: 47685284 markings, 82424540 edges, 599979 markings/sec, 70 secs
lola: 50817212 markings, 87840187 edges, 626386 markings/sec, 75 secs
lola: 53936767 markings, 93234508 edges, 623911 markings/sec, 80 secs
lola: 57073160 markings, 98657929 edges, 627279 markings/sec, 85 secs
lola: 60092512 markings, 103878817 edges, 603870 markings/sec, 90 secs
lola: 63174321 markings, 109207893 edges, 616362 markings/sec, 95 secs
lola: 66166124 markings, 114378003 edges, 598361 markings/sec, 100 secs
lola: 69120561 markings, 119482270 edges, 590887 markings/sec, 105 secs
lola: 72244764 markings, 124883838 edges, 624841 markings/sec, 110 secs
lola: 75391846 markings, 130325776 edges, 629416 markings/sec, 115 secs
lola: 78524361 markings, 135742436 edges, 626503 markings/sec, 120 secs
lola: 81590380 markings, 141044044 edges, 613204 markings/sec, 125 secs
lola: 84642585 markings, 146319731 edges, 610441 markings/sec, 130 secs
lola: 87751946 markings, 151692872 edges, 621872 markings/sec, 135 secs
lola: 90880152 markings, 157099054 edges, 625641 markings/sec, 140 secs
lola: 93966078 markings, 162433376 edges, 617185 markings/sec, 145 secs
lola: 97007174 markings, 167690530 edges, 608219 markings/sec, 150 secs
lola: 100003500 markings, 172869553 edges, 599265 markings/sec, 155 secs
lola: 103006978 markings, 178059112 edges, 600696 markings/sec, 160 secs
lola: 105823536 markings, 182925244 edges, 563312 markings/sec, 165 secs
lola: 108776650 markings, 188031618 edges, 590623 markings/sec, 170 secs
lola: 111841856 markings, 193331910 edges, 613041 markings/sec, 175 secs
lola: 114922341 markings, 198658489 edges, 616097 markings/sec, 180 secs
lola: 117256509 markings, 202694753 edges, 466834 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p15 + 1 <= p48) AND A (G (F ((p48 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p15 + 1 <= p48)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 + 1 <= p48)
lola: processed formula length: 16
lola: 108 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((((3 <= p8) AND (p37 <= p10)) OR X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((((3 <= p8) AND (p37 <= p10)) OR X (TRUE)))))
lola: processed formula length: 54
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4384667 markings, 5081893 edges, 876933 markings/sec, 0 secs
lola: 8620968 markings, 9991904 edges, 847260 markings/sec, 5 secs
lola: 12665238 markings, 14679332 edges, 808854 markings/sec, 10 secs
lola: 16715971 markings, 19374254 edges, 810147 markings/sec, 15 secs
lola: 20594011 markings, 23869032 edges, 775608 markings/sec, 20 secs
lola: 24590187 markings, 28500719 edges, 799235 markings/sec, 25 secs
lola: 28589952 markings, 33136572 edges, 799953 markings/sec, 30 secs
lola: 32447964 markings, 37608118 edges, 771602 markings/sec, 35 secs
lola: 36248954 markings, 42013596 edges, 760198 markings/sec, 40 secs
lola: 40058423 markings, 46428872 edges, 761894 markings/sec, 45 secs
lola: 44006774 markings, 51005151 edges, 789670 markings/sec, 50 secs
lola: 47819322 markings, 55424003 edges, 762510 markings/sec, 55 secs
lola: 51741524 markings, 59969955 edges, 784440 markings/sec, 60 secs
lola: 55668901 markings, 64521919 edges, 785475 markings/sec, 65 secs
lola: 59539634 markings, 69008207 edges, 774147 markings/sec, 70 secs
lola: 63245304 markings, 73303192 edges, 741134 markings/sec, 75 secs
lola: 65529523 markings, 75950670 edges, 456844 markings/sec, 80 secs
lola: 65556130 markings, 75981514 edges, 5321 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G ((G ((G ((p48 <= p28)) OR X (((p34 + 1 <= p16) AND (p12 <= 2))))) OR (G ((p50 <= p11)) AND F (G ((G ((p48 <= p28)) OR X (((p34 + 1 <= p16) AND (p12 <= 2))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((G ((p48 <= p28)) OR X (((p34 + 1 <= p16) AND (p12 <= 2))))) OR (G ((p50 <= p11)) AND F (G ((G ((p48 <= p28)) OR X (((p34 + 1 <= p16) AND (p12 <= 2))))))))))
lola: processed formula length: 167
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 46 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: 4199158 markings, 4974580 edges, 839832 markings/sec, 0 secs
lola: 8437090 markings, 9995206 edges, 847586 markings/sec, 5 secs
lola: 12630700 markings, 14963430 edges, 838722 markings/sec, 10 secs
lola: 16715942 markings, 19803134 edges, 817048 markings/sec, 15 secs
lola: 20704216 markings, 24528003 edges, 797655 markings/sec, 20 secs
lola: 24723185 markings, 29289295 edges, 803794 markings/sec, 25 secs
lola: 28563130 markings, 33838428 edges, 767989 markings/sec, 30 secs
lola: 32181374 markings, 38124934 edges, 723649 markings/sec, 35 secs
lola: 35958066 markings, 42599170 edges, 755338 markings/sec, 40 secs
lola: 39837278 markings, 47194816 edges, 775842 markings/sec, 45 secs
lola: 43813092 markings, 51904976 edges, 795163 markings/sec, 50 secs
lola: 47755003 markings, 56574933 edges, 788382 markings/sec, 55 secs
lola: 51346633 markings, 60829881 edges, 718326 markings/sec, 60 secs
lola: 55217618 markings, 65415798 edges, 774197 markings/sec, 65 secs
lola: 58791508 markings, 69649804 edges, 714778 markings/sec, 70 secs
lola: 62353236 markings, 73869380 edges, 712346 markings/sec, 75 secs
lola: 65867637 markings, 78032825 edges, 702880 markings/sec, 80 secs
lola: 69318452 markings, 82120976 edges, 690163 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (((p15 <= 0) AND ((F ((p32 <= 1)) OR G ((p15 <= 0))) AND G ((p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((p15 <= 0) AND ((F ((p32 <= 1)) OR G ((p15 <= 0))) AND G ((p15 <= 0))))))
lola: processed formula length: 80
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3349124 markings, 5786069 edges, 669825 markings/sec, 0 secs
lola: 6598052 markings, 11399907 edges, 649786 markings/sec, 5 secs
lola: 9914548 markings, 17134742 edges, 663299 markings/sec, 10 secs
lola: 13207981 markings, 22829659 edges, 658687 markings/sec, 15 secs
lola: 16424434 markings, 28391413 edges, 643291 markings/sec, 20 secs
lola: 19537381 markings, 33774268 edges, 622589 markings/sec, 25 secs
lola: 22731713 markings, 39297781 edges, 638866 markings/sec, 30 secs
lola: 25805441 markings, 44609766 edges, 614746 markings/sec, 35 secs
lola: 28947016 markings, 50037398 edges, 628315 markings/sec, 40 secs
lola: 32163924 markings, 55598024 edges, 643382 markings/sec, 45 secs
lola: 35333823 markings, 61077374 edges, 633980 markings/sec, 50 secs
lola: 38460683 markings, 66481815 edges, 625372 markings/sec, 55 secs
lola: 41571862 markings, 71859038 edges, 622236 markings/sec, 60 secs
lola: 44662188 markings, 77199748 edges, 618065 markings/sec, 65 secs
lola: 47659198 markings, 82379435 edges, 599402 markings/sec, 70 secs
lola: 50792132 markings, 87796864 edges, 626587 markings/sec, 75 secs
lola: 53909056 markings, 93186564 edges, 623385 markings/sec, 80 secs
lola: 57044879 markings, 98608911 edges, 627165 markings/sec, 85 secs
lola: 60066745 markings, 103834330 edges, 604373 markings/sec, 90 secs
lola: 63161752 markings, 109186177 edges, 619001 markings/sec, 95 secs
lola: 66189252 markings, 114417903 edges, 605500 markings/sec, 100 secs
lola: 69146548 markings, 119527173 edges, 591459 markings/sec, 105 secs
lola: 72284126 markings, 124951951 edges, 627516 markings/sec, 110 secs
lola: 75438163 markings, 130405793 edges, 630807 markings/sec, 115 secs
lola: 78582243 markings, 135842534 edges, 628816 markings/sec, 120 secs
lola: 81661551 markings, 141167086 edges, 615862 markings/sec, 125 secs
lola: 84691489 markings, 146404238 edges, 605988 markings/sec, 130 secs
lola: 87770557 markings, 151725084 edges, 615814 markings/sec, 135 secs
lola: 90877114 markings, 157093852 edges, 621311 markings/sec, 140 secs
lola: 93951473 markings, 162408070 edges, 614872 markings/sec, 145 secs
lola: 96996809 markings, 167672609 edges, 609067 markings/sec, 150 secs
lola: 99971326 markings, 172813977 edges, 594903 markings/sec, 155 secs
lola: 102970618 markings, 177996364 edges, 599858 markings/sec, 160 secs
lola: 105889619 markings, 183039349 edges, 583800 markings/sec, 165 secs
lola: 108884350 markings, 188217758 edges, 598946 markings/sec, 170 secs
lola: 111927898 markings, 193480685 edges, 608710 markings/sec, 175 secs
lola: 115017054 markings, 198822282 edges, 617831 markings/sec, 180 secs
lola: 117308352 markings, 202784427 edges, 458260 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((p15 + 1 <= p48) AND A (G (F ((p48 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p15 + 1 <= p48)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 + 1 <= p48)
lola: processed formula length: 16
lola: 108 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: ========================================
lola: ...considering subproblem: A (G (F ((p48 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p48 <= 2))))
lola: processed formula length: 22
lola: 108 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown unknown yes yes no no yes no no no no no unknown no
lola:
preliminary result: no no unknown unknown yes yes no no yes no no no no no unknown no
lola: memory consumption: 23252 KB
lola: time consumption: 758 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589723256122

--------------------
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="JoinFreeModules-PT-0010"
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 JoinFreeModules-PT-0010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-oct2-158940199700103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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