fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r016-csrt-155225064900059
Last Updated
Apr 15, 2019

About the Execution of LoLA for Angiogenesis-PT-50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.930 1613480.00 1108856.00 740.60 TF?FTFTTTTFTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r016-csrt-155225064900059.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is Angiogenesis-PT-50, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-csrt-155225064900059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.6K Feb 9 06:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 9 06:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 03:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 5 03:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 2 00:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 2 00:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jan 29 11:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 29 11:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:18 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 33K Mar 10 17:31 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-CTLFireability-00
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-01
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-02
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-03
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-04
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-05
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-06
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-07
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-08
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-09
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-10
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-11
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-12
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-13
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-14
FORMULA_NAME Angiogenesis-PT-50-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1552500425881

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA Angiogenesis-PT-50-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1956
rslt: Output for CTLFireability @ 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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Mar 13 18:07:05 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(k48) OR FIREABLE(k44))))",
"processed_size": 41,
"rewrites": 49
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "FIREABLE(k52)",
"processed_size": 13,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E ((NOT FIREABLE(k5) U (FIREABLE(k50) AND FIREABLE(k55))))",
"processed_size": 58,
"rewrites": 51
},
"result":
{
"edges": 112635508,
"markings": 55026818,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 245
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "AG(EX(((FIREABLE(k55) AND FIREABLE(k39)) OR NOT FIREABLE(k25))))",
"processed_size": 65,
"rewrites": 50
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 128103892,
"markings": 62354996,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "AX(FIREABLE(k63))",
"processed_size": 17,
"rewrites": 49
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((NOT FIREABLE(k54) AND (FIREABLE(k24) OR FIREABLE(k9)))))",
"processed_size": 64,
"rewrites": 49
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "(EF(AX((FIREABLE(k54) OR FIREABLE(k63)))) AND E(AX(FIREABLE(k38)) U (FIREABLE(k8) OR NOT FIREABLE(k26))))",
"processed_size": 107,
"rewrites": 52
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 1814,
"markings": 1009,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 298
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "EF(((AX(FIREABLE(k42)) OR AG(FIREABLE(k17))) AND NOT FIREABLE(k62)))",
"processed_size": 68,
"rewrites": 51
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 11523965,
"markings": 3083536,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "(FIREABLE(k14) AND FIREABLE(k43) AND NOT FIREABLE(k51))",
"processed_size": 55,
"rewrites": 51
},
"result":
{
"edges": 46,
"markings": 32,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 5
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 379
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "AG(E(NOT FIREABLE(k6) R NOT FIREABLE(k52)))",
"processed_size": 43,
"rewrites": 50
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 187927155,
"markings": 61548843,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A(FIREABLE(k36) U AG(NOT FIREABLE(k23)))",
"processed_size": 40,
"rewrites": 50
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 126384730,
"markings": 61552566,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "EF((((NOT FIREABLE(k28) AND NOT FIREABLE(k36)) OR EG(FIREABLE(k29))) AND EG((FIREABLE(k29) AND FIREABLE(k39)))))",
"processed_size": 112,
"rewrites": 51
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 27919807,
"markings": 9302737,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 546
},
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "FIREABLE(k33)",
"processed_size": 13,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 728
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(k2)))",
"processed_size": 20,
"rewrites": 49
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1092
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((FIREABLE(k21) AND FIREABLE(k39) AND FIREABLE(k37) AND FIREABLE(k52))))",
"processed_size": 77,
"rewrites": 49
},
"result":
{
"edges": 36,
"markings": 28,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1092
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(k26)))",
"processed_size": 25,
"rewrites": 50
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"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": 2184
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (((FIREABLE(k30) AND FIREABLE(k36)) U FIREABLE(k22)))",
"processed_size": 55,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1092
},
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "FIREABLE(k11)",
"processed_size": 13,
"rewrites": 52
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2184
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "NOT FIREABLE(k44)",
"processed_size": 17,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E ((FIREABLE(k18) U FIREABLE(k45)))",
"processed_size": 35,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(k13) AND FIREABLE(k39))))",
"processed_size": 41,
"rewrites": 49
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "FIREABLE(k37)",
"processed_size": 13,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(k23)))",
"processed_size": 21,
"rewrites": 49
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "(FIREABLE(k60))",
"processed_size": 15,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(k26)))",
"processed_size": 25,
"rewrites": 50
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"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"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (((FIREABLE(k30) AND FIREABLE(k36)) U FIREABLE(k22)))",
"processed_size": 55,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A ((FIREABLE(k11) U (FIREABLE(k35) AND FIREABLE(k57) AND NOT FIREABLE(k22))))",
"processed_size": 77,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 13784,
"runtime": 1614.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(E(G(**)))) : A(G(E((* R *)))) : E(F(A(G(**)))) : A((** U A(G(**)))) : (A(F(**)) OR (E(F(**)) OR ((A(G(*)) AND *) OR E((** U **))))) : (A((** U **)) OR (A((** U **)) OR (* OR A(G(*))))) : E(F(((** OR E(G(**))) AND E(G(**))))) : (E(F(**)) AND (E(F(*)) AND A(F(*)))) : (A(X(A(F(*)))) AND E(F(*))) : ((A(X(A(G(**)))) AND A(X(**))) OR (E((** U **)) OR E(X(A(X(**)))))) : A(G(E(X(**)))) : (E(F(**)) OR (A(X(**)) OR A(X(**)))) : (E(F(A(X(**)))) AND E((A(X(**)) U **))) : (E(F(**)) OR **) : E(F(((A(X(**)) OR A(G(**))) AND **))) : (A(G(A(F(*)))) AND A(G(A(F(*)))))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "yes no unknown no yes no yes yes yes yes no yes yes yes yes no ",
"value": "yes no unknown no yes no yes yes yes yes no yes yes yes 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: 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 CTLFireability.xml
lola: E (F (E (G ((FIREABLE(k14) AND FIREABLE(k43) AND NOT FIREABLE(k51)))))) : NOT(E (F (A ((FIREABLE(k6) U FIREABLE(k52)))))) : E (F (A (G ((NOT FIREABLE(k16) AND NOT FIREABLE(k26)))))) : A ((FIREABLE(k36) U A (G (NOT FIREABLE(k23))))) : (((A (F ((FIREABLE(k55) AND FIREABLE(k61)))) OR E (F ((FIREABLE(k13) AND FIREABLE(k39))))) OR NOT((E (F (FIREABLE(k37))) OR FIREABLE(k44)))) OR E ((FIREABLE(k18) U FIREABLE(k45)))) : (A ((FIREABLE(k11) U (FIREABLE(k35) AND FIREABLE(k57) AND NOT FIREABLE(k22)))) OR (A (((FIREABLE(k30) AND FIREABLE(k36)) U FIREABLE(k22))) OR NOT(((NOT FIREABLE(k60)) AND E (F (FIREABLE(k26))))))) : E (F ((((NOT FIREABLE(k28) AND NOT FIREABLE(k36)) OR E (G (FIREABLE(k29)))) AND E (G ((FIREABLE(k29) AND FIREABLE(k39))))))) : (E (F ((FIREABLE(k21) AND FIREABLE(k39) AND FIREABLE(k37) AND FIREABLE(k52)))) AND (NOT(A (G (NOT FIREABLE(k2)))) AND NOT(E (G (FIREABLE(k33)))))) : NOT((E (X (E (G (FIREABLE(k52))))) OR A (G ((NOT FIREABLE(k48) AND NOT FIREABLE(k44)))))) : (A (X ((A (G (FIREABLE(k34))) AND (FIREABLE(k52) AND (FIREABLE(k56) OR FIREABLE(k30)))))) OR (E ((NOT FIREABLE(k5) U (FIREABLE(k50) AND FIREABLE(k55)))) OR E (X (A (X (FIREABLE(k55))))))) : A (G (E (X (((FIREABLE(k55) AND FIREABLE(k39)) OR NOT FIREABLE(k25)))))) : ((E (F ((NOT FIREABLE(k54) AND (FIREABLE(k24) OR FIREABLE(k9))))) OR A (X ((FIREABLE(k25) OR (FIREABLE(k7) AND FIREABLE(k18)))))) OR A (X (FIREABLE(k63)))) : (E (F (A (X ((FIREABLE(k54) OR FIREABLE(k63)))))) AND E ((A (X (FIREABLE(k38))) U (FIREABLE(k8) OR NOT FIREABLE(k26))))) : (E (F (FIREABLE(k23))) OR FIREABLE(k37)) : E (F (((A (X (FIREABLE(k42))) OR A (G (FIREABLE(k17)))) AND NOT FIREABLE(k62)))) : NOT(E (F ((E (G (FIREABLE(k50))) OR E (G (FIREABLE(k11)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F (NOT FIREABLE(k52))))) AND E (F ((FIREABLE(k48) OR FIREABLE(k44)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k48) OR FIREABLE(k44))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(k48) OR FIREABLE(k44))))
lola: processed formula length: 41
lola: 49 rewrites
lola: closed formula file CTLFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k48) OR FIREABLE(k44))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (NOT FIREABLE(k52)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: FIREABLE(k52)
lola: processed formula length: 13
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(k52)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X (A (G (FIREABLE(k34))))) AND A (X ((FIREABLE(k52) AND (FIREABLE(k56) OR FIREABLE(k30)))))) OR (E ((NOT FIREABLE(k5) U (FIREABLE(k50) AND FIREABLE(k55)))) OR E (X (A (X (FIREABLE(k55)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(k5) U (FIREABLE(k50) AND FIREABLE(k55))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((NOT FIREABLE(k5) U (FIREABLE(k50) AND FIREABLE(k55))))
lola: processed formula length: 58
lola: 51 rewrites
lola: closed formula file CTLFireability.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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k50) AND FIREABLE(k55))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2370976 markings, 4768250 edges, 474195 markings/sec, 0 secs
lola: sara is running 5 secs || 4646075 markings, 9318018 edges, 455020 markings/sec, 5 secs
lola: sara is running 10 secs || 7192291 markings, 14330176 edges, 509243 markings/sec, 10 secs
lola: sara is running 15 secs || 9455906 markings, 18901799 edges, 452723 markings/sec, 15 secs
lola: sara is running 20 secs || 11662770 markings, 23294233 edges, 441373 markings/sec, 20 secs
lola: sara is running 25 secs || 13981016 markings, 27971762 edges, 463649 markings/sec, 25 secs
lola: sara is running 30 secs || 16216924 markings, 32420814 edges, 447182 markings/sec, 30 secs
lola: sara is running 35 secs || 18317818 markings, 36684081 edges, 420179 markings/sec, 35 secs
lola: sara is running 40 secs || 20522298 markings, 41078494 edges, 440896 markings/sec, 40 secs
lola: sara is running 45 secs || 22733577 markings, 45557209 edges, 442256 markings/sec, 45 secs
lola: sara is running 50 secs || 24922092 markings, 49991463 edges, 437703 markings/sec, 50 secs
lola: sara is running 55 secs || 27163369 markings, 54611914 edges, 448255 markings/sec, 55 secs
lola: sara is running 60 secs || 29272078 markings, 58889999 edges, 421742 markings/sec, 60 secs
lola: sara is running 65 secs || 31343380 markings, 63160889 edges, 414260 markings/sec, 65 secs
lola: sara is running 70 secs || 33394789 markings, 67419203 edges, 410282 markings/sec, 70 secs
lola: sara is running 75 secs || 35507117 markings, 71807706 edges, 422466 markings/sec, 75 secs
lola: sara is running 80 secs || 37590068 markings, 76129326 edges, 416590 markings/sec, 80 secs
lola: sara is running 85 secs || 39520423 markings, 80157680 edges, 386071 markings/sec, 85 secs
lola: sara is running 90 secs || 41595454 markings, 84499237 edges, 415006 markings/sec, 90 secs
lola: sara is running 95 secs || 43744418 markings, 88993201 edges, 429793 markings/sec, 95 secs
lola: sara is running 100 secs || 45768741 markings, 93147874 edges, 404865 markings/sec, 100 secs
lola: sara is running 105 secs || 47953096 markings, 97652937 edges, 436871 markings/sec, 105 secs
lola: sara is running 110 secs || 50043041 markings, 102041080 edges, 417989 markings/sec, 110 secs
lola: sara is running 115 secs || 52041216 markings, 106278813 edges, 399635 markings/sec, 115 secs
lola: sara is running 120 secs || 53988269 markings, 110391995 edges, 389411 markings/sec, 120 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 55026818 markings, 112635508 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((FIREABLE(k55) AND FIREABLE(k39)) OR NOT FIREABLE(k25))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((FIREABLE(k55) AND FIREABLE(k39)) OR NOT FIREABLE(k25))))
lola: processed formula length: 65
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2391408 markings, 4819474 edges, 478282 markings/sec, 0 secs
lola: 4816981 markings, 9663565 edges, 485115 markings/sec, 5 secs
lola: 7114565 markings, 14174888 edges, 459517 markings/sec, 10 secs
lola: 9278135 markings, 18559331 edges, 432714 markings/sec, 15 secs
lola: 11581395 markings, 23133869 edges, 460652 markings/sec, 20 secs
lola: 13671785 markings, 27378998 edges, 418078 markings/sec, 25 secs
lola: 15890317 markings, 31793526 edges, 443706 markings/sec, 30 secs
lola: 18000610 markings, 36066318 edges, 422059 markings/sec, 35 secs
lola: 20199827 markings, 40456062 edges, 439843 markings/sec, 40 secs
lola: 22261231 markings, 44636327 edges, 412281 markings/sec, 45 secs
lola: 24523676 markings, 49168349 edges, 452489 markings/sec, 50 secs
lola: 26689814 markings, 53641687 edges, 433228 markings/sec, 55 secs
lola: 28806067 markings, 57973780 edges, 423251 markings/sec, 60 secs
lola: 30959720 markings, 62363087 edges, 430731 markings/sec, 65 secs
lola: 33020457 markings, 66642186 edges, 412147 markings/sec, 70 secs
lola: 35077928 markings, 70914128 edges, 411494 markings/sec, 75 secs
lola: 36993927 markings, 74889877 edges, 383200 markings/sec, 80 secs
lola: 38879248 markings, 78812458 edges, 377064 markings/sec, 85 secs
lola: 40846100 markings, 82929509 edges, 393370 markings/sec, 90 secs
lola: 42756105 markings, 86931820 edges, 382001 markings/sec, 95 secs
lola: 44743866 markings, 91042110 edges, 397552 markings/sec, 100 secs
lola: 46837627 markings, 95386017 edges, 418752 markings/sec, 105 secs
lola: 48919703 markings, 99697852 edges, 416415 markings/sec, 110 secs
lola: 50930839 markings, 103945315 edges, 402227 markings/sec, 115 secs
lola: 52924395 markings, 108140739 edges, 398711 markings/sec, 120 secs
lola: 54947365 markings, 112414923 edges, 404594 markings/sec, 125 secs
lola: 56907849 markings, 116547590 edges, 392097 markings/sec, 130 secs
lola: 58845687 markings, 120661651 edges, 387568 markings/sec, 135 secs
lola: 60721240 markings, 124652400 edges, 375111 markings/sec, 140 secs
lola: 62354996 markings, 128103892 edges, 326751 markings/sec, 145 secs
lola: 62354996 markings, 128103892 edges, 0 markings/sec, 150 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 62354996 markings, 128103892 edges
lola: ========================================
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((NOT FIREABLE(k54) AND (FIREABLE(k24) OR FIREABLE(k9))))) OR (A (X ((FIREABLE(k25) OR (FIREABLE(k7) AND FIREABLE(k18))))) OR A (X (FIREABLE(k63)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(k63)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(FIREABLE(k63))
lola: processed formula length: 17
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(k54) AND (FIREABLE(k24) OR FIREABLE(k9)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(k54) AND (FIREABLE(k24) OR FIREABLE(k9)))))
lola: processed formula length: 64
lola: 49 rewrites
lola: closed formula file CTLFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(k54) AND (FIREABLE(k24) OR FIREABLE(k9)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((FIREABLE(k54) OR FIREABLE(k63)))))) AND E ((A (X (FIREABLE(k38))) U (FIREABLE(k8) OR NOT FIREABLE(k26)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (EF(AX((FIREABLE(k54) OR FIREABLE(k63)))) AND E(AX(FIREABLE(k38)) U (FIREABLE(k8) OR NOT FIREABLE(k26))))
lola: processed formula length: 107
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1009 markings, 1814 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A (X (FIREABLE(k42))) OR A (G (FIREABLE(k17)))) AND NOT FIREABLE(k62))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(((AX(FIREABLE(k42)) OR AG(FIREABLE(k17))) AND NOT FIREABLE(k62)))
lola: processed formula length: 68
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1535542 markings, 5591970 edges, 307108 markings/sec, 0 secs
lola: 3075100 markings, 10936921 edges, 307912 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3083536 markings, 11523965 edges
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((NOT FIREABLE(k16) AND NOT FIREABLE(k26))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (FIREABLE(k16) OR FIREABLE(k26))
lola: processed formula length: 33
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (FIREABLE(k16) OR FIREABLE(k26))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(k16) AND NOT FIREABLE(k26))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-1.sara.

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2596175 markings, 5445978 edges, 519235 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5071872 markings, 10657735 edges, 495139 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7504861 markings, 15768226 edges, 486598 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10040181 markings, 21088902 edges, 507064 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12383360 markings, 26024016 edges, 468636 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 14698684 markings, 30882610 edges, 463065 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 16988660 markings, 35697382 edges, 457995 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 19272953 markings, 40498615 edges, 456859 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 21557210 markings, 45292503 edges, 456851 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 23808446 markings, 50034295 edges, 450247 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 26251457 markings, 55165862 edges, 488602 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 28853663 markings, 60627156 edges, 520441 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 31387610 markings, 65952505 edges, 506789 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 34113285 markings, 71711138 edges, 545135 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 36718923 markings, 77189217 edges, 521128 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39355932 markings, 82740562 edges, 527402 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 41977526 markings, 88276474 edges, 524319 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 44669681 markings, 93933467 edges, 538431 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 47168831 markings, 99211337 edges, 499830 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 49699905 markings, 104553949 edges, 506215 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 52421644 markings, 110265183 edges, 544348 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 54885905 markings, 115464183 edges, 492852 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 57446037 markings, 120864162 edges, 512026 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 60002596 markings, 126249498 edges, 511312 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 62527072 markings, 131570246 edges, 504895 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 65059998 markings, 136928951 edges, 506585 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 67605032 markings, 142265884 edges, 509007 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 70220540 markings, 147789209 edges, 523102 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 73038934 markings, 153728845 edges, 563679 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 75746087 markings, 159439903 edges, 541431 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 78428155 markings, 165093879 edges, 536414 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 81280593 markings, 171080471 edges, 570488 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 84070897 markings, 176968877 edges, 558061 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 86893486 markings, 182914236 edges, 564518 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 89594780 markings, 188622755 edges, 540259 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 92472460 markings, 194697985 edges, 575536 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 95349226 markings, 200737356 edges, 575353 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 98236548 markings, 206820651 edges, 577464 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 100994392 markings, 212698539 edges, 551569 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 103602378 markings, 218212576 edges, 521597 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 106193014 markings, 223455072 edges, 518127 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 108583948 markings, 228580483 edges, 478187 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 110972081 markings, 233633339 edges, 477627 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 113713663 markings, 239500193 edges, 548316 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 116177224 markings, 244715408 edges, 492712 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 117980267 markings, 248630737 edges, 360609 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((FIREABLE(k14) AND FIREABLE(k43) AND NOT FIREABLE(k51))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (FIREABLE(k14) AND FIREABLE(k43) AND NOT FIREABLE(k51))
lola: processed formula length: 55
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (FIREABLE(k14) AND FIREABLE(k43) AND NOT FIREABLE(k51))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
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: (NOT FIREABLE(k14) OR NOT FIREABLE(k43) OR FIREABLE(k51))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 32 markings, 46 edges
lola: subprocess 8 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E ((NOT FIREABLE(k6) R NOT FIREABLE(k52)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: lola: processed formula: AG(E(NOT FIREABLE(k6) R NOT FIREABLE(k52)))
========================================
lola: processed formula length: 43
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2275038 markings, 6839410 edges, 455008 markings/sec, 0 secs
lola: 4430978 markings, 13328540 edges, 431188 markings/sec, 5 secs
lola: 6576077 markings, 19716209 edges, 429020 markings/sec, 10 secs
lola: 8633185 markings, 25943123 edges, 411422 markings/sec, 15 secs
lola: 10786795 markings, 32341058 edges, 430722 markings/sec, 20 secs
lola: 12853893 markings, 38562419 edges, 413420 markings/sec, 25 secs
lola: 14912242 markings, 44761200 edges, 411670 markings/sec, 30 secs
lola: 16774379 markings, 50316978 edges, 372427 markings/sec, 35 secs
lola: 18568642 markings, 55741869 edges, 358853 markings/sec, 40 secs
lola: 20410293 markings, 61276300 edges, 368330 markings/sec, 45 secs
lola: 22302021 markings, 67017270 edges, 378346 markings/sec, 50 secs
lola: 24468247 markings, 73523341 edges, 433245 markings/sec, 55 secs
lola: 26530004 markings, 79860652 edges, 412351 markings/sec, 60 secs
lola: 28582804 markings, 86104101 edges, 410560 markings/sec, 65 secs
lola: 30598164 markings, 92208838 edges, 403072 markings/sec, 70 secs
lola: 32603007 markings, 98377490 edges, 400969 markings/sec, 75 secs
lola: 34564736 markings, 104413812 edges, 392346 markings/sec, 80 secs
lola: 36437614 markings, 110176598 edges, 374576 markings/sec, 85 secs
lola: 38068355 markings, 115190915 edges, 326148 markings/sec, 90 secs
lola: 39665929 markings, 120126431 edges, 319515 markings/sec, 95 secs
lola: 41217280 markings, 124925960 edges, 310270 markings/sec, 100 secs
lola: 42952881 markings, 130295540 edges, 347120 markings/sec, 105 secs
lola: 44925341 markings, 136341868 edges, 394492 markings/sec, 110 secs
lola: 46807105 markings, 142131234 edges, 376353 markings/sec, 115 secs
lola: 48601206 markings, 147627132 edges, 358820 markings/sec, 120 secs
lola: 50340441 markings, 153031484 edges, 347847 markings/sec, 125 secs
lola: 52253572 markings, 158983621 edges, 382626 markings/sec, 130 secs
lola: 54186604 markings, 165002909 edges, 386606 markings/sec, 135 secs
lola: 56125685 markings, 171018351 edges, 387816 markings/sec, 140 secs
lola: 58032483 markings, 176965111 edges, 381360 markings/sec, 145 secs
lola: 59920447 markings, 182862129 edges, 377593 markings/sec, 150 secs
lola: 61548843 markings, 187927155 edges, 325679 markings/sec, 155 secs
lola: 61548843 markings, 187927155 edges, 0 markings/sec, 160 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 61548843 markings, 187927155 edges
lola: ========================================
lola: subprocess 9 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(k36) U A (G (NOT FIREABLE(k23)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(FIREABLE(k36) U AG(NOT FIREABLE(k23)))
lola: processed formula length: 40
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3161166 markings, 6349364 edges, 632233 markings/sec, 0 secs
lola: 6205970 markings, 12437098 edges, 608961 markings/sec, 5 secs
lola: 9037958 markings, 18107130 edges, 566398 markings/sec, 10 secs
lola: 12018340 markings, 23985787 edges, 596076 markings/sec, 15 secs
lola: 14864680 markings, 29757147 edges, 569268 markings/sec, 20 secs
lola: 17700867 markings, 35466631 edges, 567237 markings/sec, 25 secs
lola: 20577652 markings, 41188462 edges, 575357 markings/sec, 30 secs
lola: 23390976 markings, 46906823 edges, 562665 markings/sec, 35 secs
lola: 26266215 markings, 52773853 edges, 575048 markings/sec, 40 secs
lola: 29090882 markings, 58525690 edges, 564933 markings/sec, 45 secs
lola: 31794668 markings, 64098266 edges, 540757 markings/sec, 50 secs
lola: 34420205 markings, 69548977 edges, 525107 markings/sec, 55 secs
lola: 36985114 markings, 74872099 edges, 512982 markings/sec, 60 secs
lola: 39468585 markings, 80047989 edges, 496694 markings/sec, 65 secs
lola: 41903177 markings, 85146713 edges, 486918 markings/sec, 70 secs
lola: 44480646 markings, 90517817 edges, 515494 markings/sec, 75 secs
lola: 47353730 markings, 96426170 edges, 574617 markings/sec, 80 secs
lola: 50168881 markings, 102328060 edges, 563030 markings/sec, 85 secs
lola: 52910136 markings, 108111144 edges, 548251 markings/sec, 90 secs
lola: 55497067 markings, 113572122 edges, 517386 markings/sec, 95 secs
lola: 58037776 markings, 118944409 edges, 508142 markings/sec, 100 secs
lola: 60536408 markings, 124254424 edges, 499726 markings/sec, 105 secs
lola: 61552566 markings, 126384730 edges, 203232 markings/sec, 110 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 61552566 markings, 126384730 edges
lola: ========================================
lola: subprocess 10 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(k28) AND NOT FIREABLE(k36)) OR E (G (FIREABLE(k29)))) AND E (G ((FIREABLE(k29) AND FIREABLE(k39)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((NOT FIREABLE(k28) AND NOT FIREABLE(k36)) OR EG(FIREABLE(k29))) AND EG((FIREABLE(k29) AND FIREABLE(k39)))))
lola: processed formula length: 112
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2211945 markings, 6654536 edges, 442389 markings/sec, 0 secs
lola: 4334556 markings, 13058375 edges, 424522 markings/sec, 5 secs
lola: 6433356 markings, 19307974 edges, 419760 markings/sec, 10 secs
lola: 8465525 markings, 25430873 edges, 406434 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9302737 markings, 27919807 edges
lola: ========================================
lola: subprocess 11 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(k23))) OR FIREABLE(k37))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes no unknown no unknown unknown yes unknown yes yes no yes yes unknown yes unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes no unknown no unknown unknown yes unknown yes yes no yes yes unknown yes unknown
lola: memory consumption: 13280 KB
lola: time consumption: 1386 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: memory consumption: 13280 KB
lola: time consumption: 1386 seconds
lola: print data as JSON (--json)
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(k21) AND FIREABLE(k39) AND FIREABLE(k37) AND FIREABLE(k52)))) AND (E (F (FIREABLE(k2))) AND A (F (NOT FIREABLE(k33)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(k33)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: FIREABLE(k33)
lola: processed formula length: 13
lola: 51 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(k33)
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 CTLFireability-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(k2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (FIREABLE(k2)))
lola: processed formula length: 20
lola: 49 rewrites
lola: closed formula file CTLFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(k2)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1092 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k21) AND FIREABLE(k39) AND FIREABLE(k37) AND FIREABLE(k52))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(k21) AND FIREABLE(k39) AND FIREABLE(k37) AND FIREABLE(k52))))
lola: processed formula length: 77
lola: 49 rewrites
lola: closed formula file CTLFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k21) AND FIREABLE(k39) AND FIREABLE(k37) AND FIREABLE(k52))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((FIREABLE(k11) U (FIREABLE(k35) AND FIREABLE(k57) AND NOT FIREABLE(k22)))) OR (A (((FIREABLE(k30) AND FIREABLE(k36)) U FIREABLE(k22))) OR ((FIREABLE(k60)) OR A (G (NOT FIREABLE(k26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k60))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(k60))
lola: processed formula length: 15
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1092 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(k26)))
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 (NOT FIREABLE(k26)))
lola: processed formula length: 25
lola: 50 rewrites
lola: closed formula file CTLFireability.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: FIREABLE(k26)
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 CTLFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 15 will run for 2184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(k30) AND FIREABLE(k36)) U FIREABLE(k22)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((FIREABLE(k30) AND FIREABLE(k36)) U FIREABLE(k22)))
lola: processed formula length: 55
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k30) AND FIREABLE(k36))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
sara: try reading problem file CTLFireability-13-0.sara.
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 14 will run for 1092 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F (NOT FIREABLE(k50))))) AND A (G (A (F (NOT FIREABLE(k11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1092 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (NOT FIREABLE(k11)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola:
rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: FIREABLE(k11)
lola: processed formula length: 13
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: FIREABLE(k11)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 10 markings, 10 edges
lola: state equation: write sara problem file to CTLFireability-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-1.sara.

lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(k11)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 2184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(k55) AND FIREABLE(k61)))) OR (E (F ((FIREABLE(k13) AND FIREABLE(k39)))) OR ((A (G (NOT FIREABLE(k37))) AND NOT FIREABLE(k44)) OR E ((FIREABLE(k18) U FIREABLE(k45))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(k44)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(k44)
lola: processed formula length: 17
lola: 48 rewrites
lola: closed formula file CTLFireability.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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(k18) U FIREABLE(k45)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((FIREABLE(k18) U FIREABLE(k45)))
lola: processed formula length: 35
lola: 51 rewrites
lola: closed formula file CTLFireability.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: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k13) AND FIREABLE(k39))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(k13) AND FIREABLE(k39))))
lola: processed formula length: 41
lola: 49 rewrites
lola: closed formula file CTLFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k13) AND FIREABLE(k39))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-18-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((NOT FIREABLE(k16) AND NOT FIREABLE(k26))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (FIREABLE(k16) OR FIREABLE(k26))
lola: processed formula length: 33
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(k16) AND NOT FIREABLE(k26))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (FIREABLE(k16) OR FIREABLE(k26))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-16-1.sara
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-16-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-16-0.sara.


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2873091 markings, 6025629 edges, 574618 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5647129 markings, 11862126 edges, 554808 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8309727 markings, 17463209 edges, 532520 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10958564 markings, 23024772 edges, 529767 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13574187 markings, 28518792 edges, 523125 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 16104964 markings, 33845528 edges, 506155 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18720433 markings, 39338747 edges, 523094 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 21275893 markings, 44702344 edges, 511092 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23858969 markings, 50140402 edges, 516615 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 26180135 markings, 55015249 edges, 464233 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28425323 markings, 59715689 edges, 449038 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30871071 markings, 64861900 edges, 489150 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33449843 markings, 70296210 edges, 515754 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35957327 markings, 75599189 edges, 501497 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 38471380 markings, 80875252 edges, 502811 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40940574 markings, 86078123 edges, 493839 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 43500456 markings, 91468804 edges, 511976 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 45931174 markings, 96603581 edges, 486144 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 48332119 markings, 101665838 edges, 480189 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 50713829 markings, 106692150 edges, 476342 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 53093590 markings, 111685860 edges, 475952 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 55454203 markings, 116667342 edges, 472123 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 57911225 markings, 121837550 edges, 491404 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 60360617 markings, 127010914 edges, 489878 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 62999950 markings, 132583089 edges, 527867 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 65529846 markings, 137903238 edges, 505979 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 68091505 markings, 143292278 edges, 512332 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 70739961 markings, 148884926 edges, 529691 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 73317988 markings, 154316124 edges, 515605 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 75773871 markings, 159497142 edges, 491177 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 78385339 markings, 165003196 edges, 522294 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 81389148 markings, 171310527 edges, 600762 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 84350538 markings, 177558284 edges, 592278 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 87289173 markings, 183755999 edges, 587727 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 90117136 markings, 189728258 edges, 565593 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 93097321 markings, 196007712 edges, 596037 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 95878538 markings, 201844664 edges, 556243 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 98546600 markings, 207474113 edges, 533612 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 101039374 markings, 212794669 edges, 498555 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 103751853 markings, 218530879 edges, 542496 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 106771004 markings, 224695613 edges, 603830 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 109479986 markings, 230479688 edges, 541796 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 112102845 markings, 236095978 edges, 524572 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 114519978 markings, 241193321 edges, 483427 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 116800209 markings, 246071358 edges, 456046 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(k23))) OR FIREABLE(k37))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: FIREABLE(k37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k37)
lola: processed formula length: 13
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(k23)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (FIREABLE(k23)))
lola: processed formula length: 21
lola: 49 rewrites
lola: closed formula file CTLFireability.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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A ((FIREABLE(k11) U (FIREABLE(k35) AND FIREABLE(k57) AND NOT FIREABLE(k22)))) OR (A (((FIREABLE(k30) AND FIREABLE(k36)) U FIREABLE(k22))) OR ((FIREABLE(k60)) OR A (G (NOT FIREABLE(k26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k60))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(k60))
lola: processed formula length: 15
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(k26)))
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 (NOT FIREABLE(k26)))
lola: processed formula length: 25
lola: 50 rewrites
lola: closed formula file CTLFireability.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: FIREABLE(k26)
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: 12 markings, 11 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(k30) AND FIREABLE(k36)) U FIREABLE(k22)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((FIREABLE(k30) AND FIREABLE(k36)) U FIREABLE(k22)))
lola: processed formula length: 55
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k30) AND FIREABLE(k36))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-20-0.sara
lola: state equation: calling and running sara
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(k11) U (FIREABLE(k35) AND FIREABLE(k57) AND NOT FIREABLE(k22))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((FIREABLE(k11) U (FIREABLE(k35) AND FIREABLE(k57) AND NOT FIREABLE(k22))))
lola: processed formula length: 77
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(k11)
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 CTLFireability-21-0.sara
lola: state equation: calling and running sara
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown no yes no yes yes yes yes no yes yes yes yes no
lola:
preliminary result: yes no unknown no yes no yes yes yes yes no yes yes yes yes no
lola: ========================================
lola: memory consumption: 13784 KB
lola: time consumption: 1614 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

BK_STOP 1552502039361

--------------------
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="CTLFireability"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is Angiogenesis-PT-50, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-csrt-155225064900059"
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 [ "CTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLFireability" = "UpperBounds" ] ; 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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;