fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r194-csrt-159033389900356
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for TCPcondis-PT-25

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15778.250 3600000.00 2442381.00 11341.40 TFFTTFFFFFT?FTT? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.1K Apr 12 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 11 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 20:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 10 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 24 05:38 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 TCPcondis-PT-25-CTLFireability-00
FORMULA_NAME TCPcondis-PT-25-CTLFireability-01
FORMULA_NAME TCPcondis-PT-25-CTLFireability-02
FORMULA_NAME TCPcondis-PT-25-CTLFireability-03
FORMULA_NAME TCPcondis-PT-25-CTLFireability-04
FORMULA_NAME TCPcondis-PT-25-CTLFireability-05
FORMULA_NAME TCPcondis-PT-25-CTLFireability-06
FORMULA_NAME TCPcondis-PT-25-CTLFireability-07
FORMULA_NAME TCPcondis-PT-25-CTLFireability-08
FORMULA_NAME TCPcondis-PT-25-CTLFireability-09
FORMULA_NAME TCPcondis-PT-25-CTLFireability-10
FORMULA_NAME TCPcondis-PT-25-CTLFireability-11
FORMULA_NAME TCPcondis-PT-25-CTLFireability-12
FORMULA_NAME TCPcondis-PT-25-CTLFireability-13
FORMULA_NAME TCPcondis-PT-25-CTLFireability-14
FORMULA_NAME TCPcondis-PT-25-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591216571415

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:36:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:36:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:36:13] [WARNING] Skipping unknown tool specific annotation : Tina
[2020-06-03 20:36:13] [WARNING] Unknown XML tag in source file: size
[2020-06-03 20:36:13] [WARNING] Unknown XML tag in source file: color
[2020-06-03 20:36:13] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-06-03 20:36:13] [INFO ] Transformed 30 places.
[2020-06-03 20:36:13] [INFO ] Transformed 32 transitions.
[2020-06-03 20:36:13] [INFO ] Parsed PT model containing 30 places and 32 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Finished random walk after 10274 steps, including 0 resets, run visited all 39 properties in 16 ms. (steps per millisecond=642 )
[2020-06-03 20:36:13] [INFO ] Flatten gal took : 51 ms
[2020-06-03 20:36:13] [INFO ] Flatten gal took : 7 ms
[2020-06-03 20:36:13] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-03 20:36:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ TCPcondis-PT-25 @ 3570 seconds

FORMULA TCPcondis-PT-25-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-25-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1165
rslt: Output for CTLFireability @ TCPcondis-PT-25

{
"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": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:36:14 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p4) AND (1 <= p18)) OR (1 <= p18))",
"processed_size": 43,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((1 <= p5) AND (1 <= p23)) OR (1 <= p0)) AND (((1 <= p7) AND (1 <= p19)) OR (1 <= p15)))",
"processed_size": 92,
"rewrites": 51
},
"result":
{
"edges": 61,
"markings": 61,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG(AX(((1 <= p0) OR ((1 <= p11) AND (1 <= p27)))))",
"processed_size": 51,
"rewrites": 50
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 218,
"markings": 218,
"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": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p13) AND (1 <= p25) AND (1 <= p26))))",
"processed_size": 50,
"rewrites": 49
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p6) AND (1 <= p19))",
"processed_size": 26,
"rewrites": 48
},
"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": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p5) AND (1 <= p21) AND (1 <= p9) AND (1 <= p25))",
"processed_size": 55,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p10 <= 0) OR (p24 <= 0))",
"processed_size": 27,
"rewrites": 51
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"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": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (((1 <= p15) R (1 <= p14)))",
"processed_size": 29,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "existential_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AG(EX((1 <= p15)))",
"processed_size": 18,
"rewrites": 50
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 49,
"markings": 50,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF((AX(((1 <= p8) AND (1 <= p20))) AND E((1 <= p18) U ((1 <= p4) AND (1 <= p18)))))",
"processed_size": 83,
"rewrites": 51
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 231,
"markings": 231,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 327
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(EX(EF(((1 <= p5) AND (1 <= p23)))))",
"processed_size": 38,
"rewrites": 51
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 7385,
"markings": 3562,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((EX(((p4 <= 0) OR (p18 <= 0))) OR AX(((p5 <= 0) OR (p21 <= 0)))))",
"processed_size": 70,
"rewrites": 51
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 231,
"markings": 231,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p6 <= 0) OR (p20 <= 0))",
"processed_size": 26,
"rewrites": 51
},
"result":
{
"edges": 333,
"markings": 333,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 477
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A(((p0 <= 0) OR ((1 <= p3) AND (1 <= p19))) U EG((1 <= p15)))",
"processed_size": 62,
"rewrites": 50
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 459,
"markings": 458,
"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": 572
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EG(((EG(((1 <= p13) AND (1 <= p25) AND (1 <= p26))) OR AF((1 <= p9))) AND ((p16 <= 0) OR ((1 <= p10) AND (1 <= p11) AND (1 <= p28) AND ((1 <= p18) OR ((1 <= p6) AND (1 <= p19)))))))",
"processed_size": 183,
"rewrites": 51
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 67,
"markings": 65,
"produced_by": "CTL model checker",
"value": false
},
"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": 715
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 715
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p10 <= 0) OR (p11 <= 0) OR (p28 <= 0))",
"processed_size": 42,
"rewrites": 51
},
"result":
{
"edges": 64,
"markings": 64,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 954
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((1 <= p15)))",
"processed_size": 18,
"rewrites": 49
},
"result":
{
"edges": 120,
"markings": 120,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"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": 1431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E ((((p14 <= 0) OR (p6 <= 0) OR (p19 <= 0)) U (p15 <= 0)))",
"processed_size": 60,
"rewrites": 51
},
"result":
{
"edges": 48,
"markings": 49,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p14) AND (1 <= p6) AND (1 <= p20))",
"processed_size": 41,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((p10 <= 0) OR (p11 <= 0) OR (p28 <= 0)) AND ((p9 <= 0) OR (p25 <= 0))) OR (1 <= p3))",
"processed_size": 91,
"rewrites": 51
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"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": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p14 <= 0)))",
"processed_size": 18,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p14) AND (1 <= p6) AND (1 <= p20))",
"processed_size": 41,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((p24 <= 0)))",
"processed_size": 18,
"rewrites": 49
},
"result":
{
"edges": 163,
"markings": 163,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p8 <= 0) OR (p20 <= 0))))",
"processed_size": 34,
"rewrites": 50
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((p4 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p19 <= 0)))))",
"processed_size": 67,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG(((p9 <= 0) OR (p25 <= 0))))",
"processed_size": 34,
"rewrites": 50
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 66,
"markings": 65,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3644,
"runtime": 2405.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((** U E(G(**)))) : (A(F(*)) AND (A(F(**)) OR E(G(E(X(**)))))) : A(F(**)) : (E(G(A(X(**)))) AND (** OR A((* R *)))) : (E((** U **)) AND (E(G(**)) OR **)) : E(G(((E(G(**)) OR A(F(**))) AND **))) : (A(F(**)) OR ((** AND (E(X(**)) OR E(F(**)))) OR (A((** U **)) AND (** AND (** AND (** AND **)))))) : (E(F(**)) AND A(F(**))) : (A(G(E(X(**)))) OR E((* R *))) : (E(G(*)) AND ((E(F(*)) OR A(F(*))) AND (A(G(*)) OR **))) : (A(F(E(G(*)))) OR (E(F(*)) AND A(F(**)))) : (E((** U A(X(**)))) OR (E(X(A(F(**)))) OR E(X(**)))) : A(F((A(X(**)) AND E((** U **))))) : E(X(E(X(E(F(**)))))) : E(G((E(X(*)) OR A(X(*))))) : E(X(A(F(E(X(**))))))"
},
"net":
{
"arcs": 108,
"conflict_clusters": 10,
"places": 30,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "yes no no yes yes no no no no no yes unknown no yes yes unknown ",
"value": "yes no no yes yes no no no no no yes unknown no yes yes unknown "
},
"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: 62/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 32 transitions, 21 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: A ((((p0 <= 0) OR ((1 <= p3) AND (1 <= p19))) U E (G ((1 <= p15))))) : (NOT(E (G (((((1 <= p5) AND (1 <= p23)) OR (1 <= p0)) AND (((1 <= p7) AND (1 <= p19)) OR (1 <= p15)))))) AND (A (F ((((p4 <= 0) OR (p18 <= 0)) AND (p18 <= 0)))) OR E (G (E (X ((1 <= p29))))))) : A (F (((1 <= p6) AND (1 <= p20)))) : (E (G (A (X (((1 <= p0) OR ((1 <= p11) AND (1 <= p27))))))) AND ((p18 <= 0) OR NOT(E ((((1 <= p4) AND (1 <= p21)) U (1 <= p0)))))) : (E ((((p14 <= 0) OR (p6 <= 0) OR (p19 <= 0)) U (p15 <= 0))) AND (E (G ((1 <= p15))) OR ((p15 <= 0) AND (p16 <= 0) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p11 <= 0) OR (p28 <= 0)) AND ((p24 <= 0) OR (p10 <= 0) OR (p28 <= 0) OR ((1 <= p4) AND (1 <= p18)))))) : E (G (((E (G (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) OR A (F ((1 <= p9)))) AND ((p16 <= 0) OR ((1 <= p10) AND (1 <= p11) AND (1 <= p28) AND ((1 <= p18) OR ((1 <= p6) AND (1 <= p19)))))))) : ((A (F (((1 <= p10) AND (1 <= p24)))) OR (((1 <= p6) AND (1 <= p19)) AND (E (X ((1 <= p18))) OR E (F (((1 <= p13) AND (1 <= p25) AND (1 <= p26))))))) OR ((((A (((1 <= p0) U ((1 <= p3) AND (1 <= p19)))) AND (1 <= p5)) AND (1 <= p21)) AND (1 <= p9)) AND (1 <= p25))) : (E (F (((1 <= p10) AND (1 <= p11) AND (1 <= p28) AND ((p4 <= 0) OR (p21 <= 0) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)))))) AND A (F (((1 <= p10) AND (1 <= p11) AND (1 <= p28))))) : (A (G (E (X ((1 <= p15))))) OR NOT(A (((p15 <= 0) U (p14 <= 0))))) : ((NOT(A (F ((1 <= p24)))) AND (NOT(A (G ((1 <= p14)))) OR NOT(E (G (((1 <= p10) AND (1 <= p11) AND (1 <= p28))))))) AND (NOT(E (F (((1 <= p8) AND (1 <= p20))))) OR ((1 <= p14) AND (1 <= p6) AND (1 <= p20)))) : (NOT(E (G (A (F (((1 <= p9) AND (1 <= p25))))))) OR (NOT(A (G ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p19)))))) AND A (F (((((1 <= p10) AND (1 <= p11) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p25))) AND (p3 <= 0)))))) : (E (((((1 <= p3) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p21))) U A (X (((1 <= p9) AND (1 <= p25)))))) OR E (X ((A (F (((1 <= p4) AND (1 <= p22)))) OR ((1 <= p6) AND (1 <= p20)))))) : A (F ((A (X (((1 <= p8) AND (1 <= p20)))) AND E (((1 <= p18) U ((1 <= p4) AND (1 <= p18))))))) : E (F (E (X (E (X (((1 <= p5) AND (1 <= p23)))))))) : E (G ((NOT(A (X (((1 <= p4) AND (1 <= p18))))) OR NOT(E (X (((1 <= p5) AND (1 <= p21)))))))) : E (X (A (F (E (X (((1 <= p8) AND (1 <= p20))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((((p5 <= 0) OR (p23 <= 0)) AND (p0 <= 0)) OR (((p7 <= 0) OR (p19 <= 0)) AND (p15 <= 0))))) AND (A (F ((((p4 <= 0) OR (p18 <= 0)) AND (p18 <= 0)))) OR E (G (E (X ((1 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p4 <= 0) OR (p18 <= 0)) AND (p18 <= 0))))
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: (((1 <= p4) AND (1 <= p18)) OR (1 <= p18))
lola: processed formula length: 43
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
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: The predicate eventually occurs.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p4 <= 0) OR (p18 <= 0)) AND (p18 <= 0))
lola: state equation task get result unparse finished id 0
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((p5 <= 0) OR (p23 <= 0)) AND (p0 <= 0)) OR (((p7 <= 0) OR (p19 <= 0)) AND (p15 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((((1 <= p5) AND (1 <= p23)) OR (1 <= p0)) AND (((1 <= p7) AND (1 <= p19)) OR (1 <= p15)))
lola: processed formula length: 92
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 61 markings, 61 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((p5 <= 0) OR (p23 <= 0)) AND (p0 <= 0)) OR (((p7 <= 0) OR (p19 <= 0)) AND (p15 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X (((1 <= p0) OR ((1 <= p11) AND (1 <= p27))))))) AND ((p18 <= 0) OR A ((((p4 <= 0) OR (p21 <= 0)) R (p0 <= 0)))))
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: (p18 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 <= 0)
lola: processed formula length: 10
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((1 <= p0) OR ((1 <= p11) AND (1 <= p27)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(((1 <= p0) OR ((1 <= p11) AND (1 <= p27)))))
lola: processed formula length: 51
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 218 markings, 218 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: (A (F (((1 <= p10) AND (1 <= p24)))) OR ((((1 <= p6) AND (1 <= p19)) AND (E (X ((1 <= p18))) OR E (F (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))))) OR (A (((1 <= p0) U ((1 <= p3) AND (1 <= p19)))) AND ((1 <= p5) AND ((1 <= p21) AND ((1 <= p9) AND (1 <= p25)))))))
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: E (F (((1 <= p13) AND (1 <= p25) AND (1 <= p26))))
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 (((1 <= p13) AND (1 <= p25) AND (1 <= p26))))
lola: processed formula length: 50
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is reachable.
lola: formula 0: ((1 <= p13) AND (1 <= p25) AND (1 <= p26))
lola: state equation task get result unparse finished id 0
lola: 4 markings, 3 edges
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) AND (1 <= p19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) AND (1 <= p19))
lola: processed formula length: 26
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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: ((1 <= p5) AND ((1 <= p21) AND ((1 <= p9) AND (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p5) AND (1 <= p21) AND (1 <= p9) AND (1 <= p25))
lola: processed formula length: 55
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p10) AND (1 <= p24))))
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: ((p10 <= 0) OR (p24 <= 0))
lola: processed formula length: 27
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: 63 markings, 63 edges
lola: formula 0: ((1 <= p10) AND (1 <= p24))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
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: (A (G (E (X ((1 <= p15))))) OR E (((1 <= p15) R (1 <= p14))))
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 (((1 <= p15) R (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((1 <= p15) R (1 <= p14)))
lola: processed formula length: 29
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((1 <= p15)))
lola: processed formula length: 18
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 50 markings, 49 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((1 <= p3) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p21))) U A (X (((1 <= p9) AND (1 <= p25)))))) OR (E (X (A (F (((1 <= p4) AND (1 <= p22)))))) OR E (X (((1 <= p6) AND (1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: (E((((1 <= p3) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p21))) U AX(((1 <= p9) AND (1 <= p25)))) OR (EX(AF(((1 <= p4) AND (1 <= p22)))) OR EX(((1 <= p6) AND (1 <= p20)))))
lola: processed formula length: 171
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1855824 markings, 6484326 edges, 371165 markings/sec, 0 secs
lola: 3706680 markings, 13332218 edges, 370171 markings/sec, 5 secs
lola: 5554841 markings, 20207131 edges, 369632 markings/sec, 10 secs
lola: 7347247 markings, 27082765 edges, 358481 markings/sec, 15 secs
lola: 9149729 markings, 33837676 edges, 360496 markings/sec, 20 secs
lola: 10823184 markings, 40440726 edges, 334691 markings/sec, 25 secs
lola: 12327247 markings, 46229904 edges, 300813 markings/sec, 30 secs
lola: 13941722 markings, 52300932 edges, 322895 markings/sec, 35 secs
lola: 15521225 markings, 58523570 edges, 315901 markings/sec, 40 secs
lola: 17030160 markings, 64523573 edges, 301787 markings/sec, 45 secs
lola: 18312919 markings, 69840637 edges, 256552 markings/sec, 50 secs
lola: 19823182 markings, 75476092 edges, 302053 markings/sec, 55 secs
lola: 21441508 markings, 81710036 edges, 323665 markings/sec, 60 secs
lola: 23118518 markings, 88101752 edges, 335402 markings/sec, 65 secs
lola: 24481625 markings, 93534423 edges, 272621 markings/sec, 70 secs
lola: 25867384 markings, 99097132 edges, 277152 markings/sec, 75 secs
lola: 27207441 markings, 104584006 edges, 268011 markings/sec, 80 secs
lola: 28586904 markings, 110197996 edges, 275893 markings/sec, 85 secs
lola: 29924192 markings, 115712525 edges, 267458 markings/sec, 90 secs
lola: 31472763 markings, 121487201 edges, 309714 markings/sec, 95 secs
lola: 32862278 markings, 127013594 edges, 277903 markings/sec, 100 secs
lola: 34435204 markings, 132921716 edges, 314585 markings/sec, 105 secs
lola: 36034054 markings, 139179370 edges, 319770 markings/sec, 110 secs
lola: 37468432 markings, 144929410 edges, 286876 markings/sec, 115 secs
lola: 38773311 markings, 150315297 edges, 260976 markings/sec, 120 secs
lola: 40185527 markings, 155950122 edges, 282443 markings/sec, 125 secs
lola: 41403915 markings, 161146758 edges, 243678 markings/sec, 130 secs
lola: 42757271 markings, 166557201 edges, 270671 markings/sec, 135 secs
lola: 44018780 markings, 171742224 edges, 252302 markings/sec, 140 secs
lola: 45204351 markings, 176964112 edges, 237114 markings/sec, 145 secs
lola: 46748912 markings, 182901411 edges, 308912 markings/sec, 150 secs
lola: 48369251 markings, 189032918 edges, 324068 markings/sec, 155 secs
lola: 49841222 markings, 194742220 edges, 294394 markings/sec, 160 secs
lola: 51257884 markings, 200409727 edges, 283332 markings/sec, 165 secs
lola: 52810031 markings, 206317836 edges, 310429 markings/sec, 170 secs
lola: 54241012 markings, 211953777 edges, 286196 markings/sec, 175 secs
lola: 55711800 markings, 217860073 edges, 294158 markings/sec, 180 secs
lola: 57053271 markings, 223426039 edges, 268294 markings/sec, 185 secs
lola: 58537710 markings, 229363768 edges, 296888 markings/sec, 190 secs
lola: 59827883 markings, 234865401 edges, 258035 markings/sec, 195 secs
lola: 61299251 markings, 240730187 edges, 294274 markings/sec, 200 secs
lola: 62603305 markings, 246159358 edges, 260811 markings/sec, 205 secs
lola: 63934099 markings, 251915290 edges, 266159 markings/sec, 210 secs
lola: 65296774 markings, 257367536 edges, 272535 markings/sec, 215 secs
lola: 66630984 markings, 262891036 edges, 266842 markings/sec, 220 secs
lola: 67903257 markings, 268255267 edges, 254455 markings/sec, 225 secs
lola: 69138448 markings, 273702240 edges, 247038 markings/sec, 230 secs
lola: 70705803 markings, 279770275 edges, 313471 markings/sec, 235 secs
lola: 72207417 markings, 285464515 edges, 300323 markings/sec, 240 secs
lola: 73637850 markings, 291016830 edges, 286087 markings/sec, 245 secs
lola: 75094089 markings, 296697174 edges, 291248 markings/sec, 250 secs
lola: 76514628 markings, 302665335 edges, 284108 markings/sec, 255 secs
lola: 78091569 markings, 308617441 edges, 315388 markings/sec, 260 secs
lola: 79698028 markings, 314866168 edges, 321292 markings/sec, 265 secs
lola: 81238449 markings, 321049124 edges, 308084 markings/sec, 270 secs
lola: 82665269 markings, 326859755 edges, 285364 markings/sec, 275 secs
lola: 84107627 markings, 332615464 edges, 288472 markings/sec, 280 secs
lola: 85409627 markings, 338170321 edges, 260400 markings/sec, 285 secs
lola: 86816512 markings, 343781195 edges, 281377 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown yes unknown unknown no unknown no unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6523068 KB
lola: time consumption: 300 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X (((1 <= p8) AND (1 <= p20)))) AND E (((1 <= p18) U ((1 <= p4) AND (1 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AX(((1 <= p8) AND (1 <= p20))) AND E((1 <= p18) U ((1 <= p4) AND (1 <= p18)))))
lola: processed formula length: 83
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 231 markings, 231 edges
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (E (F (((1 <= p5) AND (1 <= p23))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX(EF(((1 <= p5) AND (1 <= p23)))))
lola: processed formula length: 38
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 3562 markings, 7385 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X (((p4 <= 0) OR (p18 <= 0)))) OR A (X (((p5 <= 0) OR (p21 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EX(((p4 <= 0) OR (p18 <= 0))) OR AX(((p5 <= 0) OR (p21 <= 0)))))
lola: processed formula length: 70
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 231 markings, 231 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (E (X (((1 <= p8) AND (1 <= p20))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(EX(((1 <= p8) AND (1 <= p20)))))
lola: processed formula length: 38
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1424835 markings, 3548613 edges, 284967 markings/sec, 0 secs
lola: 2833325 markings, 7278023 edges, 281698 markings/sec, 5 secs
lola: 4056611 markings, 10522847 edges, 244657 markings/sec, 10 secs
lola: 5379098 markings, 14201358 edges, 264497 markings/sec, 15 secs
lola: 6734920 markings, 17821323 edges, 271164 markings/sec, 20 secs
lola: 8004876 markings, 21179685 edges, 253991 markings/sec, 25 secs
lola: 9194863 markings, 24449698 edges, 237997 markings/sec, 30 secs
lola: 10451959 markings, 28037373 edges, 251419 markings/sec, 35 secs
lola: 11709611 markings, 31590260 edges, 251530 markings/sec, 40 secs
lola: 12769593 markings, 34618946 edges, 211996 markings/sec, 45 secs
lola: 13960609 markings, 37964259 edges, 238203 markings/sec, 50 secs
lola: 15206054 markings, 41189861 edges, 249089 markings/sec, 55 secs
lola: 16424045 markings, 44467219 edges, 243598 markings/sec, 60 secs
lola: 17609330 markings, 47724455 edges, 237057 markings/sec, 65 secs
lola: 18783646 markings, 51021653 edges, 234863 markings/sec, 70 secs
lola: 19949842 markings, 54327051 edges, 233239 markings/sec, 75 secs
lola: 21164337 markings, 57856521 edges, 242899 markings/sec, 80 secs
lola: 22459395 markings, 61523609 edges, 259012 markings/sec, 85 secs
lola: 23692408 markings, 65037540 edges, 246603 markings/sec, 90 secs
lola: 24806731 markings, 68292332 edges, 222865 markings/sec, 95 secs
lola: 25995339 markings, 71697025 edges, 237722 markings/sec, 100 secs
lola: 27004616 markings, 74669731 edges, 201855 markings/sec, 105 secs
lola: 28021288 markings, 77704783 edges, 203334 markings/sec, 110 secs
lola: 29099137 markings, 81029457 edges, 215570 markings/sec, 115 secs
lola: 30421959 markings, 84322012 edges, 264564 markings/sec, 120 secs
lola: 31601055 markings, 87468013 edges, 235819 markings/sec, 125 secs
lola: 32768277 markings, 90654810 edges, 233444 markings/sec, 130 secs
lola: 33860196 markings, 93679085 edges, 218384 markings/sec, 135 secs
lola: 34994968 markings, 96806384 edges, 226954 markings/sec, 140 secs
lola: 36052526 markings, 99754320 edges, 211512 markings/sec, 145 secs
lola: 37290185 markings, 103277541 edges, 247532 markings/sec, 150 secs
lola: 38399790 markings, 106356515 edges, 221921 markings/sec, 155 secs
lola: 39598183 markings, 109883810 edges, 239679 markings/sec, 160 secs
lola: 40643888 markings, 112753011 edges, 209141 markings/sec, 165 secs
lola: 41654296 markings, 115695981 edges, 202082 markings/sec, 170 secs
lola: 42762586 markings, 118890467 edges, 221658 markings/sec, 175 secs
lola: 43855856 markings, 122234758 edges, 218654 markings/sec, 180 secs
lola: 45064604 markings, 125821492 edges, 241750 markings/sec, 185 secs
lola: 46203742 markings, 129042090 edges, 227828 markings/sec, 190 secs
lola: 47401521 markings, 132482807 edges, 239556 markings/sec, 195 secs
lola: 48559009 markings, 135828492 edges, 231498 markings/sec, 200 secs
lola: 49665596 markings, 139017203 edges, 221317 markings/sec, 205 secs
lola: 50748110 markings, 142273269 edges, 216503 markings/sec, 210 secs
lola: 51834849 markings, 145577728 edges, 217348 markings/sec, 215 secs
lola: 53032029 markings, 149002951 edges, 239436 markings/sec, 220 secs
lola: 54097515 markings, 152084740 edges, 213097 markings/sec, 225 secs
lola: 55171624 markings, 155284398 edges, 214822 markings/sec, 230 secs
lola: 56279980 markings, 158642787 edges, 221671 markings/sec, 235 secs
lola: 57323133 markings, 161896848 edges, 208631 markings/sec, 240 secs
lola: 58362059 markings, 165030015 edges, 207785 markings/sec, 245 secs
lola: 59629790 markings, 168800568 edges, 253546 markings/sec, 250 secs
lola: 60990862 markings, 172256697 edges, 272214 markings/sec, 255 secs
lola: 62243928 markings, 175614221 edges, 250613 markings/sec, 260 secs
lola: 63528008 markings, 179193218 edges, 256816 markings/sec, 265 secs
lola: 64776929 markings, 182542757 edges, 249784 markings/sec, 270 secs
lola: 65995185 markings, 185993505 edges, 243651 markings/sec, 275 secs
lola: 67216195 markings, 189445949 edges, 244202 markings/sec, 280 secs
lola: 68299787 markings, 192398231 edges, 216718 markings/sec, 285 secs
lola: 69387140 markings, 195487860 edges, 217471 markings/sec, 290 secs
lola: 70601798 markings, 199095311 edges, 242932 markings/sec, 295 secs
lola: 71727291 markings, 202161686 edges, 225099 markings/sec, 300 secs
lola: 72764573 markings, 205083353 edges, 207456 markings/sec, 305 secs
lola: 73846253 markings, 208194250 edges, 216336 markings/sec, 310 secs
lola: 74990300 markings, 211650655 edges, 228809 markings/sec, 315 secs
lola: 76143596 markings, 214842509 edges, 230659 markings/sec, 320 secs
lola: 77172867 markings, 217736885 edges, 205854 markings/sec, 325 secs
lola: 78174181 markings, 220630583 edges, 200263 markings/sec, 330 secs
lola: 79223648 markings, 223788973 edges, 209893 markings/sec, 335 secs
lola: 80399680 markings, 227180493 edges, 235206 markings/sec, 340 secs
lola: 81413118 markings, 230039986 edges, 202688 markings/sec, 345 secs
lola: 82425667 markings, 232966119 edges, 202510 markings/sec, 350 secs
lola: 83406425 markings, 235888377 edges, 196152 markings/sec, 355 secs
lola: 84625040 markings, 239483709 edges, 243723 markings/sec, 360 secs
lola: 85726786 markings, 242712298 edges, 220349 markings/sec, 365 secs
lola: 86885065 markings, 246374405 edges, 231656 markings/sec, 370 secs
lola: 88180881 markings, 250394693 edges, 259163 markings/sec, 375 secs
lola: 89460922 markings, 254036218 edges, 256008 markings/sec, 380 secs
lola: 90610969 markings, 257275927 edges, 230009 markings/sec, 385 secs
lola: 91839184 markings, 260882292 edges, 245643 markings/sec, 390 secs
lola: 92950084 markings, 264061057 edges, 222180 markings/sec, 395 secs
lola: 93956655 markings, 267040640 edges, 201314 markings/sec, 400 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown yes unknown unknown no unknown no unknown unknown unknown no yes yes unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p6) AND (1 <= p20))))
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: ((p6 <= 0) OR (p20 <= 0))
lola: processed formula length: 26
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p20))
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: 333 markings, 333 edges
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: ========================================
lola: subprocess 10 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p0 <= 0) OR ((1 <= p3) AND (1 <= p19))) U E (G ((1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((p0 <= 0) OR ((1 <= p3) AND (1 <= p19))) U EG((1 <= p15)))
lola: processed formula length: 62
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 458 markings, 459 edges
lola: ========================================
lola: subprocess 11 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((E (G (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) OR A (F ((1 <= p9)))) AND ((p16 <= 0) OR ((1 <= p10) AND (1 <= p11) AND (1 <= p28) AND ((1 <= p18) OR ((1 <= p6) AND (1 <= p19))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(((EG(((1 <= p13) AND (1 <= p25) AND (1 <= p26))) OR AF((1 <= p9))) AND ((p16 <= 0) OR ((1 <= p10) AND (1 <= p11) AND (1 <= p28) AND ((1 <= p18) OR ((1 <= p6) AND (1 <= p19)))))))
lola: processed formula length: 183
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 65 markings, 67 edges
lola: ========================================
lola: subprocess 12 will run for 715 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p10) AND (1 <= p11) AND (1 <= p28) AND ((p4 <= 0) OR (p21 <= 0) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)))))) AND A (F (((1 <= p10) AND (1 <= p11) AND (1 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 715 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p10) AND (1 <= p11) AND (1 <= p28))))
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: ((p10 <= 0) OR (p11 <= 0) OR (p28 <= 0))
lola: processed formula length: 42
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p10) AND (1 <= p11) AND (1 <= p28))
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: write sara problem file to CTLFireability-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 64 markings, 64 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 954 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p14 <= 0) OR (p6 <= 0) OR (p19 <= 0)) U (p15 <= 0))) AND (E (G ((1 <= p15))) OR ((p15 <= 0) AND (p16 <= 0) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p11 <= 0) OR (p28 <= 0)) AND ((p24 <= 0) OR (p10 <= 0) OR (p28 <= 0) OR ((1 <= p4) AND (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 954 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p15)))
lola: processed formula length: 18
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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 is possibly preserved.
lola: 120 markings, 120 edges
lola: ========================================
lola: subprocess 14 will run for 1431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p14 <= 0) OR (p6 <= 0) OR (p19 <= 0)) U (p15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p14 <= 0) OR (p6 <= 0) OR (p19 <= 0)) U (p15 <= 0)))
lola: processed formula length: 60
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p15 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 49 markings, 48 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p24 <= 0))) AND ((E (F ((p14 <= 0))) OR A (F (((p10 <= 0) OR (p11 <= 0) OR (p28 <= 0))))) AND (A (G (((p8 <= 0) OR (p20 <= 0)))) OR ((1 <= p14) AND (1 <= p6) AND (1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p14) AND (1 <= p6) AND (1 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p14) AND (1 <= p6) AND (1 <= p20))
lola: processed formula length: 41
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 15 will run for 2862 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p24 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p24 <= 0)))
lola: processed formula length: 18
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p24)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 163 markings, 163 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p14 <= 0)))
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 ((p14 <= 0)))
lola: processed formula length: 18
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (p14 <= 0)
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2862 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (((p9 <= 0) OR (p25 <= 0)))))) OR (E (F ((((p4 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p19 <= 0))))) AND A (F (((((1 <= p10) AND (1 <= p11) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p25))) AND (p3 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2862 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p4 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p19 <= 0)))))
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 ((((p4 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p19 <= 0)))))
lola: processed formula length: 67
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p4 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p19 <= 0)))
lola: The predicate is reachable.
lola: state equation task get result unparse finished id 0
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
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 (((((1 <= p10) AND (1 <= p11) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p25))) AND (p3 <= 0))))
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: ((((p10 <= 0) OR (p11 <= 0) OR (p28 <= 0)) AND ((p9 <= 0) OR (p25 <= 0))) OR (1 <= p3))
lola: processed formula length: 91
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 63 markings, 63 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (((((1 <= p3) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p21))) U A (X (((1 <= p9) AND (1 <= p25)))))) OR (E (X (A (F (((1 <= p4) AND (1 <= p22)))))) OR E (X (((1 <= p6) AND (1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: (E((((1 <= p3) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p21))) U AX(((1 <= p9) AND (1 <= p25)))) OR (EX(AF(((1 <= p4) AND (1 <= p22)))) OR EX(((1 <= p6) AND (1 <= p20)))))
lola: processed formula length: 171
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1921800 markings, 6727633 edges, 384360 markings/sec, 0 secs
lola: 3578532 markings, 12839548 edges, 331346 markings/sec, 5 secs
lola: 5329884 markings, 19331824 edges, 350270 markings/sec, 10 secs
lola: 6913651 markings, 25551223 edges, 316753 markings/sec, 15 secs
lola: 8574922 markings, 31650677 edges, 332254 markings/sec, 20 secs
lola: 10073679 markings, 37517090 edges, 299751 markings/sec, 25 secs
lola: 11513960 markings, 43300420 edges, 288056 markings/sec, 30 secs
lola: 13155803 markings, 49406134 edges, 328369 markings/sec, 35 secs
lola: 14817831 markings, 55692451 edges, 332406 markings/sec, 40 secs
lola: 16361979 markings, 61829483 edges, 308830 markings/sec, 45 secs
lola: 17858973 markings, 67843749 edges, 299399 markings/sec, 50 secs
lola: 19430190 markings, 74012170 edges, 314243 markings/sec, 55 secs
lola: 21048090 markings, 80265987 edges, 323580 markings/sec, 60 secs
lola: 22666271 markings, 86376184 edges, 323636 markings/sec, 65 secs
lola: 24162048 markings, 92243769 edges, 299155 markings/sec, 70 secs
lola: 25606809 markings, 98040050 edges, 288952 markings/sec, 75 secs
lola: 26921167 markings, 103479754 edges, 262872 markings/sec, 80 secs
lola: 28326008 markings, 109122168 edges, 280968 markings/sec, 85 secs
lola: 29663478 markings, 114791887 edges, 267494 markings/sec, 90 secs
lola: 31288934 markings, 120780199 edges, 325091 markings/sec, 95 secs
lola: 32771670 markings, 126572963 edges, 296547 markings/sec, 100 secs
lola: 34315652 markings, 132445903 edges, 308796 markings/sec, 105 secs
lola: 35785503 markings, 138218207 edges, 293970 markings/sec, 110 secs
lola: 37136464 markings, 143665049 edges, 270192 markings/sec, 115 secs
lola: 38399078 markings, 148697494 edges, 252523 markings/sec, 120 secs
lola: 39718545 markings, 154060546 edges, 263893 markings/sec, 125 secs
lola: 40936609 markings, 159063257 edges, 243613 markings/sec, 130 secs
lola: 42190918 markings, 164281916 edges, 250862 markings/sec, 135 secs
lola: 43475682 markings, 169490262 edges, 256953 markings/sec, 140 secs
lola: 44663854 markings, 174457914 edges, 237634 markings/sec, 145 secs
lola: 45852931 markings, 179608962 edges, 237815 markings/sec, 150 secs
lola: 47415475 markings, 185397815 edges, 312509 markings/sec, 155 secs
lola: 48802537 markings, 190731254 edges, 277412 markings/sec, 160 secs
lola: 50154397 markings, 195993930 edges, 270372 markings/sec, 165 secs
lola: 51545818 markings, 201488607 edges, 278284 markings/sec, 170 secs
lola: 53022172 markings, 207177275 edges, 295271 markings/sec, 175 secs
lola: 54479553 markings, 212905618 edges, 291476 markings/sec, 180 secs
lola: 55791352 markings, 218182614 edges, 262360 markings/sec, 185 secs
lola: 57039408 markings, 223374359 edges, 249611 markings/sec, 190 secs
lola: 58452336 markings, 229014152 edges, 282586 markings/sec, 195 secs
lola: 59728948 markings, 234390944 edges, 255322 markings/sec, 200 secs
lola: 61039757 markings, 239660851 edges, 262162 markings/sec, 205 secs
lola: 62284108 markings, 244807933 edges, 248870 markings/sec, 210 secs
lola: 63509335 markings, 250119341 edges, 245045 markings/sec, 215 secs
lola: 64893779 markings, 255704841 edges, 276889 markings/sec, 220 secs
lola: 66206570 markings, 261115952 edges, 262558 markings/sec, 225 secs
lola: 67441455 markings, 266285262 edges, 246977 markings/sec, 230 secs
lola: 68560275 markings, 271344432 edges, 223764 markings/sec, 235 secs
lola: 69813149 markings, 276552869 edges, 250575 markings/sec, 240 secs
lola: 71434201 markings, 282510019 edges, 324210 markings/sec, 245 secs
lola: 72934648 markings, 288276685 edges, 300089 markings/sec, 250 secs
lola: 74373023 markings, 293873936 edges, 287675 markings/sec, 255 secs
lola: 75780605 markings, 299438838 edges, 281516 markings/sec, 260 secs
lola: 77223350 markings, 305267327 edges, 288549 markings/sec, 265 secs
lola: 78831284 markings, 311422488 edges, 321587 markings/sec, 270 secs
lola: 80347977 markings, 317398318 edges, 303339 markings/sec, 275 secs
lola: 81805718 markings, 323254059 edges, 291548 markings/sec, 280 secs
lola: 83172383 markings, 328918427 edges, 273333 markings/sec, 285 secs
lola: 84621527 markings, 334723215 edges, 289829 markings/sec, 290 secs
lola: 85977821 markings, 340471161 edges, 271259 markings/sec, 295 secs
lola: 87416185 markings, 346220616 edges, 287673 markings/sec, 300 secs
lola: 88713971 markings, 351632578 edges, 259557 markings/sec, 305 secs
lola: 89979947 markings, 357125293 edges, 253195 markings/sec, 310 secs
lola: 91375483 markings, 362699994 edges, 279107 markings/sec, 315 secs
lola: 92681830 markings, 368106209 edges, 261269 markings/sec, 320 secs
lola: 93977617 markings, 373573482 edges, 259157 markings/sec, 325 secs
lola: 95264710 markings, 379229511 edges, 257419 markings/sec, 330 secs
lola: 96685646 markings, 385013556 edges, 284187 markings/sec, 335 secs
lola: 98031662 markings, 390548930 edges, 269203 markings/sec, 340 secs
lola: 99326456 markings, 395969326 edges, 258959 markings/sec, 345 secs
lola: 100585574 markings, 401313439 edges, 251824 markings/sec, 350 secs
lola: 101792325 markings, 406487910 edges, 241350 markings/sec, 355 secs
lola: 103023987 markings, 412032316 edges, 246332 markings/sec, 360 secs
lola: 104525977 markings, 417999605 edges, 300398 markings/sec, 365 secs
lola: 106197762 markings, 424318766 edges, 334357 markings/sec, 370 secs
lola: 107749916 markings, 430322081 edges, 310431 markings/sec, 375 secs
lola: 109271873 markings, 436265281 edges, 304391 markings/sec, 380 secs
lola: 110806653 markings, 442297285 edges, 306956 markings/sec, 385 secs
lola: 112238067 markings, 448025425 edges, 286283 markings/sec, 390 secs
lola: 113755740 markings, 454344452 edges, 303535 markings/sec, 395 secs
lola: 115379624 markings, 460587941 edges, 324777 markings/sec, 400 secs
lola: 116917889 markings, 466601674 edges, 307653 markings/sec, 405 secs
lola: 118397008 markings, 472525837 edges, 295824 markings/sec, 410 secs
lola: 119812066 markings, 478321289 edges, 283012 markings/sec, 415 secs
lola: 121264838 markings, 484099808 edges, 290554 markings/sec, 420 secs
lola: 122577026 markings, 489685190 edges, 262438 markings/sec, 425 secs
lola: 124014798 markings, 495421047 edges, 287554 markings/sec, 430 secs
lola: 125362335 markings, 500980861 edges, 269507 markings/sec, 435 secs
lola: 126627112 markings, 506468438 edges, 252955 markings/sec, 440 secs
lola: 128034690 markings, 512145223 edges, 281516 markings/sec, 445 secs
lola: 129350147 markings, 517550605 edges, 263091 markings/sec, 450 secs
lola: 130549980 markings, 522592111 edges, 239967 markings/sec, 455 secs
lola: 131729851 markings, 527850024 edges, 235974 markings/sec, 460 secs
lola: 133013677 markings, 533234489 edges, 256765 markings/sec, 465 secs
lola: 134405947 markings, 538791122 edges, 278454 markings/sec, 470 secs
lola: 135606104 markings, 543777930 edges, 240031 markings/sec, 475 secs
lola: 136763637 markings, 548646171 edges, 231507 markings/sec, 480 secs
lola: 137953769 markings, 553679055 edges, 238026 markings/sec, 485 secs
lola: 139109833 markings, 558704904 edges, 231213 markings/sec, 490 secs
lola: 140218798 markings, 563661983 edges, 221793 markings/sec, 495 secs
lola: 141492174 markings, 568913707 edges, 254675 markings/sec, 500 secs
lola: 142790228 markings, 574202957 edges, 259611 markings/sec, 505 secs
lola: 144049434 markings, 579471886 edges, 251841 markings/sec, 510 secs
lola: 145234807 markings, 584496590 edges, 237075 markings/sec, 515 secs
lola: 146415244 markings, 589475836 edges, 236087 markings/sec, 520 secs
lola: 147617609 markings, 594614523 edges, 240473 markings/sec, 525 secs
lola: 148742908 markings, 599447000 edges, 225060 markings/sec, 530 secs
lola: 149894197 markings, 604906614 edges, 230258 markings/sec, 535 secs
lola: 151102103 markings, 609976229 edges, 241581 markings/sec, 540 secs
lola: 152493545 markings, 615667925 edges, 278288 markings/sec, 545 secs
lola: 154039721 markings, 621479044 edges, 309235 markings/sec, 550 secs
lola: 155507845 markings, 627118632 edges, 293625 markings/sec, 555 secs
lola: 156958969 markings, 632775240 edges, 290225 markings/sec, 560 secs
lola: 158361802 markings, 638279982 edges, 280567 markings/sec, 565 secs
lola: 159686789 markings, 643523781 edges, 264997 markings/sec, 570 secs
lola: 161071324 markings, 649005817 edges, 276907 markings/sec, 575 secs
lola: 162336556 markings, 654044889 edges, 253046 markings/sec, 580 secs
lola: 163668315 markings, 659445017 edges, 266352 markings/sec, 585 secs
lola: 164927214 markings, 665015704 edges, 251780 markings/sec, 590 secs
lola: 166323120 markings, 670246431 edges, 279181 markings/sec, 595 secs
lola: 167785356 markings, 675974203 edges, 292447 markings/sec, 600 secs
lola: 169367848 markings, 682172261 edges, 316498 markings/sec, 605 secs
lola: 170754066 markings, 687734055 edges, 277244 markings/sec, 610 secs
lola: 172043074 markings, 693059037 edges, 257802 markings/sec, 615 secs
lola: 173466431 markings, 698730709 edges, 284671 markings/sec, 620 secs
lola: 174775033 markings, 704285330 edges, 261720 markings/sec, 625 secs
lola: 176247064 markings, 710179891 edges, 294406 markings/sec, 630 secs
lola: 177541039 markings, 715529990 edges, 258795 markings/sec, 635 secs
lola: 178693186 markings, 720555601 edges, 230429 markings/sec, 640 secs
lola: 179996405 markings, 725795220 edges, 260644 markings/sec, 645 secs
lola: 181203835 markings, 730766014 edges, 241486 markings/sec, 650 secs
lola: 182476498 markings, 736070156 edges, 254533 markings/sec, 655 secs
lola: 183642060 markings, 741063005 edges, 233112 markings/sec, 660 secs
lola: 184791963 markings, 746024538 edges, 229981 markings/sec, 665 secs
lola: 186034454 markings, 751083222 edges, 248498 markings/sec, 670 secs
lola: 187253643 markings, 756110757 edges, 243838 markings/sec, 675 secs
lola: 188347649 markings, 760697319 edges, 218801 markings/sec, 680 secs
lola: 189512195 markings, 765609973 edges, 232909 markings/sec, 685 secs
lola: 190742448 markings, 770875743 edges, 246051 markings/sec, 690 secs
lola: 191852060 markings, 776021572 edges, 221922 markings/sec, 695 secs
lola: 192982890 markings, 780766141 edges, 226166 markings/sec, 700 secs
lola: 194302902 markings, 786008147 edges, 264002 markings/sec, 705 secs
lola: 195569691 markings, 791247523 edges, 253358 markings/sec, 710 secs
lola: 196835416 markings, 796564620 edges, 253145 markings/sec, 715 secs
lola: 198044519 markings, 801685707 edges, 241821 markings/sec, 720 secs
lola: 199180205 markings, 806566601 edges, 227137 markings/sec, 725 secs
lola: 200373434 markings, 811625321 edges, 238646 markings/sec, 730 secs
lola: 201524532 markings, 816625963 edges, 230220 markings/sec, 735 secs
lola: 202658071 markings, 821996954 edges, 226708 markings/sec, 740 secs
lola: 203874797 markings, 827049703 edges, 243345 markings/sec, 745 secs
lola: 205238963 markings, 832613739 edges, 272833 markings/sec, 750 secs
lola: 206493114 markings, 837795435 edges, 250830 markings/sec, 755 secs
lola: 207694181 markings, 842816657 edges, 240213 markings/sec, 760 secs
lola: 208878796 markings, 847844971 edges, 236923 markings/sec, 765 secs
lola: 209985750 markings, 852593792 edges, 221391 markings/sec, 770 secs
lola: 211182533 markings, 857649979 edges, 239357 markings/sec, 775 secs
lola: 212249866 markings, 862304046 edges, 213467 markings/sec, 780 secs
lola: 213489851 markings, 867615359 edges, 247997 markings/sec, 785 secs
lola: 214631437 markings, 872520783 edges, 228317 markings/sec, 790 secs
lola: 215770832 markings, 877539442 edges, 227879 markings/sec, 795 secs
lola: 216789298 markings, 882694629 edges, 203693 markings/sec, 800 secs
lola: 217929471 markings, 887315590 edges, 228035 markings/sec, 805 secs
lola: 219116792 markings, 892429055 edges, 237464 markings/sec, 810 secs
lola: 220634085 markings, 898060421 edges, 303459 markings/sec, 815 secs
lola: 221966753 markings, 903185092 edges, 266534 markings/sec, 820 secs
lola: 223275768 markings, 908276926 edges, 261803 markings/sec, 825 secs
lola: 224627386 markings, 913540151 edges, 270324 markings/sec, 830 secs
lola: 225979585 markings, 918855397 edges, 270440 markings/sec, 835 secs
lola: 227253060 markings, 923956411 edges, 254695 markings/sec, 840 secs
lola: 228624401 markings, 929332784 edges, 274268 markings/sec, 845 secs
lola: 229782865 markings, 933983737 edges, 231693 markings/sec, 850 secs
lola: 231063664 markings, 939065501 edges, 256160 markings/sec, 855 secs
lola: 232354091 markings, 944214430 edges, 258085 markings/sec, 860 secs
lola: 233545472 markings, 949058066 edges, 238276 markings/sec, 865 secs
lola: 234824803 markings, 954314305 edges, 255866 markings/sec, 870 secs
lola: 236038254 markings, 959997368 edges, 242690 markings/sec, 875 secs
lola: 237400722 markings, 965071152 edges, 272494 markings/sec, 880 secs
lola: 238740008 markings, 970460055 edges, 267857 markings/sec, 885 secs
lola: 240030010 markings, 975299198 edges, 258000 markings/sec, 890 secs
lola: 241210878 markings, 979982294 edges, 236174 markings/sec, 895 secs
lola: 242416484 markings, 984805515 edges, 241121 markings/sec, 900 secs
lola: 243532234 markings, 989245221 edges, 223150 markings/sec, 905 secs
lola: 244585489 markings, 993606450 edges, 210651 markings/sec, 910 secs
lola: 245800728 markings, 998496069 edges, 243048 markings/sec, 915 secs
lola: 246921775 markings, 1003252160 edges, 224209 markings/sec, 920 secs
lola: 248178488 markings, 1008290054 edges, 251343 markings/sec, 925 secs
lola: 249229166 markings, 1012623411 edges, 210136 markings/sec, 930 secs
lola: 250350997 markings, 1017367245 edges, 224366 markings/sec, 935 secs
lola: 251529297 markings, 1022344796 edges, 235660 markings/sec, 940 secs
lola: 252650243 markings, 1026851253 edges, 224189 markings/sec, 945 secs
lola: 253818969 markings, 1031675188 edges, 233745 markings/sec, 950 secs
lola: 254954695 markings, 1036440660 edges, 227145 markings/sec, 955 secs
lola: 255986134 markings, 1041181897 edges, 206288 markings/sec, 960 secs
lola: 257096677 markings, 1045763812 edges, 222109 markings/sec, 965 secs
lola: 258311756 markings, 1050591215 edges, 243016 markings/sec, 970 secs
lola: 259455882 markings, 1055331039 edges, 228825 markings/sec, 975 secs
lola: 260580216 markings, 1060040324 edges, 224867 markings/sec, 980 secs
lola: 261672492 markings, 1064652747 edges, 218455 markings/sec, 985 secs
lola: 262776313 markings, 1069376327 edges, 220764 markings/sec, 990 secs
lola: 263823434 markings, 1074308127 edges, 209424 markings/sec, 995 secs
lola: 264966135 markings, 1078954887 edges, 228540 markings/sec, 1000 secs
lola: 266275013 markings, 1084280328 edges, 261776 markings/sec, 1005 secs
lola: 267518563 markings, 1089416726 edges, 248710 markings/sec, 1010 secs
lola: 268264211 markings, 1092538731 edges, 149130 markings/sec, 1015 secs
lola: 268264433 markings, 1092539586 edges, 44 markings/sec, 1020 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (A (F (E (X (((1 <= p8) AND (1 <= p20))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(EX(((1 <= p8) AND (1 <= p20)))))
lola: processed formula length: 38
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1479990 markings, 3702335 edges, 295998 markings/sec, 0 secs
lola: 2879224 markings, 7395332 edges, 279847 markings/sec, 5 secs
lola: 4160332 markings, 10837970 edges, 256222 markings/sec, 10 secs
lola: 5467757 markings, 14441208 edges, 261485 markings/sec, 15 secs
lola: 6850504 markings, 18128036 edges, 276549 markings/sec, 20 secs
lola: 8087907 markings, 21415783 edges, 247481 markings/sec, 25 secs
lola: 9384141 markings, 24980425 edges, 259247 markings/sec, 30 secs
lola: 10732971 markings, 28809489 edges, 269766 markings/sec, 35 secs
lola: 11956118 markings, 32270430 edges, 244629 markings/sec, 40 secs
lola: 13083328 markings, 35548141 edges, 225442 markings/sec, 45 secs
lola: 14340360 markings, 38925960 edges, 251406 markings/sec, 50 secs
lola: 15541975 markings, 42100533 edges, 240323 markings/sec, 55 secs
lola: 16677911 markings, 45166842 edges, 227187 markings/sec, 60 secs
lola: 17826225 markings, 48326574 edges, 229663 markings/sec, 65 secs
lola: 18965136 markings, 51502444 edges, 227782 markings/sec, 70 secs
lola: 20098753 markings, 54739023 edges, 226723 markings/sec, 75 secs
lola: 21279637 markings, 58225682 edges, 236177 markings/sec, 80 secs
lola: 22579477 markings, 61866139 edges, 259968 markings/sec, 85 secs
lola: 23742244 markings, 65170771 edges, 232553 markings/sec, 90 secs
lola: 24818077 markings, 68326846 edges, 215167 markings/sec, 95 secs
lola: 25969632 markings, 71627725 edges, 230311 markings/sec, 100 secs
lola: 26999429 markings, 74651351 edges, 205959 markings/sec, 105 secs
lola: 28027782 markings, 77724055 edges, 205671 markings/sec, 110 secs
lola: 29129151 markings, 81091346 edges, 220274 markings/sec, 115 secs
lola: 30459874 markings, 84427773 edges, 266145 markings/sec, 120 secs
lola: 31640368 markings, 87565573 edges, 236099 markings/sec, 125 secs
lola: 32819696 markings, 90785864 edges, 235866 markings/sec, 130 secs
lola: 33923826 markings, 93880357 edges, 220826 markings/sec, 135 secs
lola: 35082344 markings, 97046026 edges, 231704 markings/sec, 140 secs
lola: 36195195 markings, 100159299 edges, 222570 markings/sec, 145 secs
lola: 37346191 markings, 103427029 edges, 230199 markings/sec, 150 secs
lola: 38378487 markings, 106297700 edges, 206459 markings/sec, 155 secs
lola: 39474645 markings, 109530641 edges, 219232 markings/sec, 160 secs
lola: 40582649 markings, 112576678 edges, 221601 markings/sec, 165 secs
lola: 41612595 markings, 115562128 edges, 205989 markings/sec, 170 secs
lola: 42750110 markings, 118853148 edges, 227503 markings/sec, 175 secs
lola: 43886159 markings, 122326419 edges, 227210 markings/sec, 180 secs
lola: 45140224 markings, 126025282 edges, 250813 markings/sec, 185 secs
lola: 46277682 markings, 129236573 edges, 227492 markings/sec, 190 secs
lola: 47353700 markings, 132331877 edges, 215204 markings/sec, 195 secs
lola: 48518270 markings, 135721664 edges, 232914 markings/sec, 200 secs
lola: 49607494 markings, 138848131 edges, 217845 markings/sec, 205 secs
lola: 50614689 markings, 141840722 edges, 201439 markings/sec, 210 secs
lola: 51677088 markings, 145109003 edges, 212480 markings/sec, 215 secs
lola: 52820804 markings, 148378657 edges, 228743 markings/sec, 220 secs
lola: 53889678 markings, 151487872 edges, 213775 markings/sec, 225 secs
lola: 54906913 markings, 154513401 edges, 203447 markings/sec, 230 secs
lola: 55891637 markings, 157512495 edges, 196945 markings/sec, 235 secs
lola: 56852550 markings, 160368605 edges, 192183 markings/sec, 240 secs
lola: 57868701 markings, 163489424 edges, 203230 markings/sec, 245 secs
lola: 58913175 markings, 166768687 edges, 208895 markings/sec, 250 secs
lola: 60207452 markings, 170254865 edges, 258855 markings/sec, 255 secs
lola: 61400136 markings, 173413485 edges, 238537 markings/sec, 260 secs
lola: 62573941 markings, 176498634 edges, 234761 markings/sec, 265 secs
lola: 63668819 markings, 179588600 edges, 218976 markings/sec, 270 secs
lola: 64706387 markings, 182364567 edges, 207514 markings/sec, 275 secs
lola: 65674108 markings, 185049613 edges, 193544 markings/sec, 280 secs
lola: 66730684 markings, 188129413 edges, 211315 markings/sec, 285 secs
lola: 67767520 markings, 190928593 edges, 207367 markings/sec, 290 secs
lola: 68769921 markings, 193716679 edges, 200480 markings/sec, 295 secs
lola: 69779964 markings, 196665668 edges, 202009 markings/sec, 300 secs
lola: 70840548 markings, 199803101 edges, 212117 markings/sec, 305 secs
lola: 71833427 markings, 202470210 edges, 198576 markings/sec, 310 secs
lola: 72760146 markings, 205069434 edges, 185344 markings/sec, 315 secs
lola: 73712853 markings, 207806631 edges, 190541 markings/sec, 320 secs
lola: 74685164 markings, 210811620 edges, 194462 markings/sec, 325 secs
lola: 75746422 markings, 213750699 edges, 212252 markings/sec, 330 secs
lola: 76695149 markings, 216391997 edges, 189745 markings/sec, 335 secs
lola: 77613141 markings, 219007648 edges, 183598 markings/sec, 340 secs
lola: 78536012 markings, 221696164 edges, 184574 markings/sec, 345 secs
lola: 79499044 markings, 224684334 edges, 192606 markings/sec, 350 secs
lola: 80566052 markings, 227631854 edges, 213402 markings/sec, 355 secs
lola: 81473993 markings, 230201440 edges, 181588 markings/sec, 360 secs
lola: 82374139 markings, 232832645 edges, 180029 markings/sec, 365 secs
lola: 83347377 markings, 235697808 edges, 194648 markings/sec, 370 secs
lola: 84448962 markings, 238980863 edges, 220317 markings/sec, 375 secs
lola: 85422559 markings, 241796011 edges, 194719 markings/sec, 380 secs
lola: 86436833 markings, 244870633 edges, 202855 markings/sec, 385 secs
lola: 87519122 markings, 248403150 edges, 216458 markings/sec, 390 secs
lola: 88714485 markings, 251878075 edges, 239073 markings/sec, 395 secs
lola: 89802128 markings, 254972615 edges, 217529 markings/sec, 400 secs
lola: 90827957 markings, 257941305 edges, 205166 markings/sec, 405 secs
lola: 91919783 markings, 261114084 edges, 218365 markings/sec, 410 secs
lola: 92923260 markings, 263987357 edges, 200695 markings/sec, 415 secs
lola: 93876851 markings, 266802807 edges, 190718 markings/sec, 420 secs
lola: 94857280 markings, 269778666 edges, 196086 markings/sec, 425 secs
lola: 95953805 markings, 273020874 edges, 219305 markings/sec, 430 secs
lola: 96984651 markings, 275996634 edges, 206169 markings/sec, 435 secs
lola: 97980723 markings, 278944611 edges, 199214 markings/sec, 440 secs
lola: 98926454 markings, 281726980 edges, 189146 markings/sec, 445 secs
lola: 99888214 markings, 284637250 edges, 192352 markings/sec, 450 secs
lola: 100902304 markings, 287784660 edges, 202818 markings/sec, 455 secs
lola: 101844352 markings, 290674323 edges, 188410 markings/sec, 460 secs
lola: 102942734 markings, 294051359 edges, 219676 markings/sec, 465 secs
lola: 103981558 markings, 296996283 edges, 207765 markings/sec, 470 secs
lola: 105058372 markings, 300136043 edges, 215363 markings/sec, 475 secs
lola: 106076447 markings, 303192611 edges, 203615 markings/sec, 480 secs
lola: 107048932 markings, 306051075 edges, 194497 markings/sec, 485 secs
lola: 108032399 markings, 309120507 edges, 196693 markings/sec, 490 secs
lola: 108990697 markings, 311949093 edges, 191660 markings/sec, 495 secs
lola: 109921889 markings, 314891584 edges, 186238 markings/sec, 500 secs
lola: 110902144 markings, 317817989 edges, 196051 markings/sec, 505 secs
lola: 111801866 markings, 320591151 edges, 179944 markings/sec, 510 secs
lola: 112801195 markings, 323757970 edges, 199866 markings/sec, 515 secs
lola: 113703967 markings, 326505083 edges, 180554 markings/sec, 520 secs
lola: 114681077 markings, 329694797 edges, 195422 markings/sec, 525 secs
lola: 115678307 markings, 332873610 edges, 199446 markings/sec, 530 secs
lola: 116938977 markings, 335985023 edges, 252134 markings/sec, 535 secs
lola: 118013270 markings, 338762571 edges, 214859 markings/sec, 540 secs
lola: 119086475 markings, 341710375 edges, 214641 markings/sec, 545 secs
lola: 120102544 markings, 344417924 edges, 203214 markings/sec, 550 secs
lola: 121111246 markings, 347312876 edges, 201740 markings/sec, 555 secs
lola: 122200506 markings, 350268556 edges, 217852 markings/sec, 560 secs
lola: 123162348 markings, 352876683 edges, 192368 markings/sec, 565 secs
lola: 124119725 markings, 355545601 edges, 191475 markings/sec, 570 secs
lola: 125083750 markings, 358481612 edges, 192805 markings/sec, 575 secs
lola: 126125309 markings, 361471737 edges, 208312 markings/sec, 580 secs
lola: 127159215 markings, 364171924 edges, 206781 markings/sec, 585 secs
lola: 128088090 markings, 366765382 edges, 185775 markings/sec, 590 secs
lola: 129025385 markings, 369458373 edges, 187459 markings/sec, 595 secs
lola: 130014859 markings, 372321155 edges, 197895 markings/sec, 600 secs
lola: 131000602 markings, 375325069 edges, 197149 markings/sec, 605 secs
lola: 132032888 markings, 378310749 edges, 206457 markings/sec, 610 secs
lola: 132954723 markings, 380769149 edges, 184367 markings/sec, 615 secs
lola: 133833623 markings, 383229171 edges, 175780 markings/sec, 620 secs
lola: 134704034 markings, 385725106 edges, 174082 markings/sec, 625 secs
lola: 135588657 markings, 388286102 edges, 176925 markings/sec, 630 secs
lola: 136502819 markings, 390953701 edges, 182832 markings/sec, 635 secs
lola: 137434842 markings, 393876547 edges, 186405 markings/sec, 640 secs
lola: 138451516 markings, 396882533 edges, 203335 markings/sec, 645 secs
lola: 139413610 markings, 399560238 edges, 192419 markings/sec, 650 secs
lola: 140293342 markings, 401985321 edges, 175946 markings/sec, 655 secs
lola: 140799478 markings, 403424687 edges, 101227 markings/sec, 660 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (G ((p24 <= 0))) AND ((E (F ((p14 <= 0))) OR A (F (((p10 <= 0) OR (p11 <= 0) OR (p28 <= 0))))) AND (A (G (((p8 <= 0) OR (p20 <= 0)))) OR ((1 <= p14) AND (1 <= p6) AND (1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((p14 <= 0)))
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 ((p14 <= 0)))
lola: processed formula length: 18
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p14 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p14) AND (1 <= p6) AND (1 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p14) AND (1 <= p6) AND (1 <= p20))
lola: processed formula length: 41
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((p24 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p24 <= 0)))
lola: processed formula length: 18
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: 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: The predicate is possibly preserved.
lola: 163 markings, 163 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p24)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
sara: try reading problem file CTLFireability-18-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: ...considering subproblem: A (G (((p8 <= 0) OR (p20 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p8 <= 0) OR (p20 <= 0))))
lola: processed formula length: 34
lola: 50 rewrites
lola: closed formula file CTLFireability.xml

lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: formula 0: ((1 <= p8) AND (1 <= p20))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (((p9 <= 0) OR (p25 <= 0)))))) OR (E (F ((((p4 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p19 <= 0))))) AND A (F (((((1 <= p10) AND (1 <= p11) AND (1 <= p28)) OR ((1 <= p9) AND (1 <= p25))) AND (p3 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((((p4 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p19 <= 0)))))
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 ((((p4 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p19 <= 0)))))
lola: processed formula length: 67
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation task get result unparse finished++ id 0
lola: 0 markings, 0 edges
lola: formula 0: (((p4 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p19 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p9 <= 0) OR (p25 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((p9 <= 0) OR (p25 <= 0))))
lola: processed formula length: 34
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 65 markings, 66 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes no no no no no yes unknown no yes yes unknown
lola:
preliminary result: yes no no yes yes no no no no no yes unknown no yes yes unknown
lola: memory consumption: 3644 KB
lola: time consumption: 2405 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

--------------------
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="TCPcondis-PT-25"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is TCPcondis-PT-25, 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 r194-csrt-159033389900356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-25.tgz
mv TCPcondis-PT-25 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;