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.r015-smll-158897552800091.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 Angiogenesis-PT-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r015-smll-158897552800091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.5K Apr 28 14:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 28 14:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 28 14:22 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 28 14:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 28 14:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 28 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 28 14:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 28 14:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 28 14:22 instance
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 iscolored
-rw-r--r-- 1 mcc users 33K Apr 28 14:22 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 Angiogenesis-PT-50-00
FORMULA_NAME Angiogenesis-PT-50-01
FORMULA_NAME Angiogenesis-PT-50-02
FORMULA_NAME Angiogenesis-PT-50-03
FORMULA_NAME Angiogenesis-PT-50-04
FORMULA_NAME Angiogenesis-PT-50-05
FORMULA_NAME Angiogenesis-PT-50-06
FORMULA_NAME Angiogenesis-PT-50-07
FORMULA_NAME Angiogenesis-PT-50-08
FORMULA_NAME Angiogenesis-PT-50-09
FORMULA_NAME Angiogenesis-PT-50-10
FORMULA_NAME Angiogenesis-PT-50-11
FORMULA_NAME Angiogenesis-PT-50-12
FORMULA_NAME Angiogenesis-PT-50-13
FORMULA_NAME Angiogenesis-PT-50-14
FORMULA_NAME Angiogenesis-PT-50-15

=== Now, execution of the tool begins

BK_START 1589283502611

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Angiogenesis-PT-50 @ 3570 seconds

FORMULA Angiogenesis-PT-50-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-50-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2975
rslt: Output for LTLCardinality @ Angiogenesis-PT-50

{
"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": "Tue May 12 11:38:22 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((X (((KdStarGStarPg <= 0) R (AktP3 + 1 <= KdStarGStar))) OR (G (F (((GP3 <= 1) OR (GStarP3kP3 <= PtP2)))) AND X (F (((KdStarGStarPg <= 0) R (AktP3 + 1 <= KdStarGStar)))))))",
"processed_size": 176,
"rewrites": 77
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 2,
"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": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(KdStarGStarP3kStar + 1 <= KdStarGStarP3kStarP3P2)",
"processed_size": 50,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((((3 <= KdStarGStarPg) OR G ((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3))) AND (F ((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3)) U X (F ((KdStarGStarP3kStar <= 1))))) U X ((2 <= KdStarGStarP3kStar))))",
"processed_size": 201,
"rewrites": 77
},
"result":
{
"edges": 126384735,
"markings": 61552571,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 309
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((3 <= PtP3) AND F ((AktP3 <= KdStarPgStarP2))) OR (X ((3 <= PtP3)) AND (G ((3 <= PtP3)) AND ((AktP3 <= KdStarPgStarP2) OR F ((KdStarGStarP3 <= KdStarGStarP3k)))))))",
"processed_size": 169,
"rewrites": 77
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 340
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (F ((F (G (((GStarPgP3 <= DAGE) OR F ((GStarP3kP3 <= 0))))) OR (X ((3 <= GStarP3)) U (GStarPgP3 <= Pip2)))))",
"processed_size": 110,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 378
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 378
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((P3k <= KdStarGStarPgStarP3P2)))",
"processed_size": 38,
"rewrites": 77
},
"result":
{
"edges": 4,
"markings": 4,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 455
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 4,
"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 (X (X (X (X ((F ((PtP2 <= KdStarGStarPgStarP2)) OR (G (F ((KdStarPgStar <= 0))) AND F ((PtP2 <= KdStarGStarPgStarP2)))))))))",
"processed_size": 126,
"rewrites": 77
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 637
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (G (((GStarP3kP3 <= DAG) AND G ((3 <= KdStarGStarP3kP3))))))",
"processed_size": 65,
"rewrites": 77
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 796
},
"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 ((KdStarGStar + 1 <= PtP2)))",
"processed_size": 33,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1061
},
"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": "(KdStarPgStarP2 <= AktP3)",
"processed_size": 25,
"rewrites": 79
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1592
},
"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": "(Pg <= KdStarGStarPg)",
"processed_size": 21,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (((3 <= DAG) U (F ((KdStarGP3 + 1 <= Pten)) AND ((2 <= KdStarG) R F ((KdStarPg <= PtP2))))))",
"processed_size": 94,
"rewrites": 77
},
"result":
{
"edges": 316,
"markings": 211,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 22488,
"runtime": 595.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(X(G(*))) AND (A(F(G(*))) AND A(X(X(**))))) : A((X(TRUE) OR F(G((* AND X((* AND (* R *)))))))) : A((X((* R *)) OR (G(F(**)) AND X(F((* R *)))))) : (* AND A(X(G((F(**) AND (** OR **)))))) : A((((** OR G(**)) AND (F(**) U X(F(*)))) U X(**))) : A(((** AND F(**)) OR (X(**) AND (G(**) AND (** OR F(**)))))) : A(F((F(G((** OR F(**)))) OR (X(**) U **)))) : (A(X(**)) AND A(X(G((** AND X(X(G(**)))))))) : A(F(*)) : A((** OR X((G(**) OR (G(**) AND F(G(**))))))) : A(X(X(X(X((F(**) OR (G(F(**)) AND F(**)))))))) : (A(X(F(**))) AND A(X(G((** AND G(**)))))) : A((** U (F(*) AND (* R F(*))))) : TRUE : A(F(*)) : A(G(*))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no yes no no no no yes no yes unknown no no no yes no no ",
"value": "no yes no no no no yes no yes unknown no no no yes no 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: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 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 true: (GStarPgP3 <= Pten)
lola: A (NOT(((F (X (((KdStarGStarP3kStarP3 <= KdStarGStarPgP3) AND (Akt <= DAG)))) OR G (F ((2 <= KdStarGStarP3kStar)))) OR NOT(X (X ((KdStarGStarP3kStarP3 <= KdStarGStarPgP3))))))) : A ((X ((GStarPgP3 <= Pten)) OR F (NOT(F (((GStarP3 <= Pip2) OR X (((KdStarGStar <= Pip2) OR ((AktStar <= KdStarGP3) U (3 <= AktStar)))))))))) : A ((G (F (((GP3 <= 1) OR (GStarP3kP3 <= PtP2)))) U NOT(X (((1 <= KdStarGStarPg) U (KdStarGStar <= AktP3)))))) : A ((NOT(((KdStarGStarP3kStarP3P2 <= KdStarGStarP3kStar) AND X ((0 <= KdStarGStarPgP3)))) AND X (G (((KdStarGStarP3kStar + 1 <= KdStarGStarP3kStarP3P2) U (KdStarGStarP3kStarP3P2 <= KdStarGStarP3kStar)))))) : A (((((3 <= KdStarGStarPg) OR G ((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3))) AND (F ((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3)) U NOT(X (G ((2 <= KdStarGStarP3kStar)))))) U X ((2 <= KdStarGStarP3kStar)))) : A ((((3 <= PtP3) AND F ((AktP3 <= KdStarPgStarP2))) OR ((X ((3 <= PtP3)) AND G ((3 <= PtP3))) AND ((AktP3 <= KdStarPgStarP2) OR F ((KdStarGStarP3 <= KdStarGStarP3k)))))) : A (F ((F (G (((GStarPgP3 <= DAGE) OR ((1 <= GStarP3kP3) U (GStarP3kP3 <= 0))))) OR (X ((3 <= GStarP3)) U (GStarPgP3 <= Pip2))))) : A (X (((P3k <= KdStarGStarPgStarP3P2) AND G (((P3k <= KdStarGStarPgStarP3P2) AND X (X (G ((PtP3 <= KdStarPgStarP2))))))))) : A (NOT(G ((Pg <= KdStarGStarPg)))) : A (((KdStarPgStarP2 + 1 <= Pip3) OR (X (G ((Pten <= KdStarGStarPgStarP2))) U G (X (((Pten <= KdStarGStarPgStarP2) OR (2 <= KdStarGStar) OR (1 <= Pten))))))) : A (X (X (X (X ((G (F ((KdStarPgStar <= 0))) U F ((PtP2 <= KdStarGStarPgStarP2)))))))) : A (X (((F ((GStarPgP3 + 1 <= KdStar)) U F ((KdStarGStarP3kStarP3 <= PtP2))) AND G (((GStarP3kP3 <= DAG) AND G ((3 <= KdStarGStarP3kP3))))))) : A (((3 <= DAG) U (NOT(G ((Pten <= KdStarGP3))) AND NOT(((KdStarG <= 1) U G ((PtP2 + 1 <= KdStarPg))))))) : A ((() AND F (G ((0 <= KdStarG))))) : A (NOT(G ((KdStarPgStarP2 <= AktP3)))) : A (G (NOT(F ((PtP2 <= KdStarGStar)))))
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:121
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (TRUE) OR F (G (((Pip2 + 1 <= GStarP3) AND X (((Pip2 + 1 <= KdStarGStar) AND ((KdStarGP3 + 1 <= AktStar) R (AktStar <= 2)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (TRUE) OR F (G (((Pip2 + 1 <= GStarP3) AND X (((Pip2 + 1 <= KdStarGStar) AND ((KdStarGP3 + 1 <= AktStar) R (AktStar <= 2)))))))))
lola: processed formula length: 135
lola: 77 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (((KdStarGStarPg <= 0) R (AktP3 + 1 <= KdStarGStar))) OR (G (F (((GP3 <= 1) OR (GStarP3kP3 <= PtP2)))) AND X (F (((KdStarGStarPg <= 0) R (AktP3 + 1 <= KdStarGStar)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (((KdStarGStarPg <= 0) R (AktP3 + 1 <= KdStarGStar))) OR (G (F (((GP3 <= 1) OR (GStarP3kP3 <= PtP2)))) AND X (F (((KdStarGStarPg <= 0) R (AktP3 + 1 <= KdStarGStar)))))))
lola: processed formula length: 176
lola: 77 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: 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((KdStarGStarP3kStar + 1 <= KdStarGStarP3kStarP3P2) AND A (X (G ((F ((KdStarGStarP3kStarP3P2 <= KdStarGStarP3kStar)) AND ((KdStarGStarP3kStar + 1 <= KdStarGStarP3kStarP3P2) OR (KdStarGStarP3kStarP3P2 <= KdStarGStarP3kStar)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (KdStarGStarP3kStar + 1 <= KdStarGStarP3kStarP3P2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (KdStarGStarP3kStar + 1 <= KdStarGStarP3kStarP3P2)
lola: processed formula length: 50
lola: 77 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((3 <= KdStarGStarPg) OR G ((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3))) AND (F ((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3)) U X (F ((KdStarGStarP3kStar <= 1))))) U X ((2 <= KdStarGStarP3kStar))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((((3 <= KdStarGStarPg) OR G ((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3))) AND (F ((KdStarGStarP3kP3 <= KdStarGStarP3kStarP3)) U X (F ((KdStarGStarP3kStar <= 1))))) U X ((2 <= KdStarGStarP3kStar))))
lola: processed formula length: 201
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2199814 markings, 4419546 edges, 439963 markings/sec, 0 secs
lola: 4435292 markings, 8906204 edges, 447096 markings/sec, 5 secs
lola: 6661696 markings, 13305919 edges, 445281 markings/sec, 10 secs
lola: 8685256 markings, 17419078 edges, 404712 markings/sec, 15 secs
lola: 10756212 markings, 21495466 edges, 414191 markings/sec, 20 secs
lola: 12844450 markings, 25689797 edges, 417648 markings/sec, 25 secs
lola: 14939556 markings, 29901039 edges, 419021 markings/sec, 30 secs
lola: 17031287 markings, 34073144 edges, 418346 markings/sec, 35 secs
lola: 19097014 markings, 38234161 edges, 413145 markings/sec, 40 secs
lola: 21178839 markings, 42425517 edges, 416365 markings/sec, 45 secs
lola: 23245500 markings, 46623792 edges, 413332 markings/sec, 50 secs
lola: 25355523 markings, 50890443 edges, 422005 markings/sec, 55 secs
lola: 27470574 markings, 55213648 edges, 423010 markings/sec, 60 secs
lola: 29454687 markings, 59282672 edges, 396823 markings/sec, 65 secs
lola: 31401227 markings, 63281704 edges, 389308 markings/sec, 70 secs
lola: 33341248 markings, 67306093 edges, 388004 markings/sec, 75 secs
lola: 35225864 markings, 71220652 edges, 376923 markings/sec, 80 secs
lola: 37080014 markings, 75070853 edges, 370830 markings/sec, 85 secs
lola: 38887558 markings, 78829798 edges, 361509 markings/sec, 90 secs
lola: 40631450 markings, 82482165 edges, 348778 markings/sec, 95 secs
lola: 42398031 markings, 86179623 edges, 353316 markings/sec, 100 secs
lola: 44248630 markings, 90018571 edges, 370120 markings/sec, 105 secs
lola: 46170700 markings, 93991035 edges, 384414 markings/sec, 110 secs
lola: 48307266 markings, 98416731 edges, 427313 markings/sec, 115 secs
lola: 50314671 markings, 102636228 edges, 401481 markings/sec, 120 secs
lola: 52248998 markings, 106720138 edges, 386865 markings/sec, 125 secs
lola: 54075406 markings, 110578233 edges, 365282 markings/sec, 130 secs
lola: 55953537 markings, 114535541 edges, 375626 markings/sec, 135 secs
lola: 57824455 markings, 118486959 edges, 374184 markings/sec, 140 secs
lola: 59713012 markings, 122502403 edges, 377711 markings/sec, 145 secs
lola: 61552571 markings, 126384735 edges, 367912 markings/sec, 150 secs
lola: 61552571 markings, 126384735 edges, 0 markings/sec, 155 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: 61552571 markings, 126384735 edges
lola: ========================================
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= PtP3) AND F ((AktP3 <= KdStarPgStarP2))) OR (X ((3 <= PtP3)) AND (G ((3 <= PtP3)) AND ((AktP3 <= KdStarPgStarP2) OR F ((KdStarGStarP3 <= KdStarGStarP3k)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= PtP3) AND F ((AktP3 <= KdStarPgStarP2))) OR (X ((3 <= PtP3)) AND (G ((3 <= PtP3)) AND ((AktP3 <= KdStarPgStarP2) OR F ((KdStarGStarP3 <= KdStarGStarP3k)))))))
lola: processed formula length: 169
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F (G (((GStarPgP3 <= DAGE) OR F ((GStarP3kP3 <= 0))))) OR (X ((3 <= GStarP3)) U (GStarPgP3 <= Pip2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F (G (((GStarPgP3 <= DAGE) OR F ((GStarP3kP3 <= 0))))) OR (X ((3 <= GStarP3)) U (GStarPgP3 <= Pip2)))))
lola: processed formula length: 110
lola: 77 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((P3k <= KdStarGStarPgStarP3P2))) AND A (X (G (((P3k <= KdStarGStarPgStarP3P2) AND X (X (G ((PtP3 <= KdStarPgStarP2)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((P3k <= KdStarGStarPgStarP3P2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((P3k <= KdStarGStarPgStarP3P2)))
lola: processed formula length: 38
lola: 77 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((KdStarPgStarP2 + 1 <= Pip3) OR X ((G (((Pten <= KdStarGStarPgStarP2) OR (2 <= KdStarGStar) OR (1 <= Pten))) OR (G ((Pten <= KdStarGStarPgStarP2)) AND F (G (((Pten <= KdStarGStarPgStarP2) OR (2 <= KdStarGStar) OR (1 <= Pten)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((KdStarPgStarP2 + 1 <= Pip3) OR X ((G (((Pten <= KdStarGStarPgStarP2) OR (2 <= KdStarGStar) OR (1 <= Pten))) OR (G ((Pten <= KdStarGStarPgStarP2)) AND F (G (((Pten <= KdStarGStarPgStarP2) OR (2 <= KdStarGStar) OR (1 <= Pten)))))))))
lola: processed formula length: 240
lola: 77 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: 2090974 markings, 4208606 edges, 418195 markings/sec, 0 secs
lola: 4220021 markings, 8499967 edges, 425809 markings/sec, 5 secs
lola: 6415335 markings, 12834019 edges, 439063 markings/sec, 10 secs
lola: 8448086 markings, 16922878 edges, 406550 markings/sec, 15 secs
lola: 10514598 markings, 21025535 edges, 413302 markings/sec, 20 secs
lola: 12532652 markings, 25041713 edges, 403611 markings/sec, 25 secs
lola: 14549958 markings, 29104956 edges, 403461 markings/sec, 30 secs
lola: 16605978 markings, 33195113 edges, 411204 markings/sec, 35 secs
lola: 18596262 markings, 37228406 edges, 398057 markings/sec, 40 secs
lola: 20693155 markings, 41423992 edges, 419379 markings/sec, 45 secs
lola: 22685775 markings, 45463583 edges, 398524 markings/sec, 50 secs
lola: 24786585 markings, 49710359 edges, 420162 markings/sec, 55 secs
lola: 26777185 markings, 53818506 edges, 398120 markings/sec, 60 secs
lola: 28735811 markings, 57837168 edges, 391725 markings/sec, 65 secs
lola: 30649162 markings, 61718278 edges, 382670 markings/sec, 70 secs
lola: 32594624 markings, 65757784 edges, 389092 markings/sec, 75 secs
lola: 34489597 markings, 69691808 edges, 378995 markings/sec, 80 secs
lola: 36349714 markings, 73554014 edges, 372023 markings/sec, 85 secs
lola: 38197976 markings, 77392736 edges, 369652 markings/sec, 90 secs
lola: 39949147 markings, 81052343 edges, 350234 markings/sec, 95 secs
lola: 41694330 markings, 84707084 edges, 349037 markings/sec, 100 secs
lola: 43504972 markings, 88501007 edges, 362128 markings/sec, 105 secs
lola: 45408014 markings, 92408276 edges, 380608 markings/sec, 110 secs
lola: 47518234 markings, 96757912 edges, 422044 markings/sec, 115 secs
lola: 49551909 markings, 101043815 edges, 406735 markings/sec, 120 secs
lola: 51519348 markings, 105199781 edges, 393488 markings/sec, 125 secs
lola: 53421175 markings, 109176769 edges, 380365 markings/sec, 130 secs
lola: 55309187 markings, 113171888 edges, 377602 markings/sec, 135 secs
lola: 57206234 markings, 117177026 edges, 379409 markings/sec, 140 secs
lola: 59060899 markings, 121130543 edges, 370933 markings/sec, 145 secs
lola: 60878816 markings, 124984978 edges, 363583 markings/sec, 150 secs
lola: 62684938 markings, 128907989 edges, 361224 markings/sec, 155 secs
lola: 64441109 markings, 133051819 edges, 351234 markings/sec, 160 secs
lola: 66098193 markings, 136934915 edges, 331417 markings/sec, 165 secs
lola: 67827938 markings, 140944914 edges, 345949 markings/sec, 170 secs
lola: 69597177 markings, 144625057 edges, 353848 markings/sec, 175 secs
lola: 71348915 markings, 148448594 edges, 350348 markings/sec, 180 secs
lola: 73097439 markings, 152163317 edges, 349705 markings/sec, 185 secs
lola: 74846178 markings, 155856969 edges, 349748 markings/sec, 190 secs
lola: 75603836 markings, 157640091 edges, 151532 markings/sec, 195 secs
lola: 75623078 markings, 157680577 edges, 3848 markings/sec, 200 secs
lola: 75628692 markings, 157693562 edges, 1123 markings/sec, 205 secs
lola: 75628766 markings, 157693731 edges, 15 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((F ((PtP2 <= KdStarGStarPgStarP2)) OR (G (F ((KdStarPgStar <= 0))) AND F ((PtP2 <= KdStarGStarPgStarP2)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((F ((PtP2 <= KdStarGStarPgStarP2)) OR (G (F ((KdStarPgStar <= 0))) AND F ((PtP2 <= KdStarGStarPgStarP2)))))))))
lola: processed formula length: 126
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F ((KdStarGStarP3kStarP3 <= PtP2)))) AND A (X (G (((GStarP3kP3 <= DAG) AND G ((3 <= KdStarGStarP3kP3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((KdStarGStarP3kStarP3 <= PtP2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((KdStarGStarP3kStarP3 <= PtP2))))
lola: processed formula length: 42
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((GStarP3kP3 <= DAG) AND G ((3 <= KdStarGStarP3kP3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((GStarP3kP3 <= DAG) AND G ((3 <= KdStarGStarP3kP3))))))
lola: processed formula length: 65
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G (((KdStarGStarPgP3 + 1 <= KdStarGStarP3kStarP3) OR (DAG + 1 <= Akt))))) AND (A (F (G ((KdStarGStarP3kStar <= 1)))) AND A (X (X ((KdStarGStarP3kStarP3 <= KdStarGStarPgP3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((KdStarGStarP3kStar <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((KdStarGStarP3kStar <= 1))))
lola: processed formula length: 37
lola: 77 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: add low 56
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: 153538 markings, 234427 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((KdStarGStar + 1 <= PtP2)))
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 ((KdStarGStar + 1 <= PtP2)))
lola: processed formula length: 33
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (PtP2 <= KdStarGStar)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((AktP3 + 1 <= KdStarPgStarP2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (KdStarPgStarP2 <= AktP3)
lola: processed formula length: 25
lola: 79 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 14 will run for 1592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((KdStarGStarPg + 1 <= Pg)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (Pg <= KdStarGStarPg)
lola: processed formula length: 21
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= DAG) U (F ((KdStarGP3 + 1 <= Pten)) AND ((2 <= KdStarG) R F ((KdStarPg <= PtP2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= DAG) U (F ((KdStarGP3 + 1 <= Pten)) AND ((2 <= KdStarG) R F ((KdStarPg <= PtP2))))))
lola: processed formula length: 94
lola: 77 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: 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: 211 markings, 316 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((KdStarPgStarP2 + 1 <= Pip3) OR X ((G (((Pten <= KdStarGStarPgStarP2) OR (2 <= KdStarGStar) OR (1 <= Pten))) OR (G ((Pten <= KdStarGStarPgStarP2)) AND F (G (((Pten <= KdStarGStarPgStarP2) OR (2 <= KdStarGStar) OR (1 <= Pten)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((KdStarPgStarP2 + 1 <= Pip3) OR X ((G (((Pten <= KdStarGStarPgStarP2) OR (2 <= KdStarGStar) OR (1 <= Pten))) OR (G ((Pten <= KdStarGStarPgStarP2)) AND F (G (((Pten <= KdStarGStarPgStarP2) OR (2 <= KdStarGStar) OR (1 <= Pten)))))))))
lola: processed formula length: 240
lola: 77 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: 2117794 markings, 4265723 edges, 423559 markings/sec, 0 secs
lola: 4301153 markings, 8653720 edges, 436672 markings/sec, 5 secs
lola: 6493167 markings, 12980804 edges, 438403 markings/sec, 10 secs
lola: 8506069 markings, 17044578 edges, 402580 markings/sec, 15 secs
lola: 10623114 markings, 21242100 edges, 423409 markings/sec, 20 secs
lola: 12673606 markings, 25333811 edges, 410098 markings/sec, 25 secs
lola: 14705396 markings, 29408334 edges, 406358 markings/sec, 30 secs
lola: 16781341 markings, 33556951 edges, 415189 markings/sec, 35 secs
lola: 18811180 markings, 37641881 edges, 405968 markings/sec, 40 secs
lola: 20893390 markings, 41836052 edges, 416442 markings/sec, 45 secs
lola: 22914303 markings, 45940397 edges, 404183 markings/sec, 50 secs
lola: 25022814 markings, 50199462 edges, 421702 markings/sec, 55 secs
lola: 27076692 markings, 54444661 edges, 410776 markings/sec, 60 secs
lola: 29066412 markings, 58477494 edges, 397944 markings/sec, 65 secs
lola: 31009949 markings, 62466323 edges, 388707 markings/sec, 70 secs
lola: 32954851 markings, 66505184 edges, 388980 markings/sec, 75 secs
lola: 34843764 markings, 70427185 edges, 377783 markings/sec, 80 secs
lola: 36698998 markings, 74280483 edges, 371047 markings/sec, 85 secs
lola: 38546049 markings, 78115070 edges, 369410 markings/sec, 90 secs
lola: 40279634 markings, 81747157 edges, 346717 markings/sec, 95 secs
lola: 42054477 markings, 85462317 edges, 354969 markings/sec, 100 secs
lola: 43873398 markings, 89253836 edges, 363784 markings/sec, 105 secs
lola: 45760871 markings, 93131916 edges, 377495 markings/sec, 110 secs
lola: 47900681 markings, 97555813 edges, 427962 markings/sec, 115 secs
lola: 49917303 markings, 101801289 edges, 403324 markings/sec, 120 secs
lola: 51822528 markings, 105833902 edges, 381045 markings/sec, 125 secs
lola: 53715069 markings, 109805521 edges, 378508 markings/sec, 130 secs
lola: 55575708 markings, 113739494 edges, 372128 markings/sec, 135 secs
lola: 57475957 markings, 117740568 edges, 380050 markings/sec, 140 secs
lola: 59337489 markings, 121715122 edges, 372306 markings/sec, 145 secs
lola: 61199531 markings, 125641879 edges, 372408 markings/sec, 150 secs
lola: 63001724 markings, 129661628 edges, 360439 markings/sec, 155 secs
lola: 64805770 markings, 133905786 edges, 360809 markings/sec, 160 secs
lola: 66572443 markings, 138068348 edges, 353335 markings/sec, 165 secs
lola: 68342973 markings, 141981647 edges, 354106 markings/sec, 170 secs
lola: 70112627 markings, 145813364 edges, 353931 markings/sec, 175 secs
lola: 71865328 markings, 149542534 edges, 350540 markings/sec, 180 secs
lola: 73641935 markings, 153311421 edges, 355321 markings/sec, 185 secs
lola: 75367079 markings, 157111451 edges, 345029 markings/sec, 190 secs
lola: 75619882 markings, 157673965 edges, 50561 markings/sec, 195 secs
lola: 75622751 markings, 157679818 edges, 574 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no no no no yes no yes unknown no no no yes no no
lola:
preliminary result: no yes no no no no yes no yes unknown no no no yes no no
lola: memory consumption: 22488 KB
lola: time consumption: 595 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589284097414

--------------------
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="Angiogenesis-PT-50"
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 Angiogenesis-PT-50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r015-smll-158897552800091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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