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

About the Execution of ITS-LoLa for PhaseVariation-PT-D02CS010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.390 3600000.00 31319.00 175.90 TTTFFFFFFTFFTFTT 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.r174-csrt-158987853700756.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 PhaseVariation-PT-D02CS010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853700756
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 4.5K Apr 12 00:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 00:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 10 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 10 23:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 10 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 9 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 9 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 73K Mar 24 05:37 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 PhaseVariation-PT-D02CS010-CTLFireability-00
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-01
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-02
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-03
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-04
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-05
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-06
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-07
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-08
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-09
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-10
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-11
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-12
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-13
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-14
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591167499672

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:58:23] [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 06:58:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:58:24] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2020-06-03 06:58:24] [INFO ] Transformed 14 places.
[2020-06-03 06:58:24] [INFO ] Transformed 65 transitions.
[2020-06-03 06:58:24] [INFO ] Parsed PT model containing 14 places and 65 transitions in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 115 ms.
Finished random walk after 4654 steps, including 280 resets, run visited all 37 properties in 53 ms. (steps per millisecond=87 )
[2020-06-03 06:58:24] [INFO ] Flatten gal took : 51 ms
[2020-06-03 06:58:24] [INFO ] Flatten gal took : 12 ms
[2020-06-03 06:58:24] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-03 06:58:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ PhaseVariation-PT-D02CS010 @ 3570 seconds

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS010-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ PhaseVariation-PT-D02CS010

{
"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 06:58:25 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": 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": "((p9 <= 0) OR (p12 <= 0))",
"processed_size": 26,
"rewrites": 30
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 64
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EX((((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p2) AND (1 <= p8)) OR (p4 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12))))",
"processed_size": 163,
"rewrites": 28
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"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": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "(((p1 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0)))",
"processed_size": 88,
"rewrites": 29
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 64
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AF((EX(((1 <= p7) AND (1 <= p8) AND (1 <= p12))) AND AG(((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p9)))))",
"processed_size": 114,
"rewrites": 30
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 13,
"markings": 11,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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(AG(AF(((1 <= p9) AND (1 <= p12)))))",
"processed_size": 38,
"rewrites": 30
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 129,
"markings": 65,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "(((p2 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p12 <= 0)))",
"processed_size": 89,
"rewrites": 30
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EX(((p2 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p7))))",
"processed_size": 105,
"rewrites": 28
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EX(((1 <= p1) AND (1 <= p11) AND (1 <= p12) AND (1 <= p4) AND (1 <= p9) AND (((1 <= p4) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p12)))))",
"processed_size": 167,
"rewrites": 28
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"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": 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": "((p7 <= 0) OR (p8 <= 0) OR (p12 <= 0))",
"processed_size": 40,
"rewrites": 31
},
"result":
{
"edges": 136100,
"markings": 7716,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p3 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12))) AND (((1 <= p3) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p12))))",
"processed_size": 270,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((((1 <= p2) AND (1 <= p11) AND (1 <= p12)) U (((p7 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND (((1 <= p7) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12))))))",
"processed_size": 185,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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 <= p4) AND (1 <= p9) AND (1 <= p12))",
"processed_size": 40,
"rewrites": 30
},
"result":
{
"edges": 45216,
"markings": 2160,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p10 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p12 <= 0)))",
"processed_size": 75,
"rewrites": 30
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 64
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": "((p7 <= 0) OR (p10 <= 0) OR (p12 <= 0))",
"processed_size": 41,
"rewrites": 30
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 2,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF(((((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR (p3 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0))) AND EG(((p3 <= 0) OR (p8 <= 0) OR (p12 <= 0)))))",
"processed_size": 201,
"rewrites": 29
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 11,
"markings": 11,
"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": 713
},
"formula":
{
"count":
{
"A": 3,
"E": 1,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AF((AF(((1 <= p4) AND (1 <= p9) AND (1 <= p12))) AND (AG(((1 <= p6) AND (1 <= p9) AND (1 <= p12))) AND E(((1 <= p3) AND (1 <= p11) AND (1 <= p12)) U ((1 <= p3) AND (1 <= p9) AND (1 <= p12))))))",
"processed_size": 193,
"rewrites": 31
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 49,
"markings": 18,
"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": 891
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "AF(E(((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p5) AND (1 <= p9)) U ((1 <= p1) AND (1 <= p10) AND (1 <= p12) AND (1 <= p4) AND (1 <= p8))))",
"processed_size": 148,
"rewrites": 29
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 21,
"markings": 11,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 <= p4) AND (1 <= p8) AND (1 <= p12))",
"processed_size": 40,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (p5 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12) AND (1 <= p7) AND (1 <= p10)))))",
"processed_size": 168,
"rewrites": 28
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 30,
"problems": 6
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((((p1 <= 0) OR (p9 <= 0) OR (p12 <= 0)) OR F (((p3 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR (p1 <= 0) OR (p8 <= 0)))))",
"processed_size": 123,
"rewrites": 37
},
"result":
{
"edges": 158588,
"markings": 9071,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (G (((p12 <= 0) OR (p13 <= 9) OR (p7 <= 0) OR (p10 <= 0) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p12)))))",
"processed_size": 109,
"rewrites": 28
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (G (((p12 <= 0) OR (p13 <= 9) OR (p7 <= 0) OR (p10 <= 0) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p12)))))",
"processed_size": 109,
"rewrites": 28
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 7,
"aneg": 0,
"comp": 26,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (((p3 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0)))) AND ((p8 <= 0) OR (p12 <= 0) OR (p9 <= 0) OR ((1 <= p10) AND (1 <= p12)) OR (((p2 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p12 <= 0) OR (p4 <= 0)))))",
"processed_size": 395,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 55164,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(X(**)) AND E(G(E(F(*))))) : (E(G(**)) OR **) : E(X(E(G(**)))) : E(F((** AND E(G(**))))) : A(F(**)) : A(F((E(X(**)) AND A(G(**))))) : A(F(**)) : E(X(A(G(A(F(**)))))) : A(F(E((** U **)))) : E(F(E(G(*)))) : (A(F(**)) OR (E(X(**)) AND E(X(**)))) : (E(F(A(G(**)))) OR (A((** U **)) AND (E(X(**)) AND (** AND (** AND **))))) : A(F((* AND E(G(*))))) : A(F((A(F(**)) AND (A(G(**)) AND E((** U **)))))) : (E(G(**)) AND (** AND **)) : (A((** U **)) OR A(X(A(F(*)))))"
},
"net":
{
"arcs": 443,
"conflict_clusters": 1,
"places": 14,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 65
},
"result":
{
"preliminary_value": "yes yes yes no no no no no no yes no no yes no yes yes ",
"value": "yes yes yes no no no no no no yes no no yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 79/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 65 transitions, 9 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: (E (X ((((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p2) AND (1 <= p8)) OR (p4 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12))))) AND E (G (NOT(A (G (((1 <= p9) AND (1 <= p12)))))))) : (E (G ((((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (p5 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12) AND (1 <= p7) AND (1 <= p10))))) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12))) : E (X (E (G ((((p1 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0))))))) : E (F ((((1 <= p1) AND (1 <= p9) AND (1 <= p12)) AND E (G (((1 <= p3) AND (1 <= p10) AND (1 <= p12) AND (1 <= p1) AND (1 <= p8))))))) : A (F (((1 <= p7) AND (1 <= p10) AND (1 <= p12)))) : A (F ((E (X (((1 <= p7) AND (1 <= p8) AND (1 <= p12)))) AND A (G (((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p9))))))) : A (F (((1 <= p5) AND (1 <= p9) AND (1 <= p12) AND ((p2 <= 0) OR (p8 <= 0))))) : E (X (A (G (A (F (((1 <= p9) AND (1 <= p12)))))))) : A (F (E ((((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p5) AND (1 <= p9)) U ((1 <= p1) AND (1 <= p10) AND (1 <= p12) AND (1 <= p4) AND (1 <= p8)))))) : E (F (NOT(A (F ((((1 <= p10) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p12)))))))) : (A (F (A (F ((((1 <= p2) AND (1 <= p10) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p12))))))) OR (E (X (((1 <= p1) AND (1 <= p11) AND (1 <= p12) AND (1 <= p4) AND (1 <= p9) AND (((1 <= p4) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p12)))))) AND E (X (((p2 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p7))))))) : (E (F (A (G (((1 <= p7) AND (1 <= p8) AND (1 <= p12)))))) OR ((((A ((((p4 <= 0) OR (p10 <= 0) OR (p12 <= 0)) U ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p2) AND (1 <= p9)))) AND E (X (((p7 <= 0) OR (p9 <= 0) OR (p12 <= 0))))) AND ((p3 <= 0) OR (p10 <= 0) OR (p12 <= 0))) AND ((p4 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12)))) AND (((1 <= p3) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p12))))) : NOT(E (G (((((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p3)) OR ((1 <= p6) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12))) OR A (F (((1 <= p3) AND (1 <= p8) AND (1 <= p12)))))))) : A (F (((A (F (((1 <= p4) AND (1 <= p9) AND (1 <= p12)))) AND A (G (((1 <= p6) AND (1 <= p9) AND (1 <= p12))))) AND E ((((1 <= p3) AND (1 <= p11) AND (1 <= p12)) U ((1 <= p3) AND (1 <= p9) AND (1 <= p12))))))) : ((E (G (((p12 <= 0) OR (p13 <= 9) OR (p7 <= 0) OR (p10 <= 0) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p12))))) AND ((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (((p3 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0))))) AND ((p8 <= 0) OR (p12 <= 0) OR (p9 <= 0) OR ((1 <= p10) AND (1 <= p12)) OR (((p2 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p12 <= 0) OR (p4 <= 0))))) : (A ((((1 <= p2) AND (1 <= p11) AND (1 <= p12)) U (((p7 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND (((1 <= p7) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12)))))) OR NOT(E (X (E (G (((1 <= p4) AND (1 <= p9) AND (1 <= p12))))))))
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p2) AND (1 <= p8)) OR (p4 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12))))) AND E (G (E (F (((p9 <= 0) OR (p12 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p9 <= 0) OR (p12 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((p9 <= 0) OR (p12 <= 0))
lola: processed formula length: 26
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: 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 <= p9) AND (1 <= p12))
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: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p9 <= 0) OR (p12 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-1.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p2) AND (1 <= p8)) OR (p4 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p2) AND (1 <= p8)) OR (p4 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p9) AND (1 <= p12))))
lola: processed formula length: 163
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
sara: try reading problem file CTLFireability-1.sara.
sara: try reading problem file CTLFireability-0.sara.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((((p1 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (((p1 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0)))
lola: processed formula length: 88
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 10 markings, 9 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X (((1 <= p7) AND (1 <= p8) AND (1 <= p12)))) AND A (G (((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EX(((1 <= p7) AND (1 <= p8) AND (1 <= p12))) AND AG(((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p9)))))
lola: processed formula length: 114
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 11 markings, 13 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)

lola: ========================================
lola: ...considering subproblem: E (X (A (G (A (F (((1 <= p9) AND (1 <= p12))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(AF(((1 <= p9) AND (1 <= p12)))))
lola: processed formula length: 38
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 65 markings, 129 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p2) AND (1 <= p10) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p12))))) OR (E (X (((1 <= p1) AND (1 <= p11) AND (1 <= p12) AND (1 <= p4) AND (1 <= p9) AND (((1 <= p4) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p12)))))) AND E (X (((p2 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p2) AND (1 <= p10) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p12)))))
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: (((p2 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p12 <= 0)))
lola: processed formula length: 89
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 10 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2) AND (1 <= p10) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p12)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p2 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p2 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p7))))
lola: processed formula length: 105
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p1) AND (1 <= p11) AND (1 <= p12) AND (1 <= p4) AND (1 <= p9) AND (((1 <= p4) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p1) AND (1 <= p11) AND (1 <= p12) AND (1 <= p4) AND (1 <= p9) AND (((1 <= p4) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p12)))))
lola: processed formula length: 167
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================

lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((1 <= p7) AND (1 <= p8) AND (1 <= p12)))))) OR (A ((((p4 <= 0) OR (p10 <= 0) OR (p12 <= 0)) U ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p2) AND (1 <= p9)))) AND (E (X (((p7 <= 0) OR (p9 <= 0) OR (p12 <= 0)))) AND (((p3 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND (((p4 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p7) AND (1 <= p8) AND (1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p7 <= 0) OR (p8 <= 0) OR (p12 <= 0))
lola: processed formula length: 40
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p7) AND (1 <= p8) AND (1 <= p12))
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-5-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p7 <= 0) OR (p8 <= 0) OR (p12 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 7716 markings, 136100 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p3 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND (((p4 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12))) AND (((1 <= p3) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p12)))))
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: processed formula: (((p3 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12))) AND (((1 <= p3) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p12))))
lola: processed formula length: 270
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 18 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= p2) AND (1 <= p11) AND (1 <= p12)) U (((p7 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND (((1 <= p7) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12)))))) OR A (X (A (F (((p4 <= 0) OR (p9 <= 0) OR (p12 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p2) AND (1 <= p11) AND (1 <= p12)) U (((p7 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND (((1 <= p7) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= p2) AND (1 <= p11) AND (1 <= p12)) U (((p7 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND (((1 <= p7) AND (1 <= p11) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12))))))
lola: processed formula length: 185
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p2) AND (1 <= p11) AND (1 <= p12))
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-6-0.sara
lola: state equation: calling and running sara
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((p4 <= 0) OR (p9 <= 0) OR (p12 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p4) AND (1 <= p9) AND (1 <= p12))
lola: processed formula length: 40
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p4 <= 0) OR (p9 <= 0) OR (p12 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-7-0.sara

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 2160 markings, 45216 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((((p10 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p12 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (((p10 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p12 <= 0)))
lola: processed formula length: 75
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p10) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p12)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p10 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p12 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: The predicate is possibly preserved from a reachable marking.
lola: 11 markings, 10 edges

lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p7) AND (1 <= p10) AND (1 <= p12))))
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: ((p7 <= 0) OR (p10 <= 0) OR (p12 <= 0))
lola: processed formula length: 41
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: lola: ========================================
The predicate does not eventually occur.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p5) AND (1 <= p9) AND (1 <= p12) AND ((p2 <= 0) OR (p8 <= 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: ((p5 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR ((1 <= p2) AND (1 <= p8)))
lola: processed formula length: 70
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (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 <= p5) AND (1 <= p9) AND (1 <= p12) AND ((p2 <= 0) OR (p8 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR (p3 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0))) AND E (G (((p3 <= 0) OR (p8 <= 0) OR (p12 <= 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(((((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR (p3 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0))) AND EG(((p3 <= 0) OR (p8 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 201
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F (((1 <= p4) AND (1 <= p9) AND (1 <= p12)))) AND (A (G (((1 <= p6) AND (1 <= p9) AND (1 <= p12)))) AND E ((((1 <= p3) AND (1 <= p11) AND (1 <= p12)) U ((1 <= p3) AND (1 <= p9) AND (1 <= p12))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AF(((1 <= p4) AND (1 <= p9) AND (1 <= p12))) AND (AG(((1 <= p6) AND (1 <= p9) AND (1 <= p12))) AND E(((1 <= p3) AND (1 <= p11) AND (1 <= p12)) U ((1 <= p3) AND (1 <= p9) AND (1 <= p12))))))
lola: processed formula length: 193
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 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: 18 markings, 49 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E ((((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p5) AND (1 <= p9)) U ((1 <= p1) AND (1 <= p10) AND (1 <= p12) AND (1 <= p4) AND (1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E(((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p5) AND (1 <= p9)) U ((1 <= p1) AND (1 <= p10) AND (1 <= p12) AND (1 <= p4) AND (1 <= p8))))
lola: processed formula length: 148
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 11 markings, 21 edges
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (p5 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12) AND (1 <= p7) AND (1 <= p10))))) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND (1 <= p8) AND (1 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p4) AND (1 <= p8) AND (1 <= p12))
lola: processed formula length: 40
lola: 27 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 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (p5 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12) AND (1 <= p7) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (p5 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p12) AND (1 <= p7) AND (1 <= p10)))))
lola: processed formula length: 168
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p4 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND (1 <= p5) AND (1 <= p10) AND (1 <= p12) AND ((p4 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR (p7 <= 0) OR (p10 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 30 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1) AND (1 <= p9) AND (1 <= p12)) AND E (G (((1 <= p3) AND (1 <= p10) AND (1 <= p12) AND (1 <= p1) AND (1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p1 <= 0) OR (p9 <= 0) OR (p12 <= 0)) OR F (((p3 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR (p1 <= 0) OR (p8 <= 0)))))
lola: processed formula length: 123
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING

lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 9071 markings, 158588 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p12 <= 0) OR (p13 <= 9) OR (p7 <= 0) OR (p10 <= 0) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p12))))) AND (((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (((p3 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0)))) AND ((p8 <= 0) OR (p12 <= 0) OR (p9 <= 0) OR ((1 <= p10) AND (1 <= p12)) OR (((p2 <= 0) OR (p10 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p12 <= 0) OR (p13 <= 9) OR (p7 <= 0) OR (p10 <= 0) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p12 <= 0) OR (p13 <= 9) OR (p7 <= 0) OR (p10 <= 0) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p12)))))
lola: processed formula length: 109
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: 11 markings, 10 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (((p12 <= 0) OR (p13 <= 9) OR (p7 <= 0) OR (p10 <= 0) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p12))))) AND (((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (((p3 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0)))) AND ((p8 <= 0) OR (p12 <= 0) OR (p9 <= 0) OR ((1 <= p10) AND (1 <= p12)) OR (((p2 <= 0) OR (p10 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (((p12 <= 0) OR (p13 <= 9) OR (p7 <= 0) OR (p10 <= 0) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p12 <= 0) OR (p13 <= 9) OR (p7 <= 0) OR (p10 <= 0) OR ((1 <= p2) AND (1 <= p8) AND (1 <= p12)))))
lola: processed formula length: 109
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p12) AND (10 <= p13) AND (1 <= p7) AND (1 <= p10) AND ((p2 <= 0) OR (p8 <= 0) OR (p12 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 10 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (((p3 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0)))) AND ((p8 <= 0) OR (p12 <= 0) OR (p9 <= 0) OR ((1 <= p10) AND (1 <= p12)) OR (((p2 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p12 <= 0) OR (p4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (((p3 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p12 <= 0)))) AND ((p8 <= 0) OR (p12 <= 0) OR (p9 <= 0) OR ((1 <= p10) AND (1 <= p12)) OR (((p2 <= 0) OR (p10 <= 0) OR (p12 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p12 <= 0) OR (p4 <= 0)))))
lola: processed formula length: 395
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 26 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no no no no no yes no no yes no yes yes
lola:
preliminary result: yes yes yes no no no no no no yes no no yes no yes yes
lola: memory consumption: 55164 KB
lola: time consumption: 4 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="PhaseVariation-PT-D02CS010"
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 PhaseVariation-PT-D02CS010, 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 r174-csrt-158987853700756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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