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

About the Execution of LoLA for RobotManipulation-PT-00010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4265.450 919320.00 947114.00 247.30 TTFTTFFTTTTTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r148-ebro-155286403800176.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is RobotManipulation-PT-00010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-ebro-155286403800176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 4.1K Feb 12 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 12 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 8 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 8 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 01:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 1 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 1 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:30 UpperBounds.xml

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

=== Now, execution of the tool begins

BK_START 1552988725066

info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RobotManipulation-PT-00010 @ 3570 seconds

FORMULA RobotManipulation-PT-00010-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00010-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2651
rslt: Output for CTLFireability @ RobotManipulation-PT-00010

{
"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": "Tue Mar 19 09:45:25 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "EX(AF(((FIREABLE(p_intoSC)) OR FIREABLE(p_moved))))",
"processed_size": 52,
"rewrites": 28
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 690,
"markings": 481,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "EX(AF((FIREABLE(p_sop) OR FIREABLE(r_end_move))))",
"processed_size": 50,
"rewrites": 28
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 690,
"markings": 481,
"produced_by": "CTL model checker",
"value": true
},
"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": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 8,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "((FIREABLE(r_begin_move) AND FIREABLE(p_intoSC) AND (FIREABLE(p_intoSC) OR FIREABLE(r_stops))) OR (FIREABLE(p_start) OR (FIREABLE(p_relSC) AND (NOT FIREABLE(r_end_move) OR NOT FIREABLE(p_moved)))))",
"processed_size": 200,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (G (NOT FIREABLE(p_intoSC)))",
"processed_size": 30,
"rewrites": 27
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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(r_starts)",
"processed_size": 22,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "EX(FIREABLE(r_end_move))",
"processed_size": 24,
"rewrites": 27
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "EX((FIREABLE(r_end_move) AND FIREABLE(r_stops) AND FIREABLE(r_stops) AND FIREABLE(r_end_move)))",
"processed_size": 95,
"rewrites": 27
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((NOT FIREABLE(p_start) AND NOT FIREABLE(r_end_move) AND (NOT FIREABLE(p_started) OR NOT FIREABLE(r_starts)))))",
"processed_size": 117,
"rewrites": 27
},
"result":
{
"edges": 21,
"markings": 22,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "EX(AF(FIREABLE(p_intoSC)))",
"processed_size": 26,
"rewrites": 28
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 690,
"markings": 481,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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(p_sop)",
"processed_size": 19,
"rewrites": 29
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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(r_end_move)",
"processed_size": 24,
"rewrites": 30
},
"result":
{
"edges": 50387480,
"markings": 10656360,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "(NOT FIREABLE(p_intoSC) OR NOT FIREABLE(p_sop))",
"processed_size": 48,
"rewrites": 29
},
"result":
{
"edges": 50387480,
"markings": 10656360,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 421
},
"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": 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": "(NOT FIREABLE(p_intoSC) AND NOT FIREABLE(r_end_move))",
"processed_size": 53,
"rewrites": 29
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 481
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E(FIREABLE(r_end_move) U (AF(FIREABLE(p_started)) AND (NOT FIREABLE(p_sop) OR NOT FIREABLE(r_end_move))))",
"processed_size": 106,
"rewrites": 28
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 43,
"markings": 43,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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((FIREABLE(p_relSC) OR FIREABLE(p_intoSC)) U AF((FIREABLE(r_stops) OR FIREABLE(r_end_move))))",
"processed_size": 96,
"rewrites": 28
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 361285,
"markings": 166474,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 674
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 2,
"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": "AG(EF(EG(FIREABLE(p_start))))",
"processed_size": 29,
"rewrites": 29
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 217370097,
"markings": 20030010,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 725
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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": 6,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (((NOT FIREABLE(p_moved) OR FIREABLE(p_relSC) OR FIREABLE(p_sop)) U (FIREABLE(p_started) OR NOT FIREABLE(p_start) OR FIREABLE(p_moved))))",
"processed_size": 143,
"rewrites": 31
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "universal_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 967
},
"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(p_moved)",
"processed_size": 17,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1450
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G (FIREABLE(p_start)))",
"processed_size": 25,
"rewrites": 28
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1450
},
"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": 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 (G ((FIREABLE(p_started) OR FIREABLE(r_stops))))",
"processed_size": 51,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2901
},
"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(p_sop)",
"processed_size": 15,
"rewrites": 30
},
"result":
{
"edges": 127581800,
"markings": 19587527,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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(r_stops)",
"processed_size": 21,
"rewrites": 29
},
"result":
{
"edges": 124,
"markings": 124,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "(FIREABLE(p_intoSC) AND (NOT FIREABLE(p_intoSC) OR NOT FIREABLE(p_started)))",
"processed_size": 77,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"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": 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": "(FIREABLE(r_begin_move) AND FIREABLE(r_end_move))",
"processed_size": 49,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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(p_sop)",
"processed_size": 19,
"rewrites": 29
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"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"
}
},

{
"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(r_stops)",
"processed_size": 21,
"rewrites": 29
},
"result":
{
"edges": 124,
"markings": 124,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "(FIREABLE(p_intoSC) AND (NOT FIREABLE(p_intoSC) OR NOT FIREABLE(p_started)))",
"processed_size": 77,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 15372,
"runtime": 919.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((** U A(F(**)))) : E(X(A(F(**)))) : (** OR (A(G(**)) AND A(G(**)))) : ((A(F(**)) OR (** OR A(F(**)))) AND A(F(**))) : (** OR E(X(A(F(**))))) : (((E(X(**)) AND (A(F(**)) OR **)) OR E(G(*))) AND (E((** U **)) OR (** OR **))) : (E(F(A(G(*)))) OR E(G(**))) : A(G(E(F(E(G(**)))))) : A(F(**)) : E((** U (A(F(**)) AND **))) : A(G(E(F(*)))) : (E(F(**)) AND (E(X(A(F(**)))) OR E(X(**)))) : E(F(E(G(**)))) : A(F(**)) : A((** U **)) : E(F(A(G(**))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "yes yes no yes yes no no yes yes yes yes yes no yes yes no ",
"value": "yes yes no yes yes no no yes yes yes yes yes no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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 (((FIREABLE(p_relSC) OR FIREABLE(p_intoSC)) U A (F ((FIREABLE(r_stops) OR FIREABLE(r_end_move)))))) : E (X (A (F (((FIREABLE(p_intoSC)) OR FIREABLE(p_moved)))))) : (FIREABLE(p_moved) OR A (G ((A (G (FIREABLE(p_start))) AND (FIREABLE(p_start) OR FIREABLE(r_stops) OR FIREABLE(p_moved)))))) : (((A (F (FIREABLE(r_stops))) OR (FIREABLE(r_begin_move) AND FIREABLE(r_end_move))) OR A (F ((NOT FIREABLE(p_intoSC) OR (FIREABLE(p_intoSC) AND FIREABLE(p_started)))))) AND A (F (FIREABLE(p_sop)))) : (FIREABLE(p_intoSC) OR E (X (A (F ((FIREABLE(p_sop) OR FIREABLE(r_end_move))))))) : (((E (X (FIREABLE(r_end_move))) AND (A (F (FIREABLE(r_starts))) OR FIREABLE(r_end_move))) OR NOT(A (F (FIREABLE(p_intoSC))))) AND ((E ((FIREABLE(r_starts) U FIREABLE(p_sop))) OR (FIREABLE(r_begin_move) AND FIREABLE(p_intoSC) AND (FIREABLE(p_intoSC) OR FIREABLE(r_stops)))) OR (FIREABLE(p_start) OR (FIREABLE(p_relSC) AND (NOT FIREABLE(r_end_move) OR NOT FIREABLE(p_moved)))))) : NOT((A (G (E (F (FIREABLE(p_sop))))) AND NOT(E (G ((FIREABLE(p_started) OR FIREABLE(r_stops))))))) : A (G (E (F (E (G (FIREABLE(p_start))))))) : A (((NOT FIREABLE(r_begin_move) OR (FIREABLE(p_moved) AND FIREABLE(r_begin_move)) OR (NOT FIREABLE(p_intoSC) AND (FIREABLE(p_start) OR FIREABLE(r_starts)))) U A (F ((FIREABLE(p_intoSC) OR FIREABLE(r_end_move)))))) : E ((FIREABLE(r_end_move) U (A (F (FIREABLE(p_started))) AND (NOT FIREABLE(p_sop) OR NOT FIREABLE(r_end_move))))) : NOT(E (F (A (G ((FIREABLE(p_intoSC) AND FIREABLE(p_sop))))))) : (E (F ((NOT FIREABLE(p_start) AND NOT FIREABLE(r_end_move) AND (NOT FIREABLE(p_started) OR NOT FIREABLE(r_starts))))) AND (E (X (A (F (FIREABLE(p_intoSC))))) OR E (X ((FIREABLE(r_end_move) AND FIREABLE(r_stops) AND FIREABLE(r_stops) AND FIREABLE(r_end_move)))))) : E (F (E (G ((NOT FIREABLE(p_moved) AND NOT FIREABLE(r_stops)))))) : A ((E (F (NOT FIREABLE(r_begin_move))) U A (F (FIREABLE(p_sop))))) : A (((NOT FIREABLE(p_moved) OR FIREABLE(p_relSC) OR FIREABLE(p_sop)) U (FIREABLE(p_started) OR NOT FIREABLE(p_start) OR FIREABLE(p_moved)))) : E (F (A (G (FIREABLE(r_end_move)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:470
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:470
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 (X (A (F (((FIREABLE(p_intoSC)) OR FIREABLE(p_moved))))))
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(((FIREABLE(p_intoSC)) OR FIREABLE(p_moved))))
lola: processed formula length: 52
lola: 28 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: 481 markings, 690 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(p_intoSC) OR E (X (A (F ((FIREABLE(p_sop) OR FIREABLE(r_end_move)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(p_intoSC)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(p_intoSC)
lola: processed formula length: 18
lola: 26 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((FIREABLE(p_sop) OR FIREABLE(r_end_move))))))
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((FIREABLE(p_sop) OR FIREABLE(r_end_move))))
lola: processed formula length: 50
lola: 28 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: 481 markings, 690 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((E (X (FIREABLE(r_end_move))) AND (A (F (FIREABLE(r_starts))) OR FIREABLE(r_end_move))) OR E (G (NOT FIREABLE(p_intoSC)))) AND (E ((FIREABLE(r_starts) U FIREABLE(p_sop))) OR ((FIREABLE(r_begin_move) AND FIREABLE(p_intoSC) AND (FIREABLE(p_intoSC) OR FIREABLE(r_stops))) OR (FIREABLE(p_start) OR (FIREABLE(p_relSC) AND (NOT FIREABLE(r_end_move) OR NOT FIREABLE(p_moved)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(r_begin_move) AND FIREABLE(p_intoSC) AND (FIREABLE(p_intoSC) OR FIREABLE(r_stops))) OR (FIREABLE(p_start) OR (FIREABLE(p_relSC) AND (NOT FIREABLE(r_end_move) OR NOT FIREABLE(p_moved)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((FIREABLE(r_begin_move) AND FIREABLE(p_intoSC) AND (FIREABLE(p_intoSC) OR FIREABLE(r_stops))) OR (FIREABLE(p_start) OR (FIREABLE(p_relSC) AND (NOT FIREABLE(r_end_move) OR NOT FIREABLE(p_moved)))))
lola: processed formula length: 200
lola: 27 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(r_end_move)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(r_end_move)
lola: processed formula length: 20
lola: 26 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(p_intoSC)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (NOT FIREABLE(p_intoSC)))
lola: processed formula length: 30
lola: 27 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 42 markings, 41 edges
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(p_intoSC)
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(r_starts)))
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(r_starts)
lola: processed formula length: 22
lola: 29 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: SUBRESULT
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(r_starts)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(r_end_move)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(FIREABLE(r_end_move))
lola: processed formula length: 24
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((NOT FIREABLE(p_start) AND NOT FIREABLE(r_end_move) AND (NOT FIREABLE(p_started) OR NOT FIREABLE(r_starts))))) AND (E (X (A (F (FIREABLE(p_intoSC))))) OR E (X ((FIREABLE(r_end_move) AND FIREABLE(r_stops) AND FIREABLE(r_stops) AND FIREABLE(r_end_move))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(r_end_move) AND FIREABLE(r_stops) AND FIREABLE(r_stops) AND FIREABLE(r_end_move))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((FIREABLE(r_end_move) AND FIREABLE(r_stops) AND FIREABLE(r_stops) AND FIREABLE(r_end_move)))
lola: processed formula length: 95
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(p_start) AND NOT FIREABLE(r_end_move) AND (NOT FIREABLE(p_started) OR NOT FIREABLE(r_starts)))))
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(p_start) AND NOT FIREABLE(r_end_move) AND (NOT FIREABLE(p_started) OR NOT FIREABLE(r_starts)))))
lola: processed formula length: 117
lola: 27 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: 22 markings, 21 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(p_start) AND NOT FIREABLE(r_end_move) AND (NOT FIREABLE(p_started) OR NOT FIREABLE(r_starts)))
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (FIREABLE(p_intoSC)))))
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(FIREABLE(p_intoSC)))
lola: processed formula length: 26
lola: 28 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: 481 markings, 690 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(p_sop)))
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(p_sop)
lola: processed formula length: 19
lola: 29 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(p_sop)
lola: The predicate eventually occurs.
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(r_end_move)))))
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(r_end_move)
lola: processed formula length: 24
lola: 30 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(r_end_move)
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-5-0.sara
lola: state equation: calling and running sara
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(r_end_move)
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-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: try reading problem file CTLFireability-5-1.sara.


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1323110 markings, 3739274 edges, 264622 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2339470 markings, 6814719 edges, 203272 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3266189 markings, 9680794 edges, 185344 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4110336 markings, 12327298 edges, 168829 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4984433 markings, 15090106 edges, 174819 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 5888831 markings, 17968196 edges, 180880 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 6827860 markings, 20969328 edges, 187806 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 7803331 markings, 24103647 edges, 195094 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 8597672 markings, 27525564 edges, 158868 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 8823854 markings, 30272020 edges, 45236 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 9040493 markings, 32813030 edges, 43328 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 9252502 markings, 35238838 edges, 42402 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 9460773 markings, 37585956 edges, 41654 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 9663500 markings, 39836918 edges, 40545 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 9858177 markings, 41964258 edges, 38935 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 10046098 markings, 44005034 edges, 37584 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 10233554 markings, 45997260 edges, 37491 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 10438100 markings, 48138043 edges, 40909 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 10656360 markings, 50387480 edges
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((NOT FIREABLE(p_moved) AND NOT FIREABLE(r_stops))))))
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(p_moved) AND NOT FIREABLE(r_stops))
lola: processed formula length: 49
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (NOT FIREABLE(p_moved) AND NOT FIREABLE(r_stops))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation task get result started, id 0
lola: state equation: write sara problem file to CTLFireability-6-1.sara
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: (FIREABLE(p_moved) OR FIREABLE(r_stops))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-1.sara.
sara: try reading problem file CTLFireability-6-0.sara.


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 99069 markings, 269462 edges
lola: ========================================
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((NOT FIREABLE(p_intoSC) OR NOT FIREABLE(p_sop))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (NOT FIREABLE(p_intoSC) OR NOT FIREABLE(p_sop))
lola: processed formula length: 48
lola: 29 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: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(p_intoSC) AND FIREABLE(p_sop))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 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(p_intoSC) OR NOT FIREABLE(p_sop))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.

sara: try reading problem file CTLFireability-7-1.sara.

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1330203 markings, 3689152 edges, 266041 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2400402 markings, 6858433 edges, 214040 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3399450 markings, 9880510 edges, 199810 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4390078 markings, 12935024 edges, 198126 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5352888 markings, 15944357 edges, 192562 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6237340 markings, 18749554 edges, 176890 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7065331 markings, 21406338 edges, 165598 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 7854640 markings, 23962801 edges, 157862 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 8640797 markings, 26514283 edges, 157231 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 9459681 markings, 29179376 edges, 163777 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 10070097 markings, 32301892 edges, 122083 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 10160769 markings, 34444188 edges, 18134 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 10241662 markings, 36519055 edges, 16179 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 10316442 markings, 38576108 edges, 14956 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 10389708 markings, 40737446 edges, 14653 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 10458215 markings, 42921501 edges, 13701 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 10519406 markings, 45010852 edges, 12238 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 10580612 markings, 47234722 edges, 12241 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 10642979 markings, 49727289 edges, 12473 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 10656360 markings, 50387480 edges
lola: ========================================
lola: subprocess 8 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(p_intoSC) OR FIREABLE(r_end_move))))
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(p_intoSC) AND NOT FIREABLE(r_end_move))
lola: processed formula length: 53
lola: 29 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(p_intoSC) OR FIREABLE(r_end_move))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 42 markings, 41 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(r_end_move) U (A (F (FIREABLE(p_started))) AND (NOT FIREABLE(p_sop) OR NOT FIREABLE(r_end_move)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(FIREABLE(r_end_move) U (AF(FIREABLE(p_started)) AND (NOT FIREABLE(p_sop) OR NOT FIREABLE(r_end_move))))
lola: processed formula length: 106
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 43 markings, 43 edges
lola: ========================================
lola: subprocess 10 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(p_relSC) OR FIREABLE(p_intoSC)) U A (F ((FIREABLE(r_stops) OR FIREABLE(r_end_move))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((FIREABLE(p_relSC) OR FIREABLE(p_intoSC)) U AF((FIREABLE(r_stops) OR FIREABLE(r_end_move))))
lola: processed formula length: 96
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 166474 markings, 361285 edges
lola: ========================================
lola: subprocess 11 will run for 674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (E (G (FIREABLE(p_start)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EF(EG(FIREABLE(p_start))))
lola: processed formula length: 29
lola: 29 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: 552822 markings, 3597883 edges, 110564 markings/sec, 0 secs
lola: 1030937 markings, 6869670 edges, 95623 markings/sec, 5 secs
lola: 1502613 markings, 10154874 edges, 94335 markings/sec, 10 secs
lola: 1957773 markings, 13360027 edges, 91032 markings/sec, 15 secs
lola: 2386680 markings, 16401922 edges, 85781 markings/sec, 20 secs
lola: 2806528 markings, 19398089 edges, 83970 markings/sec, 25 secs
lola: 3218240 markings, 22359967 edges, 82342 markings/sec, 30 secs
lola: 3626393 markings, 25298561 edges, 81631 markings/sec, 35 secs
lola: 4030442 markings, 28226061 edges, 80810 markings/sec, 40 secs
lola: 4425104 markings, 31100352 edges, 78932 markings/sec, 45 secs
lola: 4814536 markings, 33940648 edges, 77886 markings/sec, 50 secs
lola: 5205813 markings, 36802207 edges, 78255 markings/sec, 55 secs
lola: 5591734 markings, 39636458 edges, 77184 markings/sec, 60 secs
lola: 5972252 markings, 42431425 edges, 76104 markings/sec, 65 secs
lola: 6345603 markings, 45181913 edges, 74670 markings/sec, 70 secs
lola: 6711284 markings, 47885376 edges, 73136 markings/sec, 75 secs
lola: 7074377 markings, 50577927 edges, 72619 markings/sec, 80 secs
lola: 7440606 markings, 53296817 edges, 73246 markings/sec, 85 secs
lola: 7799783 markings, 55972630 edges, 71835 markings/sec, 90 secs
lola: 8154123 markings, 58614312 edges, 70868 markings/sec, 95 secs
lola: 8504535 markings, 61235969 edges, 70082 markings/sec, 100 secs
lola: 8842254 markings, 63759275 edges, 67544 markings/sec, 105 secs
lola: 9180606 markings, 66292826 edges, 67670 markings/sec, 110 secs
lola: 9516957 markings, 68811836 edges, 67270 markings/sec, 115 secs
lola: 9857110 markings, 71373659 edges, 68031 markings/sec, 120 secs
lola: 10194584 markings, 73915063 edges, 67495 markings/sec, 125 secs
lola: 10527106 markings, 76425905 edges, 66504 markings/sec, 130 secs
lola: 10859420 markings, 78940071 edges, 66463 markings/sec, 135 secs
lola: 11189359 markings, 81437558 edges, 65988 markings/sec, 140 secs
lola: 11511997 markings, 83888107 edges, 64528 markings/sec, 145 secs
lola: 11840871 markings, 86379063 edges, 65775 markings/sec, 150 secs
lola: 12166269 markings, 88851692 edges, 65080 markings/sec, 155 secs
lola: 12496296 markings, 91355702 edges, 66005 markings/sec, 160 secs
lola: 12816418 markings, 93798277 edges, 64024 markings/sec, 165 secs
lola: 13145834 markings, 96307986 edges, 65883 markings/sec, 170 secs
lola: 13472171 markings, 98798034 edges, 65267 markings/sec, 175 secs
lola: 13801318 markings, 101314885 edges, 65829 markings/sec, 180 secs
lola: 14138837 markings, 103898721 edges, 67504 markings/sec, 185 secs
lola: 14475468 markings, 106478740 edges, 67326 markings/sec, 190 secs
lola: 14807414 markings, 109024071 edges, 66389 markings/sec, 195 secs
lola: 15135729 markings, 111551432 edges, 65663 markings/sec, 200 secs
lola: 15459357 markings, 114041834 edges, 64726 markings/sec, 205 secs
lola: 15785056 markings, 116541624 edges, 65140 markings/sec, 210 secs
lola: 16109328 markings, 119033185 edges, 64854 markings/sec, 215 secs
lola: 16433706 markings, 121530344 edges, 64876 markings/sec, 220 secs
lola: 16759217 markings, 124027235 edges, 65102 markings/sec, 225 secs
lola: 17082189 markings, 126510082 edges, 64594 markings/sec, 230 secs
lola: 17403730 markings, 128989172 edges, 64308 markings/sec, 235 secs
lola: 17727611 markings, 131476759 edges, 64776 markings/sec, 240 secs
lola: 18049536 markings, 133953468 edges, 64385 markings/sec, 245 secs
lola: 18378743 markings, 136480049 edges, 65841 markings/sec, 250 secs
lola: 18720020 markings, 139097209 edges, 68255 markings/sec, 255 secs
lola: 19077608 markings, 141826809 edges, 71518 markings/sec, 260 secs
lola: 19452062 markings, 144676497 edges, 74891 markings/sec, 265 secs
lola: 19871062 markings, 147811896 edges, 83800 markings/sec, 270 secs
lola: 19973155 markings, 150546536 edges, 20419 markings/sec, 275 secs
lola: 19980757 markings, 152643125 edges, 1520 markings/sec, 280 secs
lola: 19985749 markings, 154520937 edges, 998 markings/sec, 285 secs
lola: 19989135 markings, 156286116 edges, 677 markings/sec, 290 secs
lola: 19991914 markings, 158029592 edges, 556 markings/sec, 295 secs
lola: 19994542 markings, 159781139 edges, 526 markings/sec, 300 secs
lola: 19996939 markings, 161626659 edges, 479 markings/sec, 305 secs
lola: 19998665 markings, 163204311 edges, 345 markings/sec, 310 secs
lola: 20000548 markings, 164775979 edges, 377 markings/sec, 315 secs
lola: 20002023 markings, 166343866 edges, 295 markings/sec, 320 secs
lola: 20003691 markings, 168141346 edges, 334 markings/sec, 325 secs
lola: 20005039 markings, 169912381 edges, 270 markings/sec, 330 secs
lola: 20006347 markings, 171656735 edges, 262 markings/sec, 335 secs
lola: 20007599 markings, 173391019 edges, 250 markings/sec, 340 secs
lola: 20008812 markings, 175108489 edges, 243 markings/sec, 345 secs
lola: 20009842 markings, 176822654 edges, 206 markings/sec, 350 secs
lola: 20010841 markings, 178531465 edges, 200 markings/sec, 355 secs
lola: 20011842 markings, 180223576 edges, 200 markings/sec, 360 secs
lola: 20012832 markings, 181876053 edges, 198 markings/sec, 365 secs
lola: 20013757 markings, 183545665 edges, 185 markings/sec, 370 secs
lola: 20014652 markings, 185220305 edges, 179 markings/sec, 375 secs
lola: 20015641 markings, 186882833 edges, 198 markings/sec, 380 secs
lola: 20016687 markings, 188551541 edges, 209 markings/sec, 385 secs
lola: 20017593 markings, 190237232 edges, 181 markings/sec, 390 secs
lola: 20018411 markings, 191913840 edges, 164 markings/sec, 395 secs
lola: 20019372 markings, 193596114 edges, 192 markings/sec, 400 secs
lola: 20020032 markings, 195203560 edges, 132 markings/sec, 405 secs
lola: 20020783 markings, 196862799 edges, 150 markings/sec, 410 secs
lola: 20021615 markings, 198549223 edges, 166 markings/sec, 415 secs
lola: 20022311 markings, 200242123 edges, 139 markings/sec, 420 secs
lola: 20023141 markings, 201946707 edges, 166 markings/sec, 425 secs
lola: 20023848 markings, 203670043 edges, 141 markings/sec, 430 secs
lola: 20024544 markings, 205407917 edges, 139 markings/sec, 435 secs
lola: 20025291 markings, 207167586 edges, 149 markings/sec, 440 secs
lola: 20026077 markings, 208932343 edges, 157 markings/sec, 445 secs
lola: 20026813 markings, 210746916 edges, 147 markings/sec, 450 secs
lola: 20027659 markings, 212623384 edges, 169 markings/sec, 455 secs
lola: 20028581 markings, 214600926 edges, 184 markings/sec, 460 secs
lola: 20029702 markings, 216770106 edges, 224 markings/sec, 465 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 20030010 markings, 217370097 edges
lola: ========================================
lola: subprocess 12 will run for 725 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(p_moved) OR FIREABLE(p_relSC) OR FIREABLE(p_sop)) U (FIREABLE(p_started) OR NOT FIREABLE(p_start) OR FIREABLE(p_moved))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((NOT FIREABLE(p_moved) OR FIREABLE(p_relSC) OR FIREABLE(p_sop)) U (FIREABLE(p_started) OR NOT FIREABLE(p_start) OR FIREABLE(p_moved))))
lola: processed formula length: 143
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(p_moved) OR FIREABLE(p_relSC) OR FIREABLE(p_sop))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 21 markings, 20 edges

lola: ========================================
lola: subprocess 13 will run for 967 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(p_moved) OR (A (G (FIREABLE(p_start))) AND A (G ((FIREABLE(p_start) OR FIREABLE(r_stops) OR FIREABLE(p_moved))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 967 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(p_moved)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(p_moved)
lola: processed formula length: 17
lola: 26 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 1450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(p_start)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (FIREABLE(p_start)))
lola: processed formula length: 25
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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(p_start)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (NOT FIREABLE(p_sop))))) OR E (G ((FIREABLE(p_started) OR FIREABLE(r_stops)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(p_started) OR FIREABLE(r_stops))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((FIREABLE(p_started) OR FIREABLE(r_stops))))
lola: processed formula length: 51
lola: 27 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(p_started) AND NOT FIREABLE(r_stops))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
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 15 will run for 2901 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(p_sop)))))
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:788
lola: processed formula: FIREABLE(p_sop)
lola: processed formula length: 15
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(p_sop)
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:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: FIREABLE(p_sop)
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-15-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-15-0.sara
sara: try reading problem file CTLFireability-15-1.sara.

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1104634 markings, 3822378 edges, 220927 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1981857 markings, 7147543 edges, 175445 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2774059 markings, 10246041 edges, 158440 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3497668 markings, 13130720 edges, 144722 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4204482 markings, 15996851 edges, 141363 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4898972 markings, 18839309 edges, 138898 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 5559866 markings, 21573225 edges, 132179 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 6219929 markings, 24336795 edges, 132013 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 6870190 markings, 27070142 edges, 130052 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 7492680 markings, 29701685 edges, 124498 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 8103236 markings, 32302377 edges, 122111 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 8708551 markings, 34898897 edges, 121063 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 9314128 markings, 37505305 edges, 121115 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 9880191 markings, 39953039 edges, 113213 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 10442861 markings, 42403688 edges, 112534 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 10993564 markings, 44797108 edges, 110141 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 11547226 markings, 47212015 edges, 110732 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 12117874 markings, 49709224 edges, 114130 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 12687283 markings, 52212626 edges, 113882 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 13277323 markings, 54796521 edges, 118008 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 13876097 markings, 57423755 edges, 119755 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 14484689 markings, 60093792 edges, 121718 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 15130497 markings, 62897257 edges, 129162 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 15820594 markings, 65829441 edges, 138019 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 16603792 markings, 69359157 edges, 156640 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 16829979 markings, 72150236 edges, 45237 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 17007410 markings, 74651784 edges, 35486 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 17161731 markings, 77022613 edges, 30864 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 17311233 markings, 79328651 edges, 29900 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 17448923 markings, 81582017 edges, 27538 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 17576125 markings, 83789164 edges, 25440 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 17697398 markings, 85979287 edges, 24255 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 17809955 markings, 88143141 edges, 22511 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 17916613 markings, 90273845 edges, 21332 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 18020265 markings, 92413406 edges, 20730 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 18122157 markings, 94544918 edges, 20378 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 18219521 markings, 96686812 edges, 19473 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 18317984 markings, 98836411 edges, 19693 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 18414140 markings, 100997751 edges, 19231 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 18509945 markings, 103171602 edges, 19161 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 18602029 markings, 105362745 edges, 18417 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 18696122 markings, 107570572 edges, 18819 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 18791656 markings, 109814655 edges, 19107 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 18886969 markings, 112100320 edges, 19063 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 18987166 markings, 114430324 edges, 20039 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 19088226 markings, 116815283 edges, 20212 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 19194287 markings, 119273361 edges, 21212 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 19305202 markings, 121830604 edges, 22183 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 19430040 markings, 124542596 edges, 24968 markings/sec, 240 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 19587527 markings, 127581800 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F (FIREABLE(r_stops))) OR ((FIREABLE(r_begin_move) AND FIREABLE(r_end_move)) OR A (F ((NOT FIREABLE(p_intoSC) OR (FIREABLE(p_intoSC) AND FIREABLE(p_started))))))) AND A (F (FIREABLE(p_sop))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(r_begin_move) AND FIREABLE(r_end_move))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(r_begin_move) AND FIREABLE(r_end_move))
lola: processed formula length: 49
lola: 26 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: 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: A (F (FIREABLE(r_stops)))
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(r_stops)
lola: processed formula length: 21
lola: 29 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(r_stops)
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 124 markings, 124 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(p_intoSC) OR (FIREABLE(p_intoSC) AND FIREABLE(p_started)))))
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: (FIREABLE(p_intoSC) AND (NOT FIREABLE(p_intoSC) OR NOT FIREABLE(p_started)))
lola: processed formula length: 77
lola: 29 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: SUBRESULT
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(p_intoSC) OR (FIREABLE(p_intoSC) AND FIREABLE(p_started)))
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (F (FIREABLE(r_stops))) OR ((FIREABLE(r_begin_move) AND FIREABLE(r_end_move)) OR A (F ((NOT FIREABLE(p_intoSC) OR (FIREABLE(p_intoSC) AND FIREABLE(p_started))))))) AND A (F (FIREABLE(p_sop))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (FIREABLE(r_begin_move) AND FIREABLE(r_end_move))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(r_begin_move) AND FIREABLE(r_end_move))
lola: processed formula length: 49
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(p_sop)))
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(p_sop)
lola: processed formula length: 19
lola: 29 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(p_sop)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 42 markings, 41 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(r_stops)))
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(r_stops)
lola: processed formula length: 21
lola: 29 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(r_stops)
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 124 markings, 124 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(p_intoSC) OR (FIREABLE(p_intoSC) AND FIREABLE(p_started)))))
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: (FIREABLE(p_intoSC) AND (NOT FIREABLE(p_intoSC) OR NOT FIREABLE(p_started)))
lola: processed formula length: 77
lola: 29 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
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: lola: SUBRESULT
formula 0: (NOT FIREABLE(p_intoSC) OR (FIREABLE(p_intoSC) AND FIREABLE(p_started)))lola:
result: yes
lola: lola: The Boolean predicate is true.
========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes no no yes yes yes yes yes no yes yes no
lola:
preliminary result: yes yes no yes yes no no yes yes yes yes yes no yes yes no
lola: memory consumption: 15372 KB
lola: time consumption: 919 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

BK_STOP 1552989644386

--------------------
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="RobotManipulation-PT-00010"
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 RobotManipulation-PT-00010, 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 r148-ebro-155286403800176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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