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

About the Execution of LoLA for JoinFreeModules-PT-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.240 1112982.00 1159756.00 1283.70 ??T?FTTTT?TTTFFT 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.r082-csrt-155246550300950.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 JoinFreeModules-PT-0100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550300950
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 3.5K Feb 11 06:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 06:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 7 05:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 05:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 3 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jan 31 06:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 31 06:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 566K 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 JoinFreeModules-PT-0100-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1552685805244

info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ JoinFreeModules-PT-0100 @ 3570 seconds

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

FORMULA JoinFreeModules-PT-0100-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0100-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0100-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0100-CTLFireability-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2457
rslt: Output for CTLFireability @ JoinFreeModules-PT-0100

{
"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": "Fri Mar 15 21:36:45 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": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "NOT FIREABLE(t57)",
"processed_size": 17,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 246
},
"exit":
{
"localtimelimitreached": false
},
"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(t687))",
"processed_size": 18,
"rewrites": 48
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 230
},
"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(t265)",
"processed_size": 14,
"rewrites": 49
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 246
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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 (G (FIREABLE(t125)))",
"processed_size": 22,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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 ((NOT FIREABLE(t64) AND NOT FIREABLE(t280))))",
"processed_size": 50,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 287
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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(t674) OR FIREABLE(t334)) AND (FIREABLE(t689) OR FIREABLE(t328)))))",
"processed_size": 85,
"rewrites": 48
},
"result":
{
"edges": 4,
"markings": 5,
"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": 8,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "EG((EX(NOT FIREABLE(t221)) OR EX(NOT FIREABLE(t198))))",
"processed_size": 54,
"rewrites": 50
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 302,
"markings": 302,
"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": 302
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": "EX(AF((NOT FIREABLE(t622) AND NOT FIREABLE(t506))))",
"processed_size": 51,
"rewrites": 49
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 60594,
"markings": 60394,
"produced_by": "CTL model checker",
"value": false
},
"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": 332
},
"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(t545)",
"processed_size": 14,
"rewrites": 49
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"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": 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(t279) AND FIREABLE(t182) AND (FIREABLE(t184) OR FIREABLE(t94)))))",
"processed_size": 82,
"rewrites": 48
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "E (G ((FIREABLE(t31) OR FIREABLE(t418) OR FIREABLE(t295))))",
"processed_size": 61,
"rewrites": 48
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"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": 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": "(NOT FIREABLE(t560) AND NOT FIREABLE(t150) AND NOT FIREABLE(t702) AND NOT FIREABLE(t525))",
"processed_size": 89,
"rewrites": 50
},
"result":
{
"edges": 105,
"markings": 105,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 753
},
"exit":
{
"localtimelimitreached": false
},
"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(t205)",
"processed_size": 18,
"rewrites": 51
},
"result":
{
"edges": 302,
"markings": 302,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1004
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": 3,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "((NOT FIREABLE(t188) AND NOT FIREABLE(t172)) OR FIREABLE(t303))",
"processed_size": 64,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1507
},
"exit":
{
"localtimelimitreached": false
},
"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(t427)",
"processed_size": 18,
"rewrites": 50
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1507
},
"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(t647)",
"processed_size": 18,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3014
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"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": "A ((NOT FIREABLE(t357) R NOT FIREABLE(t172)))",
"processed_size": 45,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3014
},
"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(t335)))",
"processed_size": 22,
"rewrites": 48
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"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": "EG(AF(FIREABLE(t494)))",
"processed_size": 22,
"rewrites": 49
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 303,
"markings": 302,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "NOT FIREABLE(t57)",
"processed_size": 17,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 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(t687))",
"processed_size": 18,
"rewrites": 48
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"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(t647)",
"processed_size": 18,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"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": "A ((NOT FIREABLE(t357) R NOT FIREABLE(t172)))",
"processed_size": 45,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"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(t771) AND FIREABLE(t15))))",
"processed_size": 42,
"rewrites": 48
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 22,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
},

{
"child":
[

{
"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(t335)))",
"processed_size": 22,
"rewrites": 48
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 21,
"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"
}
},

{
"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(t498)",
"processed_size": 18,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 22,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 19276,
"runtime": 1113.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((E(G(E(F(**)))) OR **) AND (A(X(**)) OR E(F(A(G(**)))))) : A(F((A(G(*)) AND E(G(*))))) : (E(F(*)) AND (E(G(A(F(**)))) OR A(F(**)))) : A(G(E((* R *)))) : A(F(A(G(**)))) : E(X(E(F(**)))) : (E(F(**)) OR (A((* R *)) AND *)) : ((A(X(**)) AND (A((** U **)) AND (E(G(**)) AND E(G(**))))) OR (E(F(*)) AND E(F(**)))) : E(G(**)) : A(X(E((** U **)))) : E(F(**)) : E(G((E(X(*)) OR E(X(*))))) : (** OR E(F(E(G(*))))) : E(X(A(F(*)))) : A(F(**)) : E(X(E(F(**))))"
},
"net":
{
"arcs": 2302,
"conflict_clusters": 401,
"places": 501,
"places_significant": 400,
"singleton_clusters": 0,
"transitions": 801
},
"result":
{
"preliminary_value": "unknown unknown yes unknown no yes yes yes yes unknown yes yes yes no no yes ",
"value": "unknown unknown yes unknown no yes yes yes yes unknown yes yes yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1302/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16032
lola: finding significant places
lola: 501 places, 801 transitions, 400 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 (G (E (F (FIREABLE(t793))))) OR NOT FIREABLE(t57)) AND (A (X (FIREABLE(t687))) OR E (F (A (G (FIREABLE(t345))))))) : NOT(E (G ((E (F (FIREABLE(t523))) OR A (F (FIREABLE(t727))))))) : (NOT(A (G (NOT FIREABLE(t335)))) AND (E (G (A (F (FIREABLE(t494))))) OR A (F (FIREABLE(t498))))) : NOT(E (F (A ((FIREABLE(t272) U FIREABLE(t208)))))) : A (F (A (G (FIREABLE(t205))))) : E (F (E (F (E (X (FIREABLE(t265))))))) : (E (F (A (F ((FIREABLE(t771) AND FIREABLE(t15)))))) OR NOT((E ((FIREABLE(t357) U FIREABLE(t172))) OR FIREABLE(t647)))) : ((A (X (FIREABLE(t23))) AND (A ((FIREABLE(t45) U FIREABLE(t789))) AND (E (G (FIREABLE(t252))) AND E (G (FIREABLE(t125)))))) OR (NOT(A (G ((FIREABLE(t64) OR FIREABLE(t280))))) AND E (F (((FIREABLE(t674) OR FIREABLE(t334)) AND (FIREABLE(t689) OR FIREABLE(t328))))))) : E (G ((FIREABLE(t31) OR FIREABLE(t418) OR FIREABLE(t295)))) : A (X (E ((NOT FIREABLE(t757) U FIREABLE(t606))))) : E (F (E (F ((FIREABLE(t279) AND FIREABLE(t182) AND (FIREABLE(t184) OR FIREABLE(t94))))))) : NOT(A (F ((A (X (FIREABLE(t221))) AND A (X (FIREABLE(t198))))))) : (((NOT FIREABLE(t188) AND NOT FIREABLE(t172)) OR FIREABLE(t303)) OR E (F (NOT(A (F (FIREABLE(t427))))))) : E (X (NOT(E (G ((FIREABLE(t622) OR FIREABLE(t506))))))) : A (F ((FIREABLE(t560) OR FIREABLE(t150) OR FIREABLE(t702) OR FIREABLE(t525)))) : E (X (E (F (FIREABLE(t545)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:323
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: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:395
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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: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:401
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G (E (F (FIREABLE(t793))))) OR NOT FIREABLE(t57)) AND (A (X (FIREABLE(t687))) OR E (F (A (G (FIREABLE(t345)))))))
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: NOT FIREABLE(t57)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t57)
lola: processed formula length: 17
lola: 47 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: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t345)))))
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: NOT FIREABLE(t345)
lola: processed formula length: 18
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
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: NOT FIREABLE(t345)
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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t345)
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-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-0.sara
sara: try reading problem file CTLFireability-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 680414 markings, 968664 edges, 136083 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1406694 markings, 2002904 edges, 145256 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2212030 markings, 3149876 edges, 161067 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2993271 markings, 4262481 edges, 156248 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3773674 markings, 5373838 edges, 156081 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4553787 markings, 6484811 edges, 156023 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 5336922 markings, 7600094 edges, 156627 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 6128792 markings, 8727777 edges, 158374 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 6915488 markings, 9848126 edges, 157339 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 7696050 markings, 10959800 edges, 156112 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 8483924 markings, 12081695 edges, 157575 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 9264287 markings, 13193141 edges, 156073 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 10031023 markings, 14285008 edges, 153347 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 10810731 markings, 15395451 edges, 155942 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 11598885 markings, 16517766 edges, 157631 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 12381071 markings, 17631718 edges, 156437 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 13173239 markings, 18759899 edges, 158434 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 13950523 markings, 19866868 edges, 155457 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 14699202 markings, 20933077 edges, 149736 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 15479204 markings, 22043849 edges, 156000 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 16247852 markings, 23138532 edges, 153730 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 17028421 markings, 24250049 edges, 156114 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t687)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(FIREABLE(t687))
lola: processed formula length: 18
lola: 48 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (FIREABLE(t265)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: FIREABLE(t265)
lola: processed formula length: 14
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 /EXEF)
lola: state space: using reachability graph (EXef 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: 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(t265)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable from some successor.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X (FIREABLE(t23))) AND (A ((FIREABLE(t45) U FIREABLE(t789))) AND (E (G (FIREABLE(t252))) AND E (G (FIREABLE(t125)))))) OR (E (F ((NOT FIREABLE(t64) AND NOT FIREABLE(t280)))) AND E (F (((FIREABLE(t674) OR FIREABLE(t334)) AND (FIREABLE(t689) OR FIREABLE(t328)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t125)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (FIREABLE(t125)))
lola: processed formula length: 22
lola: 48 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: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(t125)
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 / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t64) AND NOT FIREABLE(t280))))
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(t64) AND NOT FIREABLE(t280))))
lola: processed formula length: 50
lola: 48 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(t64) AND NOT FIREABLE(t280))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t674) OR FIREABLE(t334)) AND (FIREABLE(t689) OR FIREABLE(t328)))))
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(t674) OR FIREABLE(t334)) AND (FIREABLE(t689) OR FIREABLE(t328)))))
lola: processed formula length: 85
lola: 48 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(t674) OR FIREABLE(t334)) AND (FIREABLE(t689) OR FIREABLE(t328)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E ((NOT FIREABLE(t757) U FIREABLE(t606)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E(NOT FIREABLE(t757) U FIREABLE(t606)))
lola: processed formula length: 42
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 667201 markings, 949919 edges, 133440 markings/sec, 0 secs
lola: 1364673 markings, 1943087 edges, 139494 markings/sec, 5 secs
lola: 2034304 markings, 2896807 edges, 133926 markings/sec, 10 secs
lola: 2682518 markings, 3819834 edges, 129643 markings/sec, 15 secs
lola: 3311299 markings, 4715379 edges, 125756 markings/sec, 20 secs
lola: 3966462 markings, 5648398 edges, 131033 markings/sec, 25 secs
lola: 4659478 markings, 6635336 edges, 138603 markings/sec, 30 secs
lola: 5352604 markings, 7622398 edges, 138625 markings/sec, 35 secs
lola: 6048848 markings, 8614050 edges, 139249 markings/sec, 40 secs
lola: 6743169 markings, 9602780 edges, 138864 markings/sec, 45 secs
lola: 7430143 markings, 10581178 edges, 137395 markings/sec, 50 secs
lola: 8125032 markings, 11570686 edges, 138978 markings/sec, 55 secs
lola: 8816145 markings, 12554966 edges, 138223 markings/sec, 60 secs
lola: 9503558 markings, 13533849 edges, 137483 markings/sec, 65 secs
lola: 10199878 markings, 14525429 edges, 139264 markings/sec, 70 secs
lola: 10892411 markings, 15511764 edges, 138507 markings/sec, 75 secs
lola: 11589734 markings, 16504842 edges, 139465 markings/sec, 80 secs
lola: 12283201 markings, 17492395 edges, 138693 markings/sec, 85 secs
lola: 12974992 markings, 18477560 edges, 138358 markings/sec, 90 secs
lola: 13665153 markings, 19460447 edges, 138032 markings/sec, 95 secs
lola: 14340606 markings, 20422308 edges, 135091 markings/sec, 100 secs
lola: 15024522 markings, 21396359 edges, 136783 markings/sec, 105 secs
lola: 15708885 markings, 22370847 edges, 136873 markings/sec, 110 secs
lola: 16399901 markings, 23355004 edges, 138203 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X (NOT FIREABLE(t221))) OR E (X (NOT FIREABLE(t198))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EX(NOT FIREABLE(t221)) OR EX(NOT FIREABLE(t198))))
lola: processed formula length: 54
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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 302 markings, 302 edges
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((NOT FIREABLE(t622) AND NOT FIREABLE(t506))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF((NOT FIREABLE(t622) AND NOT FIREABLE(t506))))
lola: processed formula length: 51
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 1 significant temporal operators and needs 5 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: 60394 markings, 60594 edges
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (FIREABLE(t545)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: FIREABLE(t545)
lola: processed formula length: 14
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 /EXEF)
lola: state space: using reachability graph (EXef 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: 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(t545)
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 /EXEF
lola: The predicate is reachable from some successor.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t279) AND FIREABLE(t182) AND (FIREABLE(t184) OR FIREABLE(t94)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: lola: ========================================
state equation: calling and running sara
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(t279) AND FIREABLE(t182) AND (FIREABLE(t184) OR FIREABLE(t94)))))
lola: processed formula length: 82
lola: 48 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(t279) AND FIREABLE(t182) AND (FIREABLE(t184) OR FIREABLE(t94)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t31) OR FIREABLE(t418) OR FIREABLE(t295))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((FIREABLE(t31) OR FIREABLE(t418) OR FIREABLE(t295))))
lola: processed formula length: 61
lola: 48 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: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(t31) AND NOT FIREABLE(t418) AND NOT FIREABLE(t295))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t560) OR FIREABLE(t150) OR FIREABLE(t702) OR FIREABLE(t525))))
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:787
lola: processed formula: (NOT FIREABLE(t560) AND NOT FIREABLE(t150) AND NOT FIREABLE(t702) AND NOT FIREABLE(t525))
lola: processed formula length: 89
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 / 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: (FIREABLE(t560) OR FIREABLE(t150) OR FIREABLE(t702) OR FIREABLE(t525))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 105 markings, 105 edges
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E ((NOT FIREABLE(t272) R NOT FIREABLE(t208)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E(NOT FIREABLE(t272) R NOT FIREABLE(t208)))
lola: processed formula length: 46
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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: 450011 markings, 1090670 edges, 90002 markings/sec, 0 secs
lola: 923634 markings, 2238680 edges, 94725 markings/sec, 5 secs
lola: 1406773 markings, 3409806 edges, 96628 markings/sec, 10 secs
lola: 1897835 markings, 4600221 edges, 98212 markings/sec, 15 secs
lola: 2388982 markings, 5790869 edges, 98229 markings/sec, 20 secs
lola: 2875934 markings, 6971264 edges, 97390 markings/sec, 25 secs
lola: 3343702 markings, 8105148 edges, 93554 markings/sec, 30 secs
lola: 3789154 markings, 9184983 edges, 89090 markings/sec, 35 secs
lola: 4229971 markings, 10253559 edges, 88163 markings/sec, 40 secs
lola: 4665688 markings, 11309832 edges, 87143 markings/sec, 45 secs
lola: 5132859 markings, 12442357 edges, 93434 markings/sec, 50 secs
lola: 5603779 markings, 13583810 edges, 94184 markings/sec, 55 secs
lola: 6072409 markings, 14719922 edges, 93726 markings/sec, 60 secs
lola: 6516394 markings, 15796183 edges, 88797 markings/sec, 65 secs
lola: 6954323 markings, 16857706 edges, 87586 markings/sec, 70 secs
lola: 7387328 markings, 17907519 edges, 86601 markings/sec, 75 secs
lola: 7838613 markings, 19001380 edges, 90257 markings/sec, 80 secs
lola: 8289208 markings, 20093760 edges, 90119 markings/sec, 85 secs
lola: 8724528 markings, 21148966 edges, 87064 markings/sec, 90 secs
lola: 9161329 markings, 22207759 edges, 87360 markings/sec, 95 secs
lola: 9601201 markings, 23274150 edges, 87974 markings/sec, 100 secs
lola: 10041224 markings, 24340753 edges, 88005 markings/sec, 105 secs
lola: 10475727 markings, 25394114 edges, 86901 markings/sec, 110 secs
lola: 10918338 markings, 26467039 edges, 88522 markings/sec, 115 secs
lola: 11383561 markings, 27594740 edges, 93045 markings/sec, 120 secs
lola: 11833209 markings, 28684799 edges, 89930 markings/sec, 125 secs
lola: 12293432 markings, 29800399 edges, 92045 markings/sec, 130 secs
lola: 12759721 markings, 30930663 edges, 93258 markings/sec, 135 secs
lola: 13224478 markings, 32057315 edges, 92951 markings/sec, 140 secs
lola: 13693534 markings, 33194420 edges, 93811 markings/sec, 145 secs
lola: 14162374 markings, 34330837 edges, 93768 markings/sec, 150 secs
lola: 14624652 markings, 35451489 edges, 92456 markings/sec, 155 secs
lola: 15087838 markings, 36574349 edges, 92637 markings/sec, 160 secs
lola: 15541628 markings, 37674308 edges, 90758 markings/sec, 165 secs
lola: 16012927 markings, 38816835 edges, 94260 markings/sec, 170 secs
lola: 16478764 markings, 39946106 edges, 93167 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (NOT FIREABLE(t523))) AND E (G (NOT FIREABLE(t727))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(NOT FIREABLE(t523)) AND EG(NOT FIREABLE(t727))))
lola: processed formula length: 55
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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 693330 markings, 987051 edges, 138666 markings/sec, 0 secs
lola: 1380711 markings, 1965940 edges, 137476 markings/sec, 5 secs
lola: 2070626 markings, 2948518 edges, 137983 markings/sec, 10 secs
lola: 2752814 markings, 3919970 edges, 136438 markings/sec, 15 secs
lola: 3438811 markings, 4896946 edges, 137199 markings/sec, 20 secs
lola: 4074517 markings, 5802274 edges, 127141 markings/sec, 25 secs
lola: 4715795 markings, 6715559 edges, 128256 markings/sec, 30 secs
lola: 5361031 markings, 7634392 edges, 129047 markings/sec, 35 secs
lola: 5992373 markings, 8533636 edges, 126268 markings/sec, 40 secs
lola: 6649737 markings, 9469641 edges, 131473 markings/sec, 45 secs
lola: 7345863 markings, 10461134 edges, 139225 markings/sec, 50 secs
lola: 8045633 markings, 11457697 edges, 139954 markings/sec, 55 secs
lola: 8732858 markings, 12436230 edges, 137445 markings/sec, 60 secs
lola: 9426069 markings, 13423541 edges, 138642 markings/sec, 65 secs
lola: 10121804 markings, 14414259 edges, 139147 markings/sec, 70 secs
lola: 10819666 markings, 15408194 edges, 139572 markings/sec, 75 secs
lola: 11500611 markings, 16377896 edges, 136189 markings/sec, 80 secs
lola: 12172732 markings, 17335118 edges, 134424 markings/sec, 85 secs
lola: 12828860 markings, 18269459 edges, 131226 markings/sec, 90 secs
lola: 13471722 markings, 19184987 edges, 128572 markings/sec, 95 secs
lola: 14117373 markings, 20104355 edges, 129130 markings/sec, 100 secs
lola: 14756113 markings, 21014055 edges, 127748 markings/sec, 105 secs
lola: 15391003 markings, 21918273 edges, 126978 markings/sec, 110 secs
lola: 16032330 markings, 22831596 edges, 128265 markings/sec, 115 secs
lola: 16688683 markings, 23766302 edges, 131271 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (FIREABLE(t205)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t205)
lola: processed formula length: 18
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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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 0
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: NOT FIREABLE(t205)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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(t205)
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 /EGEF
lola: The predicate is not eventually invariant.
lola: 302 markings, 302 edges
lola: ========================================
lola: subprocess 13 will run for 1004 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((NOT FIREABLE(t188) AND NOT FIREABLE(t172)) OR FIREABLE(t303)) OR E (F (E (G (NOT FIREABLE(t427))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1004 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t188) AND NOT FIREABLE(t172)) OR FIREABLE(t303))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t188) AND NOT FIREABLE(t172)) OR FIREABLE(t303))
lola: processed formula length: 64
lola: 47 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 1507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (NOT FIREABLE(t427)))))
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: NOT FIREABLE(t427)
lola: processed formula length: 18
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 /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 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(t427)
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 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: NOT FIREABLE(t427)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 214 markings, 214 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t771) AND FIREABLE(t15)))) OR (A ((NOT FIREABLE(t357) R NOT FIREABLE(t172))) AND NOT FIREABLE(t647)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t647)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t647)
lola: processed formula length: 18
lola: 47 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: subprocess 15 will run for 3014 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t357) R NOT FIREABLE(t172)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((NOT FIREABLE(t357) R NOT FIREABLE(t172)))
lola: processed formula length: 45
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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 15 will run for 3014 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(t335))) AND (E (G (A (F (FIREABLE(t494))))) OR A (F (FIREABLE(t498)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3014 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t335)))
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(t335)))
lola: processed formula length: 22
lola: 48 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: 6 markings, 5 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 (G (A (F (FIREABLE(t494)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(FIREABLE(t494)))
lola: processed formula length: 22
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 2 significant temporal operators and needs 9 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: 302 markings, 303 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((E (G (E (F (FIREABLE(t793))))) OR NOT FIREABLE(t57)) AND (A (X (FIREABLE(t687))) OR E (F (A (G (FIREABLE(t345)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t57)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t57)
lola: processed formula length: 17
lola: 47 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: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t345)))))
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: NOT FIREABLE(t345)
lola: processed formula length: 18
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
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: FIREABLE(t345)
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 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: NOT FIREABLE(t345)
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: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: try reading problem file CTLFireability-17-0.sara.
sara: try reading problem file CTLFireability-17-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 789780 markings, 1124367 edges, 157956 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1571361 markings, 2237474 edges, 156316 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2365862 markings, 3368969 edges, 158900 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3159622 markings, 4499371 edges, 158752 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3960270 markings, 5639613 edges, 160130 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4764743 markings, 6785258 edges, 160895 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 5562474 markings, 7921266 edges, 159546 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 6361667 markings, 9059514 edges, 159839 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 7160599 markings, 10197152 edges, 159786 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 7957014 markings, 11331453 edges, 159283 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 8741343 markings, 12448397 edges, 156866 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 9518784 markings, 13555617 edges, 155488 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 10291361 markings, 14655857 edges, 154515 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 11038313 markings, 15719542 edges, 149390 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 11797198 markings, 16800318 edges, 151777 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 12557669 markings, 17883283 edges, 152094 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 13319116 markings, 18967637 edges, 152289 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 14079488 markings, 20050480 edges, 152074 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 14836864 markings, 21129027 edges, 151475 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 15597164 markings, 22211773 edges, 152060 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 16361794 markings, 23300724 edges, 152926 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 17104332 markings, 24358130 edges, 148508 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t687)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(FIREABLE(t687))
lola: processed formula length: 18
lola: 48 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E ((NOT FIREABLE(t757) U FIREABLE(t606)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E(NOT FIREABLE(t757) U FIREABLE(t606)))
lola: processed formula length: 42
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 683660 markings, 973295 edges, 136732 markings/sec, 0 secs
lola: 1381294 markings, 1966816 edges, 139527 markings/sec, 5 secs
lola: 2088237 markings, 2973576 edges, 141389 markings/sec, 10 secs
lola: 2777483 markings, 3955163 edges, 137849 markings/sec, 15 secs
lola: 3451954 markings, 4915680 edges, 134894 markings/sec, 20 secs
lola: 4139457 markings, 5894670 edges, 137501 markings/sec, 25 secs
lola: 4832215 markings, 6881360 edges, 138552 markings/sec, 30 secs
lola: 5530129 markings, 7875154 edges, 139583 markings/sec, 35 secs
lola: 6220753 markings, 8858782 edges, 138125 markings/sec, 40 secs
lola: 6912398 markings, 9843726 edges, 138329 markings/sec, 45 secs
lola: 7608253 markings, 10834754 edges, 139171 markings/sec, 50 secs
lola: 8302396 markings, 11823225 edges, 138829 markings/sec, 55 secs
lola: 8994046 markings, 12808188 edges, 138330 markings/sec, 60 secs
lola: 9680463 markings, 13785801 edges, 137283 markings/sec, 65 secs
lola: 10350768 markings, 14740380 edges, 134061 markings/sec, 70 secs
lola: 11010440 markings, 15679842 edges, 131934 markings/sec, 75 secs
lola: 11698100 markings, 16659148 edges, 137532 markings/sec, 80 secs
lola: 12369102 markings, 17614773 edges, 134200 markings/sec, 85 secs
lola: 13055998 markings, 18592974 edges, 137379 markings/sec, 90 secs
lola: 13727550 markings, 19549307 edges, 134310 markings/sec, 95 secs
lola: 14412418 markings, 20524579 edges, 136974 markings/sec, 100 secs
lola: 15087384 markings, 21485897 edges, 134993 markings/sec, 105 secs
lola: 15766021 markings, 22452221 edges, 135727 markings/sec, 110 secs
lola: 16438662 markings, 23410223 edges, 134528 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E ((NOT FIREABLE(t272) R NOT FIREABLE(t208)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E(NOT FIREABLE(t272) R NOT FIREABLE(t208)))
lola: processed formula length: 46
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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 482861 markings, 1170342 edges, 96572 markings/sec, 0 secs
lola: 956636 markings, 2318665 edges, 94755 markings/sec, 5 secs
lola: 1433127 markings, 3473714 edges, 95298 markings/sec, 10 secs
lola: 1922255 markings, 4659401 edges, 97826 markings/sec, 15 secs
lola: 2413332 markings, 5849856 edges, 98215 markings/sec, 20 secs
lola: 2897802 markings, 7024314 edges, 96894 markings/sec, 25 secs
lola: 3347992 markings, 8115618 edges, 90038 markings/sec, 30 secs
lola: 3793533 markings, 9195704 edges, 89108 markings/sec, 35 secs
lola: 4240074 markings, 10278014 edges, 89308 markings/sec, 40 secs
lola: 4691390 markings, 11372189 edges, 90263 markings/sec, 45 secs
lola: 5133143 markings, 12442996 edges, 88351 markings/sec, 50 secs
lola: 5577945 markings, 13521194 edges, 88960 markings/sec, 55 secs
lola: 6040719 markings, 14643204 edges, 92555 markings/sec, 60 secs
lola: 6510970 markings, 15783028 edges, 94050 markings/sec, 65 secs
lola: 6978278 markings, 16915771 edges, 93462 markings/sec, 70 secs
lola: 7442132 markings, 18040294 edges, 92771 markings/sec, 75 secs
lola: 7917761 markings, 19193357 edges, 95126 markings/sec, 80 secs
lola: 8390313 markings, 20338774 edges, 94510 markings/sec, 85 secs
lola: 8857260 markings, 21470743 edges, 93389 markings/sec, 90 secs
lola: 9323347 markings, 22600586 edges, 93217 markings/sec, 95 secs
lola: 9800533 markings, 23757302 edges, 95437 markings/sec, 100 secs
lola: 10286361 markings, 24935016 edges, 97166 markings/sec, 105 secs
lola: 10770964 markings, 26109851 edges, 96921 markings/sec, 110 secs
lola: 11259736 markings, 27294571 edges, 97754 markings/sec, 115 secs
lola: 11744697 markings, 28470229 edges, 96992 markings/sec, 120 secs
lola: 12223650 markings, 29631351 edges, 95791 markings/sec, 125 secs
lola: 12708264 markings, 30805916 edges, 96923 markings/sec, 130 secs
lola: 13190514 markings, 31975003 edges, 96450 markings/sec, 135 secs
lola: 13661716 markings, 33117255 edges, 94240 markings/sec, 140 secs
lola: 14122391 markings, 34233972 edges, 92135 markings/sec, 145 secs
lola: 14545691 markings, 35260137 edges, 84660 markings/sec, 150 secs
lola: 14970788 markings, 36290599 edges, 85019 markings/sec, 155 secs
lola: 15394528 markings, 37317769 edges, 84748 markings/sec, 160 secs
lola: 15849691 markings, 38421107 edges, 91033 markings/sec, 165 secs
lola: 16291479 markings, 39492105 edges, 88358 markings/sec, 170 secs
lola: 16728234 markings, 40550815 edges, 87351 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (NOT FIREABLE(t523))) AND E (G (NOT FIREABLE(t727))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(NOT FIREABLE(t523)) AND EG(NOT FIREABLE(t727))))
lola: processed formula length: 55
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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 665490 markings, 947425 edges, 133098 markings/sec, 0 secs
lola: 1345665 markings, 1916021 edges, 136035 markings/sec, 5 secs
lola: 2022655 markings, 2880247 edges, 135398 markings/sec, 10 secs
lola: 2664932 markings, 3794769 edges, 128455 markings/sec, 15 secs
lola: 3317463 markings, 4724175 edges, 130506 markings/sec, 20 secs
lola: 3958872 markings, 5637631 edges, 128282 markings/sec, 25 secs
lola: 4618614 markings, 6577168 edges, 131948 markings/sec, 30 secs
lola: 5254546 markings, 7482816 edges, 127186 markings/sec, 35 secs
lola: 5895078 markings, 8395040 edges, 128106 markings/sec, 40 secs
lola: 6532868 markings, 9303282 edges, 127558 markings/sec, 45 secs
lola: 7167969 markings, 10207620 edges, 127020 markings/sec, 50 secs
lola: 7802391 markings, 11111201 edges, 126884 markings/sec, 55 secs
lola: 8439302 markings, 12018217 edges, 127382 markings/sec, 60 secs
lola: 9073161 markings, 12920934 edges, 126772 markings/sec, 65 secs
lola: 9711279 markings, 13829752 edges, 127624 markings/sec, 70 secs
lola: 10349178 markings, 14738175 edges, 127580 markings/sec, 75 secs
lola: 10985805 markings, 15644820 edges, 127325 markings/sec, 80 secs
lola: 11624947 markings, 16554957 edges, 127828 markings/sec, 85 secs
lola: 12259173 markings, 17458210 edges, 126845 markings/sec, 90 secs
lola: 12892309 markings, 18359767 edges, 126627 markings/sec, 95 secs
lola: 13523638 markings, 19258864 edges, 126266 markings/sec, 100 secs
lola: 14163284 markings, 20169835 edges, 127929 markings/sec, 105 secs
lola: 14792355 markings, 21065731 edges, 125814 markings/sec, 110 secs
lola: 15412910 markings, 21949411 edges, 124111 markings/sec, 115 secs
lola: 16048754 markings, 22854938 edges, 127169 markings/sec, 120 secs
lola: 16709681 markings, 23796237 edges, 132185 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t771) AND FIREABLE(t15)))) OR (A ((NOT FIREABLE(t357) R NOT FIREABLE(t172))) AND NOT FIREABLE(t647)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t647)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t647)
lola: processed formula length: 18
lola: 47 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: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t357) R NOT FIREABLE(t172)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((NOT FIREABLE(t357) R NOT FIREABLE(t172)))
lola: processed formula length: 45
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 /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: 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(t172)
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 /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t771) AND FIREABLE(t15))))
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(t771) AND FIREABLE(t15))))
lola: processed formula length: 42
lola: 48 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(t771) AND FIREABLE(t15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(t335))) AND (E (G (A (F (FIREABLE(t494))))) OR A (F (FIREABLE(t498)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t335)))
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(t335)))
lola: processed formula length: 22
lola: 48 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(t335)
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: 6 markings, 5 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t498)))
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:787
lola: processed formula: NOT FIREABLE(t498)
lola: processed formula length: 18
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 / 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: FIREABLE(t498)
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 / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown unknown yes unknown no yes yes yes yes unknown yes yes yes no no yes
lola:
preliminary result: unknown unknown yes unknown no yes yes yes yes unknown yes yes yes no no yes
lola: memory consumption: 19276 KB
lola: time consumption: 1113 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

BK_STOP 1552686918226

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0100"
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 JoinFreeModules-PT-0100, 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 r082-csrt-155246550300950"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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