Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r090-smll-158922999400071.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is FlexibleBarrier-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r090-smll-158922999400071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.7K Apr 4 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 4 06:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 06:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 20:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 20:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 3 13:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 3 13:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 141K 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 FlexibleBarrier-PT-06b-00
FORMULA_NAME FlexibleBarrier-PT-06b-01
FORMULA_NAME FlexibleBarrier-PT-06b-02
FORMULA_NAME FlexibleBarrier-PT-06b-03
FORMULA_NAME FlexibleBarrier-PT-06b-04
FORMULA_NAME FlexibleBarrier-PT-06b-05
FORMULA_NAME FlexibleBarrier-PT-06b-06
FORMULA_NAME FlexibleBarrier-PT-06b-07
FORMULA_NAME FlexibleBarrier-PT-06b-08
FORMULA_NAME FlexibleBarrier-PT-06b-09
FORMULA_NAME FlexibleBarrier-PT-06b-10
FORMULA_NAME FlexibleBarrier-PT-06b-11
FORMULA_NAME FlexibleBarrier-PT-06b-12
FORMULA_NAME FlexibleBarrier-PT-06b-13
FORMULA_NAME FlexibleBarrier-PT-06b-14
FORMULA_NAME FlexibleBarrier-PT-06b-15

=== Now, execution of the tool begins

BK_START 1589558581015

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

FORMULA FlexibleBarrier-PT-06b-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA FlexibleBarrier-PT-06b-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2859
rslt: Output for LTLCardinality @ FlexibleBarrier-PT-06b

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 15 16:03:01 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 138
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 138
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((p277 <= p269) OR (G ((X (G ((p269 + 1 <= p277))) AND (F ((p269 + 1 <= p277)) OR X (G ((p269 + 1 <= p277)))))) OR G ((p424 <= p495)))))",
"processed_size": 139,
"rewrites": 138
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 323
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 138
},
"result":
{
"edges": 1,
"markings": 2,
"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": 356
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 6,
"visible_transitions": 0
},
"processed": "A (F ((F ((p313 <= p350)) AND (((p196 + 1 <= p136)) U X ((p298 <= p374))))))",
"processed_size": 76,
"rewrites": 138
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 (X ((p445 + 1 <= p312)))",
"processed_size": 26,
"rewrites": 138
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (X (F (((p120 <= p510) OR (F ((p120 <= p510)) AND F (G ((F ((p98 <= 0)) AND ((p287 + 1 <= p342) OR X ((1 <= p199)))))))))))",
"processed_size": 125,
"rewrites": 138
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p124 <= p183))",
"processed_size": 16,
"rewrites": 140
},
"result":
{
"edges": 45,
"markings": 46,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p153 + 1 <= p238))",
"processed_size": 20,
"rewrites": 140
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"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 ((p175 <= p307))))",
"processed_size": 26,
"rewrites": 138
},
"result":
{
"edges": 4087,
"markings": 3130,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 953
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (G (((p372 <= p461) OR (G ((p154 <= p456)) AND F ((p372 <= p461)))))))",
"processed_size": 75,
"rewrites": 138
},
"result":
{
"edges": 37807,
"markings": 23662,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1429
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1429
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p216 <= p155))",
"processed_size": 16,
"rewrites": 138
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2859
},
"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 ((p34 + 1 <= p167)))",
"processed_size": 25,
"rewrites": 140
},
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2859
},
"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": "(p47 <= p209)",
"processed_size": 13,
"rewrites": 138
},
"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": "(p47 <= p209)",
"processed_size": 13,
"rewrites": 138
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (((p314 <= p130) OR (G (F ((p314 <= p130))) AND F ((p314 <= p130))))))",
"processed_size": 75,
"rewrites": 138
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 17,
"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": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 27592,
"runtime": 711.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** AND A(G(*))) : A(F(**)) : A(F(G((** OR (G(**) AND F(**)))))) : FALSE : TRUE : FALSE : A(F(G(**))) : A(X(TRUE)) : A((* OR (G((X(G(*)) AND (F(*) OR X(G(*))))) OR G(*)))) : TRUE : A(F(**)) : A(F((F(**) AND (** U X(**))))) : (** AND A(F((** OR (G(F(**)) AND F(**)))))) : A(G(F(**))) : A(X(*)) : A(X(F((** OR (F(**) AND F(G((F(**) AND (** OR X(**))))))))))"
},
"net":
{
"arcs": 1533,
"conflict_clusters": 425,
"places": 542,
"places_significant": 534,
"singleton_clusters": 0,
"transitions": 621
},
"result":
{
"preliminary_value": "no yes no no yes no no yes yes yes no yes yes no no yes ",
"value": "no yes no no yes no no yes yes yes no yes yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1163/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 542
lola: finding significant places
lola: 542 places, 621 transitions, 534 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= p482)
lola: LP says that atomic proposition is always false: (2 <= p12)
lola: LP says that atomic proposition is always false: (3 <= p136)
lola: LP says that atomic proposition is always false: (2 <= p94)
lola: LP says that atomic proposition is always false: (2 <= p330)
lola: LP says that atomic proposition is always false: (3 <= p286)
lola: LP says that atomic proposition is always false: (3 <= p133)
lola: LP says that atomic proposition is always false: (3 <= p258)
lola: LP says that atomic proposition is always false: (3 <= p133)
lola: LP says that atomic proposition is always false: (2 <= p79)
lola: LP says that atomic proposition is always false: (2 <= p79)
lola: LP says that atomic proposition is always false: (2 <= p452)
lola: LP says that atomic proposition is always false: (3 <= p286)
lola: LP says that atomic proposition is always false: (3 <= p166)
lola: LP says that atomic proposition is always false: (2 <= p301)
lola: LP says that atomic proposition is always false: (3 <= p52)
lola: LP says that atomic proposition is always false: (3 <= p65)
lola: A ((((p216 <= p155)) AND NOT(F ((p167 <= p34))))) : A ((G (NOT(F ((F ((p290 <= p234)) U (3 <= p482))))) U ((p238 <= p153)))) : A (X (X (NOT(F (G (F (G (F (NOT((G ((p154 <= p456)) U (p372 <= p461)))))))))))) : A ((X ((3 <= p136)) OR F (G (F ((2 <= p94)))))) : A (NOT(((2 <= p330) AND G (X ((F (G ((1 <= p418))) OR F (((p397 <= p505) AND X (F ((p397 <= p505))))))))))) : A (F (X ((((p259 <= p532) AND G ((p527 <= p137))) AND X (F (((3 <= p286) AND ((p259 <= p532) U X ((p355 <= p164)))))))))) : A (X ((() U NOT(X (G (NOT(G ((p175 <= p307))))))))) : A ((F (X (NOT(((3 <= p133) OR G ((3 <= p258)))))) OR G (X ((3 <= p133))))) : A (NOT((((p269 + 1 <= p277) AND F ((G ((p277 <= p269)) U X (F ((p277 <= p269)))))) AND F ((p495 + 1 <= p424))))) : A (G ((0 <= p394))) : A ((NOT(G ((p124 <= p183))) U F (((2 <= p79) OR F (((p183 + 1 <= p124))))))) : A (F ((F ((F ((2 <= p452)) U (p313 <= p350))) AND (((p196 + 1 <= p136)) U X ((p298 <= p374)))))) : A ((((p47 <= p209) AND F ((G (F ((p314 <= p130))) U (p314 <= p130)))) OR X (F (((3 <= p166) OR G ((2 <= p301))))))) : A (G (F (X (X (F ((p479 <= p110))))))) : A ((NOT(((p270 <= p437) OR F ((p52 <= 2)))) U X (NOT(((p312 <= p445) OR X (X (G ((3 <= p65))))))))) : A (X (F ((F (G ((F ((p98 <= 0)) AND ((p287 + 1 <= p342) OR X ((1 <= p199)))))) U (p120 <= p510)))))
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:318
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:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 138 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 138 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 138 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 138 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p277 <= p269) OR (G ((X (G ((p269 + 1 <= p277))) AND (F ((p269 + 1 <= p277)) OR X (G ((p269 + 1 <= p277)))))) OR G ((p424 <= p495)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p277 <= p269) OR (G ((X (G ((p269 + 1 <= p277))) AND (F ((p269 + 1 <= p277)) OR X (G ((p269 + 1 <= p277)))))) OR G ((p424 <= p495)))))
lola: processed formula length: 139
lola: 138 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 138 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p313 <= p350)) AND (((p196 + 1 <= p136)) U X ((p298 <= p374))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((p313 <= p350)) AND (((p196 + 1 <= p136)) U X ((p298 <= p374))))))
lola: processed formula length: 76
lola: 138 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p445 + 1 <= p312)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p445 + 1 <= p312)))
lola: processed formula length: 26
lola: 138 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p120 <= p510) OR (F ((p120 <= p510)) AND F (G ((F ((p98 <= 0)) AND ((p287 + 1 <= p342) OR X ((1 <= p199)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((p120 <= p510) OR (F ((p120 <= p510)) AND F (G ((F ((p98 <= 0)) AND ((p287 + 1 <= p342) OR X ((1 <= p199)))))))))))
lola: processed formula length: 125
lola: 138 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p183 + 1 <= p124))))
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: ((p124 <= p183))
lola: processed formula length: 16
lola: 140 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: 46 markings, 45 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p238 <= p153))))
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: ((p153 + 1 <= p238))
lola: processed formula length: 20
lola: 140 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 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p175 <= p307))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p175 <= p307))))
lola: processed formula length: 26
lola: 138 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: 3130 markings, 4087 edges
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p479 <= p110))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p479 <= p110))))
lola: processed formula length: 26
lola: 138 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: 352921 markings, 659920 edges, 70584 markings/sec, 0 secs
lola: 702256 markings, 1320122 edges, 69867 markings/sec, 5 secs
lola: 1054672 markings, 1981699 edges, 70483 markings/sec, 10 secs
lola: 1404275 markings, 2642557 edges, 69921 markings/sec, 15 secs
lola: 1745116 markings, 3292262 edges, 68168 markings/sec, 20 secs
lola: 2091770 markings, 3943041 edges, 69331 markings/sec, 25 secs
lola: 2433964 markings, 4590799 edges, 68439 markings/sec, 30 secs
lola: 2761536 markings, 5214813 edges, 65514 markings/sec, 35 secs
lola: 3097122 markings, 5844728 edges, 67117 markings/sec, 40 secs
lola: 3431702 markings, 6479413 edges, 66916 markings/sec, 45 secs
lola: 3768825 markings, 7117987 edges, 67425 markings/sec, 50 secs
lola: 4100827 markings, 7749846 edges, 66400 markings/sec, 55 secs
lola: 4399593 markings, 8420031 edges, 59753 markings/sec, 60 secs
lola: 4681895 markings, 9085528 edges, 56460 markings/sec, 65 secs
lola: 4896726 markings, 9841699 edges, 42966 markings/sec, 70 secs
lola: 5115915 markings, 10593595 edges, 43838 markings/sec, 75 secs
lola: 5356884 markings, 11312338 edges, 48194 markings/sec, 80 secs
lola: 5556073 markings, 12087296 edges, 39838 markings/sec, 85 secs
lola: 5763402 markings, 12869591 edges, 41466 markings/sec, 90 secs
lola: 5965981 markings, 13645515 edges, 40516 markings/sec, 95 secs
lola: 6176147 markings, 14415652 edges, 42033 markings/sec, 100 secs
lola: 6355559 markings, 15111235 edges, 35882 markings/sec, 105 secs
lola: 6533369 markings, 15816854 edges, 35562 markings/sec, 110 secs
lola: 6713221 markings, 16575673 edges, 35970 markings/sec, 115 secs
lola: 6893254 markings, 17309293 edges, 36007 markings/sec, 120 secs
lola: 7098229 markings, 18046015 edges, 40995 markings/sec, 125 secs
lola: 7396250 markings, 18672265 edges, 59604 markings/sec, 130 secs
lola: 7682728 markings, 19310858 edges, 57296 markings/sec, 135 secs
lola: 7954434 markings, 19951354 edges, 54341 markings/sec, 140 secs
lola: 8150509 markings, 20693105 edges, 39215 markings/sec, 145 secs
lola: 8368065 markings, 21410249 edges, 43511 markings/sec, 150 secs
lola: 8587523 markings, 22124206 edges, 43892 markings/sec, 155 secs
lola: 8780454 markings, 22874153 edges, 38586 markings/sec, 160 secs
lola: 8977310 markings, 23638050 edges, 39371 markings/sec, 165 secs
lola: 9178358 markings, 24419149 edges, 40210 markings/sec, 170 secs
lola: 9389208 markings, 25164451 edges, 42170 markings/sec, 175 secs
lola: 9587361 markings, 25906953 edges, 39631 markings/sec, 180 secs
lola: 9759828 markings, 26617282 edges, 34493 markings/sec, 185 secs
lola: 9940027 markings, 27374825 edges, 36040 markings/sec, 190 secs
lola: 10120125 markings, 28116284 edges, 36020 markings/sec, 195 secs
lola: 10344671 markings, 28827598 edges, 44909 markings/sec, 200 secs
lola: 10661803 markings, 29429970 edges, 63426 markings/sec, 205 secs
lola: 10977378 markings, 30036788 edges, 63115 markings/sec, 210 secs
lola: 11271108 markings, 30643543 edges, 58746 markings/sec, 215 secs
lola: 11535567 markings, 31293375 edges, 52892 markings/sec, 220 secs
lola: 11787880 markings, 31989272 edges, 50463 markings/sec, 225 secs
lola: 11968806 markings, 32725830 edges, 36185 markings/sec, 230 secs
lola: 12154976 markings, 33477449 edges, 37234 markings/sec, 235 secs
lola: 12356267 markings, 34244338 edges, 40258 markings/sec, 240 secs
lola: 12570169 markings, 35013053 edges, 42780 markings/sec, 245 secs
lola: 12768796 markings, 35782341 edges, 39725 markings/sec, 250 secs
lola: 12971768 markings, 36546211 edges, 40594 markings/sec, 255 secs
lola: 13154329 markings, 37293646 edges, 36512 markings/sec, 260 secs
lola: 13345287 markings, 38030931 edges, 38192 markings/sec, 265 secs
lola: 13582973 markings, 38735705 edges, 47537 markings/sec, 270 secs
lola: 13882596 markings, 39344721 edges, 59925 markings/sec, 275 secs
lola: 14150619 markings, 39966416 edges, 53605 markings/sec, 280 secs
lola: 14413851 markings, 40650297 edges, 52646 markings/sec, 285 secs
lola: 14597373 markings, 41380974 edges, 36704 markings/sec, 290 secs
lola: 14781293 markings, 42129201 edges, 36784 markings/sec, 295 secs
lola: 14969899 markings, 42898562 edges, 37721 markings/sec, 300 secs
lola: 15192629 markings, 43640754 edges, 44546 markings/sec, 305 secs
lola: 15393707 markings, 44419644 edges, 40216 markings/sec, 310 secs
lola: 15593671 markings, 45183887 edges, 39993 markings/sec, 315 secs
lola: 15772517 markings, 45915301 edges, 35769 markings/sec, 320 secs
lola: 15963350 markings, 46658897 edges, 38167 markings/sec, 325 secs
lola: 16172297 markings, 47394470 edges, 41789 markings/sec, 330 secs
lola: 16484133 markings, 47981307 edges, 62367 markings/sec, 335 secs
lola: 16796629 markings, 48569840 edges, 62499 markings/sec, 340 secs
lola: 17109955 markings, 49158931 edges, 62665 markings/sec, 345 secs
lola: 17422660 markings, 49757174 edges, 62541 markings/sec, 350 secs
lola: 17735692 markings, 50348506 edges, 62606 markings/sec, 355 secs
lola: 18056953 markings, 50961370 edges, 64252 markings/sec, 360 secs
lola: 18371991 markings, 51585079 edges, 63008 markings/sec, 365 secs
lola: 18648696 markings, 52234799 edges, 55341 markings/sec, 370 secs
lola: 18834822 markings, 52966000 edges, 37225 markings/sec, 375 secs
lola: 19047915 markings, 53676423 edges, 42619 markings/sec, 380 secs
lola: 19242284 markings, 54415023 edges, 38874 markings/sec, 385 secs
lola: 19440317 markings, 55167410 edges, 39607 markings/sec, 390 secs
lola: 19639236 markings, 55930731 edges, 39784 markings/sec, 395 secs
lola: 19845416 markings, 56697825 edges, 41236 markings/sec, 400 secs
lola: 20036514 markings, 57393246 edges, 38220 markings/sec, 405 secs
lola: 20215148 markings, 58111980 edges, 35727 markings/sec, 410 secs
lola: 20383915 markings, 58862725 edges, 33753 markings/sec, 415 secs
lola: 20563189 markings, 59585193 edges, 35855 markings/sec, 420 secs
lola: 20750822 markings, 60314535 edges, 37527 markings/sec, 425 secs
lola: 21002236 markings, 60961147 edges, 50283 markings/sec, 430 secs
lola: 21322003 markings, 61581768 edges, 63953 markings/sec, 435 secs
lola: 21631867 markings, 62212761 edges, 61973 markings/sec, 440 secs
lola: 21857607 markings, 62909215 edges, 45148 markings/sec, 445 secs
lola: 22064425 markings, 63627345 edges, 41364 markings/sec, 450 secs
lola: 22257489 markings, 64366164 edges, 38613 markings/sec, 455 secs
lola: 22459694 markings, 65113016 edges, 40441 markings/sec, 460 secs
lola: 22656897 markings, 65871039 edges, 39441 markings/sec, 465 secs
lola: 22858502 markings, 66642513 edges, 40321 markings/sec, 470 secs
lola: 23067402 markings, 67380643 edges, 41780 markings/sec, 475 secs
lola: 23252991 markings, 68098669 edges, 37118 markings/sec, 480 secs
lola: 23418627 markings, 68822357 edges, 33127 markings/sec, 485 secs
lola: 23591680 markings, 69562290 edges, 34611 markings/sec, 490 secs
lola: 23774994 markings, 70294735 edges, 36663 markings/sec, 495 secs
lola: 23980397 markings, 70994982 edges, 41081 markings/sec, 500 secs
lola: 24286528 markings, 71610277 edges, 61226 markings/sec, 505 secs
lola: 24602559 markings, 72235955 edges, 63206 markings/sec, 510 secs
lola: 24881940 markings, 72884192 edges, 55876 markings/sec, 515 secs
lola: 25068276 markings, 73613067 edges, 37267 markings/sec, 520 secs
lola: 25280033 markings, 74325964 edges, 42351 markings/sec, 525 secs
lola: 25473398 markings, 75065314 edges, 38673 markings/sec, 530 secs
lola: 25671128 markings, 75813592 edges, 39546 markings/sec, 535 secs
lola: 25869766 markings, 76575299 edges, 39728 markings/sec, 540 secs
lola: 26076709 markings, 77344321 edges, 41389 markings/sec, 545 secs
lola: 26269770 markings, 78043540 edges, 38612 markings/sec, 550 secs
lola: 26449905 markings, 78766672 edges, 36027 markings/sec, 555 secs
lola: 26618811 markings, 79518164 edges, 33781 markings/sec, 560 secs
lola: 26796964 markings, 80238482 edges, 35631 markings/sec, 565 secs
lola: 26983654 markings, 80967761 edges, 37338 markings/sec, 570 secs
lola: 27233409 markings, 81615813 edges, 49951 markings/sec, 575 secs
lola: 27553653 markings, 82237379 edges, 64049 markings/sec, 580 secs
lola: 27864554 markings, 82868508 edges, 62180 markings/sec, 585 secs
lola: 28092205 markings, 83562555 edges, 45530 markings/sec, 590 secs
lola: 28297814 markings, 84275425 edges, 41122 markings/sec, 595 secs
lola: 28489778 markings, 85009902 edges, 38393 markings/sec, 600 secs
lola: 28690409 markings, 85751123 edges, 40126 markings/sec, 605 secs
lola: 28887351 markings, 86508327 edges, 39388 markings/sec, 610 secs
lola: 29088392 markings, 87276351 edges, 40208 markings/sec, 615 secs
lola: 29297600 markings, 88015723 edges, 41842 markings/sec, 620 secs
lola: 29482434 markings, 88733351 edges, 36967 markings/sec, 625 secs
lola: 29647760 markings, 89450312 edges, 33065 markings/sec, 630 secs
lola: 29819954 markings, 90193096 edges, 34439 markings/sec, 635 secs
lola: 30003109 markings, 90923152 edges, 36631 markings/sec, 640 secs
lola: 30207452 markings, 91625982 edges, 40869 markings/sec, 645 secs
lola: 30496619 markings, 92229834 edges, 57833 markings/sec, 650 secs
lola: 30807843 markings, 92819168 edges, 62245 markings/sec, 655 secs
lola: 31117402 markings, 93410122 edges, 61912 markings/sec, 660 secs
lola: 31427436 markings, 94009803 edges, 62007 markings/sec, 665 secs
lola: 31732836 markings, 94584027 edges, 61080 markings/sec, 670 secs
lola: 32043349 markings, 95175056 edges, 62103 markings/sec, 675 secs
lola: 32353055 markings, 95753712 edges, 61941 markings/sec, 680 secs
lola: 32661218 markings, 96339384 edges, 61633 markings/sec, 685 secs
lola: 32972172 markings, 96938737 edges, 62191 markings/sec, 690 secs
lola: 33278061 markings, 97541033 edges, 61178 markings/sec, 695 secs
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: 33458636 markings, 97902347 edges
lola: ========================================
lola: subprocess 13 will run for 953 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((p372 <= p461) OR (G ((p154 <= p456)) AND F ((p372 <= p461)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((p372 <= p461) OR (G ((p154 <= p456)) AND F ((p372 <= p461)))))))
lola: processed formula length: 75
lola: 138 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: 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: 23662 markings, 37807 edges
lola: ========================================
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p216 <= p155)) AND A (G ((p34 + 1 <= p167))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p216 <= p155))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p216 <= p155))
lola: processed formula length: 16
lola: 138 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: subprocess 15 will run for 2859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p34 + 1 <= p167)))
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 ((p34 + 1 <= p167)))
lola: processed formula length: 25
lola: 140 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p47 <= p209) AND A (F (((p314 <= p130) OR (G (F ((p314 <= p130))) AND F ((p314 <= p130)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p47 <= p209)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p47 <= p209)
lola: processed formula length: 13
lola: 138 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: 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: ========================================
lola: ...considering subproblem: ((p47 <= p209) AND A (F (((p314 <= p130) OR (G (F ((p314 <= p130))) AND F ((p314 <= p130)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p47 <= p209)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p47 <= p209)
lola: processed formula length: 13
lola: 138 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 (F (((p314 <= p130) OR (G (F ((p314 <= p130))) AND F ((p314 <= p130))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((p314 <= p130) OR (G (F ((p314 <= p130))) AND F ((p314 <= p130))))))
lola: processed formula length: 75
lola: 138 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no no yes yes yes no yes yes no no yes
lola:
preliminary result: no yes no no yes no no yes yes yes no yes yes no no yes
lola: ========================================
lola: memory consumption: 27592 KB
lola: time consumption: 711 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589559292273

--------------------
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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r090-smll-158922999400071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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