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-158922999300025.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 FMS-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r090-smll-158922999300025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.4K Apr 1 20:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 1 20:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 1 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 1 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 1 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 1 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-20000-00
FORMULA_NAME FMS-PT-20000-01
FORMULA_NAME FMS-PT-20000-02
FORMULA_NAME FMS-PT-20000-03
FORMULA_NAME FMS-PT-20000-04
FORMULA_NAME FMS-PT-20000-05
FORMULA_NAME FMS-PT-20000-06
FORMULA_NAME FMS-PT-20000-07
FORMULA_NAME FMS-PT-20000-08
FORMULA_NAME FMS-PT-20000-09
FORMULA_NAME FMS-PT-20000-10
FORMULA_NAME FMS-PT-20000-11
FORMULA_NAME FMS-PT-20000-12
FORMULA_NAME FMS-PT-20000-13
FORMULA_NAME FMS-PT-20000-14
FORMULA_NAME FMS-PT-20000-15

=== Now, execution of the tool begins

BK_START 1589542304777

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FMS-PT-20000 @ 3570 seconds

FORMULA FMS-PT-20000-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2183
rslt: Output for LTLCardinality @ FMS-PT-20000

{
"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": "Fri May 15 11:31:44 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": "TRUE",
"processed_size": 4,
"rewrites": 137
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 137
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (X (X (F ((3 <= P1M1))))))",
"processed_size": 31,
"rewrites": 137
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 294
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"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 ((P12M3 + 1 <= P2s)))",
"processed_size": 26,
"rewrites": 139
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 359
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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 (X (X (F ((P2wM2 <= 0)))))",
"processed_size": 28,
"rewrites": 137
},
"result":
{
"edges": 7,
"markings": 7,
"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": 404
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((F ((G ((P1M1 <= P2M2)) OR G ((P2s <= P2M2)))) U X (F ((P2s <= P2M2)))))",
"processed_size": 75,
"rewrites": 137
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 478
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G ((F ((P12 <= P2s)) AND ((2 <= P1M1) OR (P12 <= P2s))))))",
"processed_size": 64,
"rewrites": 137
},
"result":
{
"edges": 360053,
"markings": 300040,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 574
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((1 <= P3s) AND (F ((P2wM2 <= P2wP1)) AND G ((P2d + 1 <= P2wP1)))) U (3 <= P1wP2)))",
"processed_size": 87,
"rewrites": 137
},
"result":
{
"edges": 100004,
"markings": 100004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 717
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "A (((P1d + 1 <= P12s) R (P2M2 + 1 <= P12s)))",
"processed_size": 44,
"rewrites": 141
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "universal_release"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 956
},
"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": "(P2d <= P2wM2)",
"processed_size": 14,
"rewrites": 137
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1435
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((P2wM2 + 1 <= P2d))))",
"processed_size": 30,
"rewrites": 137
},
"result":
{
"edges": 80006,
"markings": 80005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1435
},
"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": "(P1 <= P1d)",
"processed_size": 11,
"rewrites": 137
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2870
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((P2d <= P12wM3) AND (M3 + 1 <= P12M3))))",
"processed_size": 47,
"rewrites": 139
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21580,
"runtime": 1387.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(**)) AND A(X(G((* AND X(F(**))))))) : (A(G(F((** OR G(**))))) AND A(G(((** U **) OR X(F((** OR G(**)))))))) : A(X(G((** OR (F(**) OR (G(F(**)) OR G((F(**) AND F(**))))))))) : A(X(F((** AND G(*))))) : A(((** AND (F(**) AND G(*))) U **)) : A((* R *)) : A(X(X(X(F(**))))) : TRUE : (A(G(**)) AND A(((** AND F(**)) OR (G((F(**) AND (** OR **))) AND F((** AND F(**))))))) : (A(X(**)) AND (A(G(*)) AND A((F(**) OR G(*))))) : A(X(X(F(*)))) : (** AND A(F(G(*)))) : FALSE : A(F(G((F(**) AND (** OR **))))) : A((F((G(**) OR G(**))) U X(F(**)))) : (** AND (A(F(**)) AND A(G(**))))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no unknown unknown unknown no no no yes no no no no no no yes no ",
"value": "no unknown unknown unknown no no no yes no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= P2M2)
lola: A (G (((P12wM3 + 1 <= P3) AND NOT((X ((P3 <= P12wM3)) OR NOT(F (X (X ((3 <= P3s)))))))))) : A (G ((((P3 <= M2) U (P3s <= P12)) U F ((X ((P1s <= M3)) OR G (X (G ((M2 + 1 <= P3))))))))) : A (X (G ((((P2wM2 + 1 <= P2s) OR F ((1 <= P2wM2))) OR (G (F ((2 <= M3))) U G (F ((P2s <= P2wM2)))))))) : A (F (X (((2 <= P3s) AND NOT(((0 <= P2wM2) U (F ((P2wP1 <= P12)) U (3 <= P3M2)))))))) : A (((((1 <= P3s) AND F ((P2wM2 <= P2wP1))) AND NOT(F ((P2wP1 <= P2d)))) U (3 <= P1wP2))) : A (NOT(((P12s <= P1d) U (P12s <= P2M2)))) : A (X (X (F (X ((3 <= P1M1)))))) : A (F (G (((2 <= M1) OR G ((0 <= P1d)))))) : A ((G (((P2d <= P12wM3) AND (M3 + 1 <= P12M3))) AND (G (((P2d <= P12wM3) U (2 <= P1))) U ((P2d <= P12wM3) AND F ((P2d <= P12wM3)))))) : A (NOT((NOT(X ((P12wM3 <= P12s))) OR (NOT(F ((P1s <= P3M2))) U ((P2M2 <= 1) AND F ((P2s <= P12M3))))))) : A (F (NOT(X (X ((1 <= P2wM2)))))) : A (((P2d <= P2wM2) AND X (F (G (NOT(((0 <= P1) U F ((X ((P2d <= P2wM2)) AND F ((0 <= P1))))))))))) : A ((NOT(X (X ((P2s <= P12M3)))) AND G (NOT(((P2s <= P12M3) OR X ((0 <= P1M1))))))) : A (F (((3 <= P2wM2) U NOT(G (X (NOT(G (((2 <= P1M1) U (P12 <= P2s)))))))))) : A (((F (G ((P1M1 <= P2M2))) OR F (G ((P2s <= P2M2)))) U F (X ((P2s <= P2M2))))) : A ((((P1 <= P1d) AND F ((P1 <= P3M2))) AND G ((P1 <= P1d))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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: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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k: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:300
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:536
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: 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: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 137 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: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((P2wM2 + 1 <= P2s) OR (F ((1 <= P2wM2)) OR (G (F ((P2s <= P2wM2))) OR G ((F ((2 <= M3)) AND F ((P2s <= P2wM2))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((P2wM2 + 1 <= P2s) OR (F ((1 <= P2wM2)) OR (G (F ((P2s <= P2wM2))) OR G ((F ((2 <= M3)) AND F ((P2s <= P2wM2))))))))))
lola: processed formula length: 128
lola: 137 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: 2836019 markings, 5199757 edges, 567204 markings/sec, 0 secs
lola: 5537234 markings, 10154048 edges, 540243 markings/sec, 5 secs
lola: 8283272 markings, 15185917 edges, 549208 markings/sec, 10 secs
lola: 11013607 markings, 20202914 edges, 546067 markings/sec, 15 secs
lola: 13769232 markings, 25251699 edges, 551125 markings/sec, 20 secs
lola: 16492997 markings, 30232584 edges, 544753 markings/sec, 25 secs
lola: 19211956 markings, 35222467 edges, 543792 markings/sec, 30 secs
lola: 21894179 markings, 40133631 edges, 536445 markings/sec, 35 secs
lola: 24609037 markings, 45116222 edges, 542972 markings/sec, 40 secs
lola: 27263408 markings, 49984767 edges, 530874 markings/sec, 45 secs
lola: 29911373 markings, 54840499 edges, 529593 markings/sec, 50 secs
lola: 32539706 markings, 59656966 edges, 525667 markings/sec, 55 secs
lola: 35143118 markings, 64442238 edges, 520682 markings/sec, 60 secs
lola: 37748897 markings, 69198461 edges, 521156 markings/sec, 65 secs
lola: 40332166 markings, 73941303 edges, 516654 markings/sec, 70 secs
lola: 42940563 markings, 78737109 edges, 521679 markings/sec, 75 secs
lola: 45611453 markings, 83619481 edges, 534178 markings/sec, 80 secs
lola: 48245314 markings, 88447003 edges, 526772 markings/sec, 85 secs
lola: 50903829 markings, 93323835 edges, 531703 markings/sec, 90 secs
lola: 53556691 markings, 98189363 edges, 530572 markings/sec, 95 secs
lola: 56206731 markings, 103045326 edges, 530008 markings/sec, 100 secs
lola: 58821016 markings, 107837617 edges, 522857 markings/sec, 105 secs
lola: 61412663 markings, 112595513 edges, 518329 markings/sec, 110 secs
lola: 64074190 markings, 117472586 edges, 532305 markings/sec, 115 secs
lola: 66812420 markings, 122494365 edges, 547646 markings/sec, 120 secs
lola: 69439227 markings, 127301117 edges, 525361 markings/sec, 125 secs
lola: 71897917 markings, 131810438 edges, 491738 markings/sec, 130 secs
lola: 74404293 markings, 136403000 edges, 501275 markings/sec, 135 secs
lola: 77004052 markings, 141172425 edges, 519952 markings/sec, 140 secs
lola: 79620343 markings, 145958353 edges, 523258 markings/sec, 145 secs
lola: 82226110 markings, 150746049 edges, 521153 markings/sec, 150 secs
lola: 84810828 markings, 155488585 edges, 516944 markings/sec, 155 secs
lola: 87386788 markings, 160207019 edges, 515192 markings/sec, 160 secs
lola: 89350644 markings, 163797670 edges, 392771 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((2 <= P3s) AND G ((P3M2 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((2 <= P3s) AND G ((P3M2 <= 2))))))
lola: processed formula length: 44
lola: 137 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: 2737262 markings, 5032979 edges, 547452 markings/sec, 0 secs
lola: 5784511 markings, 10608727 edges, 609450 markings/sec, 5 secs
lola: 8794348 markings, 16128252 edges, 601967 markings/sec, 10 secs
lola: 11785403 markings, 21610213 edges, 598211 markings/sec, 15 secs
lola: 14844703 markings, 27220824 edges, 611860 markings/sec, 20 secs
lola: 17843863 markings, 32718537 edges, 599832 markings/sec, 25 secs
lola: 20831112 markings, 38186471 edges, 597450 markings/sec, 30 secs
lola: 23853096 markings, 43741242 edges, 604397 markings/sec, 35 secs
lola: 26863095 markings, 49262421 edges, 602000 markings/sec, 40 secs
lola: 29843866 markings, 54717795 edges, 596154 markings/sec, 45 secs
lola: 32788417 markings, 60115189 edges, 588910 markings/sec, 50 secs
lola: 35712885 markings, 65469972 edges, 584894 markings/sec, 55 secs
lola: 38618921 markings, 70814885 edges, 581207 markings/sec, 60 secs
lola: 41501513 markings, 76100474 edges, 576518 markings/sec, 65 secs
lola: 44512418 markings, 81611303 edges, 602181 markings/sec, 70 secs
lola: 47475615 markings, 87036065 edges, 592639 markings/sec, 75 secs
lola: 50418232 markings, 92433939 edges, 588523 markings/sec, 80 secs
lola: 53362758 markings, 97833555 edges, 588905 markings/sec, 85 secs
lola: 56307088 markings, 103231357 edges, 588866 markings/sec, 90 secs
lola: 59253852 markings, 108640921 edges, 589353 markings/sec, 95 secs
lola: 62162551 markings, 113961989 edges, 581740 markings/sec, 100 secs
lola: 65243215 markings, 119613954 edges, 616133 markings/sec, 105 secs
lola: 68345131 markings, 125288550 edges, 620383 markings/sec, 110 secs
lola: 71359951 markings, 130825412 edges, 602964 markings/sec, 115 secs
lola: 74366619 markings, 136341893 edges, 601334 markings/sec, 120 secs
lola: 77299085 markings, 141714299 edges, 586493 markings/sec, 125 secs
lola: 80249101 markings, 147127731 edges, 590003 markings/sec, 130 secs
lola: 83161562 markings, 152459482 edges, 582492 markings/sec, 135 secs
lola: 86190868 markings, 158017423 edges, 605861 markings/sec, 140 secs
lola: 89104938 markings, 163346769 edges, 582814 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((3 <= P1M1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((3 <= P1M1))))))
lola: processed formula length: 31
lola: 137 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((P12wM3 + 1 <= P3))) AND A (X (G (((P12wM3 + 1 <= P3) AND X (F ((3 <= P3s))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P12wM3 + 1 <= P3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((P12wM3 + 1 <= P3)))
lola: processed formula length: 26
lola: 139 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P3 <= P12wM3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20001 markings, 20000 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((P12wM3 <= P12s))) AND (A (G ((P12M3 + 1 <= P2s))) AND A ((F ((P1s <= P3M2)) OR G ((P12M3 + 1 <= P2s))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P12M3 + 1 <= P2s)))
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 ((P12M3 + 1 <= P2s)))
lola: processed formula length: 26
lola: 139 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((P2wM2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((P2wM2 <= 0)))))
lola: processed formula length: 28
lola: 137 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (((P1s <= M3) OR G ((M2 + 1 <= P3)))))) AND A (G ((((P3 <= M2) U (P3s <= P12)) OR X (F (((P1s <= M3) OR G ((M2 + 1 <= P3)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((P1s <= M3) OR G ((M2 + 1 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((P1s <= M3) OR G ((M2 + 1 <= P3))))))
lola: processed formula length: 47
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2885576 markings, 4770875 edges, 577115 markings/sec, 0 secs
lola: 5957434 markings, 9894285 edges, 614372 markings/sec, 5 secs
lola: 8989404 markings, 14937918 edges, 606394 markings/sec, 10 secs
lola: 11997128 markings, 19953067 edges, 601545 markings/sec, 15 secs
lola: 14956990 markings, 24892498 edges, 591972 markings/sec, 20 secs
lola: 17865034 markings, 29728291 edges, 581609 markings/sec, 25 secs
lola: 20902585 markings, 34802237 edges, 607510 markings/sec, 30 secs
lola: 23876884 markings, 39751392 edges, 594860 markings/sec, 35 secs
lola: 26822434 markings, 44662198 edges, 589110 markings/sec, 40 secs
lola: 29725736 markings, 49505241 edges, 580660 markings/sec, 45 secs
lola: 32561970 markings, 54221428 edges, 567247 markings/sec, 50 secs
lola: 35627485 markings, 59331417 edges, 613103 markings/sec, 55 secs
lola: 38633708 markings, 64343564 edges, 601245 markings/sec, 60 secs
lola: 41605150 markings, 69304456 edges, 594288 markings/sec, 65 secs
lola: 44544535 markings, 74203793 edges, 587877 markings/sec, 70 secs
lola: 47440055 markings, 79019265 edges, 579104 markings/sec, 75 secs
lola: 50392646 markings, 83940262 edges, 590518 markings/sec, 80 secs
lola: 53311143 markings, 88810255 edges, 583699 markings/sec, 85 secs
lola: 56147748 markings, 93529892 edges, 567321 markings/sec, 90 secs
lola: 59035312 markings, 98344732 edges, 577513 markings/sec, 95 secs
lola: 61818601 markings, 102991032 edges, 556658 markings/sec, 100 secs
lola: 64677469 markings, 107748481 edges, 571774 markings/sec, 105 secs
lola: 67629894 markings, 112673037 edges, 590485 markings/sec, 110 secs
lola: 70530560 markings, 117509384 edges, 580133 markings/sec, 115 secs
lola: 73448916 markings, 122370499 edges, 583671 markings/sec, 120 secs
lola: 76305902 markings, 127124631 edges, 571397 markings/sec, 125 secs
lola: 79051392 markings, 131710075 edges, 549098 markings/sec, 130 secs
lola: 81964929 markings, 136561673 edges, 582707 markings/sec, 135 secs
lola: 84761098 markings, 141219685 edges, 559234 markings/sec, 140 secs
lola: 87522395 markings, 145820937 edges, 552259 markings/sec, 145 secs
lola: 90306276 markings, 150463534 edges, 556776 markings/sec, 150 secs
lola: 91224332 markings, 151999556 edges, 183611 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((P3 <= M2) U (P3s <= P12)) OR X (F (((P1s <= M3) OR G ((M2 + 1 <= P3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((((P3 <= M2) U (P3s <= P12)) OR X (F (((P1s <= M3) OR G ((M2 + 1 <= P3))))))))
lola: processed formula length: 84
lola: 137 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: 2794489 markings, 5155984 edges, 558898 markings/sec, 0 secs
lola: 5820863 markings, 10681201 edges, 605275 markings/sec, 5 secs
lola: 8756439 markings, 16072096 edges, 587115 markings/sec, 10 secs
lola: 11713331 markings, 21452338 edges, 591378 markings/sec, 15 secs
lola: 14592956 markings, 26731161 edges, 575925 markings/sec, 20 secs
lola: 17421340 markings, 31939599 edges, 565677 markings/sec, 25 secs
lola: 20278241 markings, 37194677 edges, 571380 markings/sec, 30 secs
lola: 23203708 markings, 42521390 edges, 585093 markings/sec, 35 secs
lola: 26026191 markings, 47730064 edges, 564497 markings/sec, 40 secs
lola: 28874826 markings, 52947077 edges, 569727 markings/sec, 45 secs
lola: 31694780 markings, 58106729 edges, 563991 markings/sec, 50 secs
lola: 34484596 markings, 63258609 edges, 557963 markings/sec, 55 secs
lola: 37418063 markings, 68614317 edges, 586693 markings/sec, 60 secs
lola: 40311545 markings, 73907511 edges, 578696 markings/sec, 65 secs
lola: 43132904 markings, 79118663 edges, 564272 markings/sec, 70 secs
lola: 45952085 markings, 84246377 edges, 563836 markings/sec, 75 secs
lola: 48790291 markings, 89421648 edges, 567641 markings/sec, 80 secs
lola: 51587305 markings, 94590020 edges, 559403 markings/sec, 85 secs
lola: 54445015 markings, 99825183 edges, 571542 markings/sec, 90 secs
lola: 57252436 markings, 104959770 edges, 561484 markings/sec, 95 secs
lola: 60036002 markings, 110094996 edges, 556713 markings/sec, 100 secs
lola: 62822777 markings, 115141694 edges, 557355 markings/sec, 105 secs
lola: 65527922 markings, 120130006 edges, 541029 markings/sec, 110 secs
lola: 68448764 markings, 125491435 edges, 584168 markings/sec, 115 secs
lola: 71347505 markings, 130808660 edges, 579748 markings/sec, 120 secs
lola: 74214861 markings, 136063116 edges, 573471 markings/sec, 125 secs
lola: 76988738 markings, 141181033 edges, 554775 markings/sec, 130 secs
lola: 79811084 markings, 146331053 edges, 564469 markings/sec, 135 secs
lola: 82646547 markings, 151499468 edges, 567093 markings/sec, 140 secs
lola: 85458705 markings, 156670160 edges, 562432 markings/sec, 145 secs
lola: 88158967 markings, 161650146 edges, 540052 markings/sec, 150 secs
lola: 90971952 markings, 166792291 edges, 562597 markings/sec, 155 secs
lola: 93737513 markings, 171848139 edges, 553112 markings/sec, 160 secs
lola: 96420455 markings, 176810805 edges, 536588 markings/sec, 165 secs
lola: 99273673 markings, 182025903 edges, 570644 markings/sec, 170 secs
lola: 102074702 markings, 187108236 edges, 560206 markings/sec, 175 secs
lola: 104778324 markings, 192087322 edges, 540724 markings/sec, 180 secs
lola: 107478107 markings, 197016301 edges, 539957 markings/sec, 185 secs
lola: 110168974 markings, 201968143 edges, 538173 markings/sec, 190 secs
lola: 112036733 markings, 205403501 edges, 373552 markings/sec, 195 secs
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: subprocess 9 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((G ((P1M1 <= P2M2)) OR G ((P2s <= P2M2)))) U X (F ((P2s <= P2M2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((G ((P1M1 <= P2M2)) OR G ((P2s <= P2M2)))) U X (F ((P2s <= P2M2)))))
lola: processed formula length: 75
lola: 137 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((P12 <= P2s)) AND ((2 <= P1M1) OR (P12 <= P2s))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((P12 <= P2s)) AND ((2 <= P1M1) OR (P12 <= P2s))))))
lola: processed formula length: 64
lola: 137 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: 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: 300040 markings, 360053 edges
lola: ========================================
lola: subprocess 11 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= P3s) AND (F ((P2wM2 <= P2wP1)) AND G ((P2d + 1 <= P2wP1)))) U (3 <= P1wP2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= P3s) AND (F ((P2wM2 <= P2wP1)) AND G ((P2d + 1 <= P2wP1)))) U (3 <= P1wP2)))
lola: processed formula length: 87
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 100004 markings, 100004 edges
lola: ========================================
lola: subprocess 12 will run for 717 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P1d + 1 <= P12s) R (P2M2 + 1 <= P12s)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((P1d + 1 <= P12s) R (P2M2 + 1 <= P12s)))
lola: processed formula length: 44
lola: 141 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 956 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((P2d <= P2wM2) AND A (F (G ((P2wM2 + 1 <= P2d)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 956 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P2d <= P2wM2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P2d <= P2wM2)
lola: processed formula length: 14
lola: 137 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 14 will run for 1435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P2wM2 + 1 <= P2d))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P2wM2 + 1 <= P2d))))
lola: processed formula length: 30
lola: 137 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: 80005 markings, 80006 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((P1 <= P1d) AND (A (F ((P1 <= P3M2))) AND A (G ((P1 <= P1d)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P1 <= P1d)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P1 <= P1d)
lola: processed formula length: 11
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2870 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((P2d <= P12wM3) AND (M3 + 1 <= P12M3)))) AND A ((((P2d <= P12wM3) AND F ((P2d <= P12wM3))) OR (G ((F ((2 <= P1)) AND ((P2d <= P12wM3) OR (2 <= P1)))) AND F (((P2d <= P12wM3) AND F ((P2d <= P12wM3))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2870 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P2d <= P12wM3) AND (M3 + 1 <= P12M3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((P2d <= P12wM3) AND (M3 + 1 <= P12M3))))
lola: processed formula length: 47
lola: 139 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((P12wM3 + 1 <= P2d) OR (P12M3 <= M3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
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: ========================================
lola: ...considering subproblem: A (X (G (((P2wM2 + 1 <= P2s) OR (F ((1 <= P2wM2)) OR (G (F ((P2s <= P2wM2))) OR G ((F ((2 <= M3)) AND F ((P2s <= P2wM2))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((P2wM2 + 1 <= P2s) OR (F ((1 <= P2wM2)) OR (G (F ((P2s <= P2wM2))) OR G ((F ((2 <= M3)) AND F ((P2s <= P2wM2))))))))))
lola: processed formula length: 128
lola: 137 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2478757 markings, 4546638 edges, 495751 markings/sec, 0 secs
lola: 5243727 markings, 9618790 edges, 552994 markings/sec, 5 secs
lola: 7877550 markings, 14443083 edges, 526765 markings/sec, 10 secs
lola: 10591638 markings, 19422478 edges, 542818 markings/sec, 15 secs
lola: 12917492 markings, 23682434 edges, 465171 markings/sec, 20 secs
lola: 15493979 markings, 28406790 edges, 515297 markings/sec, 25 secs
lola: 18216989 markings, 33410649 edges, 544602 markings/sec, 30 secs
lola: 20923057 markings, 38362534 edges, 541214 markings/sec, 35 secs
lola: 23612212 markings, 43298166 edges, 537831 markings/sec, 40 secs
lola: 26299077 markings, 48216177 edges, 537373 markings/sec, 45 secs
lola: 28958104 markings, 53094033 edges, 531805 markings/sec, 50 secs
lola: 31609820 markings, 57949029 edges, 530343 markings/sec, 55 secs
lola: 34237908 markings, 62773245 edges, 525618 markings/sec, 60 secs
lola: 36548181 markings, 66996792 edges, 462055 markings/sec, 65 secs
lola: 38533047 markings, 70643199 edges, 396973 markings/sec, 70 secs
lola: 40272550 markings, 73827343 edges, 347901 markings/sec, 75 secs
lola: 42906727 markings, 78652521 edges, 526835 markings/sec, 80 secs
lola: 45580852 markings, 83577570 edges, 534825 markings/sec, 85 secs
lola: 48235907 markings, 88434700 edges, 531011 markings/sec, 90 secs
lola: 50914283 markings, 93344744 edges, 535675 markings/sec, 95 secs
lola: 53585157 markings, 98227529 edges, 534175 markings/sec, 100 secs
lola: 56242491 markings, 103110598 edges, 531467 markings/sec, 105 secs
lola: 58880904 markings, 107946368 edges, 527683 markings/sec, 110 secs
lola: 61503338 markings, 112742187 edges, 524487 markings/sec, 115 secs
lola: 64169713 markings, 117647862 edges, 533275 markings/sec, 120 secs
lola: 66929050 markings, 122705928 edges, 551867 markings/sec, 125 secs
lola: 69654166 markings, 127692425 edges, 545023 markings/sec, 130 secs
lola: 72340932 markings, 132635094 edges, 537353 markings/sec, 135 secs
lola: 75068637 markings, 137614078 edges, 545541 markings/sec, 140 secs
lola: 77745795 markings, 142543850 edges, 535432 markings/sec, 145 secs
lola: 80442228 markings, 147478419 edges, 539287 markings/sec, 150 secs
lola: 83107386 markings, 152350149 edges, 533032 markings/sec, 155 secs
lola: 85768550 markings, 157242794 edges, 532233 markings/sec, 160 secs
lola: 88441583 markings, 162139370 edges, 534607 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (F (((2 <= P3s) AND G ((P3M2 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((2 <= P3s) AND G ((P3M2 <= 2))))))
lola: processed formula length: 44
lola: 137 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: 2825915 markings, 5174602 edges, 565183 markings/sec, 0 secs
lola: 5954204 markings, 10915130 edges, 625658 markings/sec, 5 secs
lola: 9088361 markings, 16670330 edges, 626831 markings/sec, 10 secs
lola: 12232405 markings, 22432097 edges, 628809 markings/sec, 15 secs
lola: 15368064 markings, 28175354 edges, 627132 markings/sec, 20 secs
lola: 18541892 markings, 33983564 edges, 634766 markings/sec, 25 secs
lola: 21629235 markings, 39657383 edges, 617469 markings/sec, 30 secs
lola: 24842692 markings, 45544135 edges, 642691 markings/sec, 35 secs
lola: 28003840 markings, 51343140 edges, 632230 markings/sec, 40 secs
lola: 31050530 markings, 56934378 edges, 609338 markings/sec, 45 secs
lola: 34165019 markings, 62640406 edges, 622898 markings/sec, 50 secs
lola: 37222093 markings, 68242320 edges, 611415 markings/sec, 55 secs
lola: 40296602 markings, 73888982 edges, 614902 markings/sec, 60 secs
lola: 43409489 markings, 79591004 edges, 622577 markings/sec, 65 secs
lola: 46564777 markings, 85367221 edges, 631058 markings/sec, 70 secs
lola: 49665694 markings, 91064450 edges, 620183 markings/sec, 75 secs
lola: 52743708 markings, 96685967 edges, 615603 markings/sec, 80 secs
lola: 55878353 markings, 102442384 edges, 626929 markings/sec, 85 secs
lola: 58952148 markings, 108081345 edges, 614759 markings/sec, 90 secs
lola: 61999809 markings, 113665641 edges, 609532 markings/sec, 95 secs
lola: 65225239 markings, 119569013 edges, 645086 markings/sec, 100 secs
lola: 68468371 markings, 125516640 edges, 648626 markings/sec, 105 secs
lola: 71621904 markings, 131320112 edges, 630707 markings/sec, 110 secs
lola: 74810402 markings, 137148531 edges, 637700 markings/sec, 115 secs
lola: 77890346 markings, 142796792 edges, 615989 markings/sec, 120 secs
lola: 81022722 markings, 148541389 edges, 626475 markings/sec, 125 secs
lola: 84123768 markings, 154223323 edges, 620209 markings/sec, 130 secs
lola: 87265567 markings, 159986767 edges, 628360 markings/sec, 135 secs
lola: 89809141 markings, 164646895 edges, 508715 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (F (((P1s <= M3) OR G ((M2 + 1 <= P3)))))) AND A (G ((((P3 <= M2) U (P3s <= P12)) OR X (F (((P1s <= M3) OR G ((M2 + 1 <= P3)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (F (((P1s <= M3) OR G ((M2 + 1 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((P1s <= M3) OR G ((M2 + 1 <= P3))))))
lola: processed formula length: 47
lola: 137 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2885863 markings, 4771448 edges, 577173 markings/sec, 0 secs
lola: 6077384 markings, 10094174 edges, 638304 markings/sec, 5 secs
lola: 9240257 markings, 15359601 edges, 632575 markings/sec, 10 secs
lola: 12373184 markings, 20585144 edges, 626585 markings/sec, 15 secs
lola: 15442376 markings, 25702118 edges, 613838 markings/sec, 20 secs
lola: 18497981 markings, 30794126 edges, 611121 markings/sec, 25 secs
lola: 21618681 markings, 35995214 edges, 624140 markings/sec, 30 secs
lola: 24666729 markings, 41071003 edges, 609610 markings/sec, 35 secs
lola: 27721075 markings, 46159388 edges, 610869 markings/sec, 40 secs
lola: 30725993 markings, 51168926 edges, 600984 markings/sec, 45 secs
lola: 33737846 markings, 56192332 edges, 602371 markings/sec, 50 secs
lola: 36790970 markings, 61278272 edges, 610625 markings/sec, 55 secs
lola: 39849201 markings, 66374428 edges, 611646 markings/sec, 60 secs
lola: 42858503 markings, 71392732 edges, 601860 markings/sec, 65 secs
lola: 45795081 markings, 76285596 edges, 587316 markings/sec, 70 secs
lola: 48663751 markings, 81062648 edges, 573734 markings/sec, 75 secs
lola: 51640294 markings, 86019434 edges, 595309 markings/sec, 80 secs
lola: 54537157 markings, 90848871 edges, 579373 markings/sec, 85 secs
lola: 57400347 markings, 95619391 edges, 572638 markings/sec, 90 secs
lola: 60231359 markings, 100336706 edges, 566202 markings/sec, 95 secs
lola: 63005496 markings, 104964703 edges, 554827 markings/sec, 100 secs
lola: 65947596 markings, 109868610 edges, 588420 markings/sec, 105 secs
lola: 68879064 markings, 114751252 edges, 586294 markings/sec, 110 secs
lola: 71747571 markings, 119527977 edges, 573701 markings/sec, 115 secs
lola: 74631116 markings, 124334778 edges, 576709 markings/sec, 120 secs
lola: 77432774 markings, 129011483 edges, 560332 markings/sec, 125 secs
lola: 80237353 markings, 133686695 edges, 560916 markings/sec, 130 secs
lola: 83075264 markings, 138413879 edges, 567582 markings/sec, 135 secs
lola: 85835257 markings, 143013827 edges, 551999 markings/sec, 140 secs
lola: 88618539 markings, 147648228 edges, 556656 markings/sec, 145 secs
lola: 91009862 markings, 151630634 edges, 478265 markings/sec, 150 secs
lola: 91367251 markings, 152225729 edges, 71478 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G ((((P3 <= M2) U (P3s <= P12)) OR X (F (((P1s <= M3) OR G ((M2 + 1 <= P3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((((P3 <= M2) U (P3s <= P12)) OR X (F (((P1s <= M3) OR G ((M2 + 1 <= P3))))))))
lola: processed formula length: 84
lola: 137 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: 2575683 markings, 4731128 edges, 515137 markings/sec, 0 secs
lola: 5582643 markings, 10206132 edges, 601392 markings/sec, 5 secs
lola: 8525761 markings, 15643681 edges, 588624 markings/sec, 10 secs
lola: 11414741 markings, 20945892 edges, 577796 markings/sec, 15 secs
lola: 14300710 markings, 26240577 edges, 577194 markings/sec, 20 secs
lola: 17129119 markings, 31391360 edges, 565682 markings/sec, 25 secs
lola: 19969957 markings, 36587964 edges, 568168 markings/sec, 30 secs
lola: 22862325 markings, 41883891 edges, 578474 markings/sec, 35 secs
lola: 25654612 markings, 47046939 edges, 558457 markings/sec, 40 secs
lola: 28467206 markings, 52191872 edges, 562519 markings/sec, 45 secs
lola: 31240687 markings, 57309107 edges, 554696 markings/sec, 50 secs
lola: 34056581 markings, 62428606 edges, 563179 markings/sec, 55 secs
lola: 36921501 markings, 67670663 edges, 572984 markings/sec, 60 secs
lola: 39760438 markings, 72876464 edges, 567787 markings/sec, 65 secs
lola: 42554929 markings, 78026068 edges, 558898 markings/sec, 70 secs
lola: 45389940 markings, 83215835 edges, 567002 markings/sec, 75 secs
lola: 48163719 markings, 88335279 edges, 554756 markings/sec, 80 secs
lola: 50976360 markings, 93446639 edges, 562528 markings/sec, 85 secs
lola: 53845869 markings, 98700173 edges, 573902 markings/sec, 90 secs
lola: 56660289 markings, 103874624 edges, 562884 markings/sec, 95 secs
lola: 59416760 markings, 108928225 edges, 551294 markings/sec, 100 secs
lola: 62159040 markings, 113962412 edges, 548456 markings/sec, 105 secs
lola: 64893948 markings, 118982120 edges, 546982 markings/sec, 110 secs
lola: 67728378 markings, 124170726 edges, 566886 markings/sec, 115 secs
lola: 70595289 markings, 129424293 edges, 573382 markings/sec, 120 secs
lola: 73432105 markings, 134624760 edges, 567363 markings/sec, 125 secs
lola: 76218203 markings, 139749152 edges, 557220 markings/sec, 130 secs
lola: 78961979 markings, 144774082 edges, 548755 markings/sec, 135 secs
lola: 81744721 markings, 149862164 edges, 556548 markings/sec, 140 secs
lola: 84532902 markings, 155015205 edges, 557636 markings/sec, 145 secs
lola: 87306124 markings, 160028021 edges, 554644 markings/sec, 150 secs
lola: 90026558 markings, 165045103 edges, 544087 markings/sec, 155 secs
lola: 92753371 markings, 170045692 edges, 545363 markings/sec, 160 secs
lola: 95506271 markings, 175104048 edges, 550580 markings/sec, 165 secs
lola: 98236953 markings, 180127124 edges, 546136 markings/sec, 170 secs
lola: 101037635 markings, 185235661 edges, 560136 markings/sec, 175 secs
lola: 103751445 markings, 190213658 edges, 542762 markings/sec, 180 secs
lola: 106461984 markings, 195196083 edges, 542108 markings/sec, 185 secs
lola: 109162316 markings, 200134922 edges, 540066 markings/sec, 190 secs
lola: 111840832 markings, 205042750 edges, 535703 markings/sec, 195 secs
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: RESULT
lola:
SUMMARY: no unknown unknown unknown no no no yes no no no no no no yes no
lola:
preliminary result: no unknown unknown unknown no no no yes no no no no no no yes no
lola: ========================================
lola: memory consumption: 21580 KB
lola: time consumption: 1387 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589543691161

--------------------
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="FMS-PT-20000"
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 FMS-PT-20000, 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-158922999300025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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