Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 RefineWMG-PT-015015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.0K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 12:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 35K 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 n0-CTLFireability-00
FORMULA_NAME n0-CTLFireability-01
FORMULA_NAME n0-CTLFireability-02
FORMULA_NAME n0-CTLFireability-03
FORMULA_NAME n0-CTLFireability-04
FORMULA_NAME n0-CTLFireability-05
FORMULA_NAME n0-CTLFireability-06
FORMULA_NAME n0-CTLFireability-07
FORMULA_NAME n0-CTLFireability-08
FORMULA_NAME n0-CTLFireability-09
FORMULA_NAME n0-CTLFireability-10
FORMULA_NAME n0-CTLFireability-11
FORMULA_NAME n0-CTLFireability-12
FORMULA_NAME n0-CTLFireability-13
FORMULA_NAME n0-CTLFireability-14
FORMULA_NAME n0-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591224916164

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:55:17] [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 22:55:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:55:17] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2020-06-03 22:55:17] [INFO ] Transformed 79 places.
[2020-06-03 22:55:17] [INFO ] Transformed 63 transitions.
[2020-06-03 22:55:17] [INFO ] Parsed PT model containing 79 places and 63 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Incomplete random walk after 100012 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=980 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 63 rows 79 cols
[2020-06-03 22:55:17] [INFO ] Computed 32 place invariants in 3 ms
[2020-06-03 22:55:17] [INFO ] [Real]Absence check using 32 positive place invariants in 19 ms returned sat
[2020-06-03 22:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:55:17] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-06-03 22:55:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:55:17] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2020-06-03 22:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:55:17] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-06-03 22:55:17] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 9 ms.
[2020-06-03 22:55:17] [INFO ] Added : 34 causal constraints over 7 iterations in 44 ms. Result :sat
[2020-06-03 22:55:17] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2020-06-03 22:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:55:18] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-03 22:55:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:55:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2020-06-03 22:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:55:18] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-03 22:55:18] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 4 ms.
[2020-06-03 22:55:18] [INFO ] Added : 35 causal constraints over 7 iterations in 41 ms. Result :sat
[2020-06-03 22:55:18] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2020-06-03 22:55:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:55:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-03 22:55:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:55:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2020-06-03 22:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:55:18] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-06-03 22:55:18] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 7 ms.
[2020-06-03 22:55:18] [INFO ] Added : 47 causal constraints over 10 iterations in 52 ms. Result :sat
[2020-06-03 22:55:18] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2020-06-03 22:55:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:55:18] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-03 22:55:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:55:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 14 ms returned sat
[2020-06-03 22:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:55:18] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2020-06-03 22:55:18] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 4 ms.
[2020-06-03 22:55:18] [INFO ] Added : 30 causal constraints over 6 iterations in 28 ms. Result :sat
[2020-06-03 22:55:18] [INFO ] Flatten gal took : 25 ms
[2020-06-03 22:55:18] [INFO ] Flatten gal took : 7 ms
[2020-06-03 22:55:18] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-03 22:55:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RefineWMG-PT-015015 @ 3570 seconds

FORMULA n0-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1127
rslt: Output for CTLFireability @ RefineWMG-PT-015015

{
"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 22:55:51 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": 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 <= p11) AND (1 <= p12) AND (1 <= p14))",
"processed_size": 42,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"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": "(1 <= p42)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 (G (((1 <= p18) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59))))",
"processed_size": 65,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 278
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 (F (((1 <= p61) AND (1 <= p62) AND (1 <= p64) AND (1 <= p70))))",
"processed_size": 65,
"rewrites": 31
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "AX(EX((1 <= p53)))",
"processed_size": 18,
"rewrites": 32
},
"net":
{
"conflict_clusters": 48,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G ((p50 <= 0)))",
"processed_size": 18,
"rewrites": 32
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 258
},
"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": "(1 <= p47)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 281
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(((p22 <= 0) AND ((p61 <= 0) OR (p62 <= 0) OR (p64 <= 0))))",
"processed_size": 63,
"rewrites": 31
},
"net":
{
"conflict_clusters": 48,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 258
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((1 <= p15)))",
"processed_size": 18,
"rewrites": 31
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 281
},
"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 <= p31) AND (1 <= p32) AND (1 <= p34))))",
"processed_size": 50,
"rewrites": 31
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"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": 310
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "A (G (((p61 <= 0) OR (p62 <= 0) OR (p64 <= 0))))",
"processed_size": 50,
"rewrites": 32
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 344
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"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": "E (F (((1 <= p5) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))))",
"processed_size": 63,
"rewrites": 31
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 387
},
"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": "(p57 <= 0)",
"processed_size": 10,
"rewrites": 34
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 607
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"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": "(((p37 <= 0) AND (p47 <= 0)) R (F ((p20 <= 0)) OR (1 <= p38)))",
"processed_size": 62,
"rewrites": 41
},
"result":
{
"edges": 232297,
"markings": 120815,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 809
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((((1 <= p55) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39))) OR (1 <= p7)))",
"processed_size": 76,
"rewrites": 32
},
"result":
{
"edges": 8172,
"markings": 4331,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1214
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((p21 <= 0) OR (p22 <= 0) OR (p24 <= 0) OR ((1 <= p27) AND (1 <= p66) AND (1 <= p67) AND (1 <= p69)))",
"processed_size": 101,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2429
},
"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": "(1 <= p77)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))",
"processed_size": 84,
"rewrites": 33
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2429
},
"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 <= p46) AND (1 <= p47) AND (1 <= p49))))",
"processed_size": 50,
"rewrites": 31
},
"result":
{
"edges": 7,
"markings": 8,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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 (((p42 <= 0) R (p45 <= 0)))",
"processed_size": 29,
"rewrites": 33
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((p21 <= 0) OR (p22 <= 0) OR (p24 <= 0) OR ((1 <= p27) AND (1 <= p66) AND (1 <= p67) AND (1 <= p69)))",
"processed_size": 101,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 21,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": "(1 <= p77)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 22,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 <= p31) AND (1 <= p32) AND (1 <= p34))))",
"processed_size": 50,
"rewrites": 31
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 23,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
},

{
"child":
[

{
"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 <= p46) AND (1 <= p47) AND (1 <= p49))))",
"processed_size": 50,
"rewrites": 31
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G ((1 <= p22)))",
"processed_size": 18,
"rewrites": 32
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 23,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 22,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3704,
"runtime": 2443.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(F(A(G(*)))) : (E((* R *)) AND (A(G(**)) AND (A((** U **)) OR E(F(**))))) : E(F(**)) : A(G((** OR (E(G(**)) OR **)))) : (A(G(A(F(**)))) OR E((E(X(**)) U **))) : E(F(**)) : E((** U (E(G(**)) AND **))) : A(F((A(G(**)) OR A(G(**))))) : E(F(**)) : (** AND (A(X(E(X(**)))) AND (E(F(**)) OR (A(G(**)) OR (** OR (** AND A(X(**)))))))) : E((E(F(*)) U (A(X(**)) AND **))) : (** AND (A(G(**)) OR A(X(**)))) : A(G((A((** U **)) OR **))) : (E(F(**)) OR (** AND (A(F(**)) AND (E(F(**)) OR (** OR (** OR (** OR **))))))) : A(G(A(F(*))))"
},
"net":
{
"arcs": 188,
"conflict_clusters": 48,
"places": 79,
"places_significant": 47,
"singleton_clusters": 0,
"transitions": 63
},
"result":
{
"preliminary_value": "no unknown no yes unknown unknown yes yes unknown yes yes unknown no no yes no ",
"value": "no unknown no yes unknown unknown yes yes unknown yes yes unknown no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2528
lola: finding significant places
lola: 79 places, 63 transitions, 47 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 (G (((p61 <= 0) OR (p62 <= 0) OR (p64 <= 0)))) : NOT(E (G (E (F ((((1 <= p26) AND (1 <= p27) AND (1 <= p29)) OR (1 <= p50))))))) : ((NOT(A (((1 <= p42) U (1 <= p45)))) AND A (G ((1 <= p22)))) AND (A ((((1 <= p0) AND (1 <= p76) AND (1 <= p77)) U ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) OR E (F (((1 <= p46) AND (1 <= p47) AND (1 <= p49)))))) : E (F (((1 <= p31) AND (1 <= p32) AND (1 <= p34)))) : A (G ((((1 <= p47) OR E (G ((1 <= p77)))) OR ((p58 <= 0) AND (p55 <= 0))))) : (A (G (A (F (((1 <= p22) OR ((1 <= p71) AND (1 <= p72) AND (1 <= p74))))))) OR E ((E (X ((1 <= p63))) U ((p42 <= 0) AND (p22 <= 0))))) : E (((((1 <= p32) AND (1 <= p31) AND (1 <= p34) AND (p5 <= 0)) OR ((1 <= p40) AND (1 <= p78) AND (1 <= p52))) U E (F (((1 <= p5) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p9))))))) : E ((((1 <= p37) OR (1 <= p47)) U (E (G ((1 <= p20))) AND (p38 <= 0)))) : A (F ((A (G (((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0)))) OR A (G ((1 <= p37)))))) : A (F (E (F ((1 <= p15))))) : (((1 <= p42) AND A (X (E (X ((1 <= p53)))))) AND (((E (F (((1 <= p61) AND (1 <= p62) AND (1 <= p64) AND (1 <= p70)))) OR A (G (((1 <= p18) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59))))) OR ((1 <= p21) AND (1 <= p22) AND (1 <= p24) AND (1 <= p31) AND (1 <= p32) AND (1 <= p34) AND ((1 <= p75) OR (1 <= p35)) AND ((1 <= p78) OR (p50 <= 0) OR ((1 <= p46) AND (1 <= p47) AND (1 <= p49))))) OR (((1 <= p11) AND (1 <= p12) AND (1 <= p14)) AND A (X ((1 <= p17)))))) : E ((NOT(A (G (((1 <= p26) AND (1 <= p27) AND (1 <= p29))))) U (A (X ((1 <= p60))) AND (((1 <= p11) AND (1 <= p12) AND (1 <= p14)) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (1 <= p35)))))) : ((1 <= p47) AND (A (G ((p50 <= 0))) OR A (X (((p22 <= 0) AND ((p61 <= 0) OR (p62 <= 0) OR (p64 <= 0))))))) : A (G ((A (((1 <= p55) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39)))) OR (1 <= p7)))) : (E (F (((1 <= p31) AND (1 <= p32) AND (1 <= p34)))) OR (((1 <= p77) AND A (F (((1 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9))))) AND ((((E (F ((1 <= p5))) OR (p21 <= 0)) OR (p22 <= 0)) OR (p24 <= 0)) OR ((1 <= p27) AND (1 <= p66) AND (1 <= p67) AND (1 <= p69))))) : A (G (NOT(E (G ((p57 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: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 (G (A (F (((1 <= p22) OR ((1 <= p71) AND (1 <= p72) AND (1 <= p74))))))) OR E ((E (X ((1 <= p63))) U ((p42 <= 0) AND (p22 <= 0)))))
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: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (AG(AF(((1 <= p22) OR ((1 <= p71) AND (1 <= p72) AND (1 <= p74))))) OR E(EX((1 <= p63)) U ((p42 <= 0) AND (p22 <= 0))))
lola: processed formula length: 120
lola: 34 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: 3328662 markings, 8432580 edges, 665732 markings/sec, 0 secs
lola: 6501492 markings, 16470419 edges, 634566 markings/sec, 5 secs
lola: 9611481 markings, 24349053 edges, 621998 markings/sec, 10 secs
lola: 12730498 markings, 32250579 edges, 623803 markings/sec, 15 secs
lola: 15976578 markings, 40473971 edges, 649216 markings/sec, 20 secs
lola: 19033120 markings, 48217217 edges, 611308 markings/sec, 25 secs
lola: 21840595 markings, 55329473 edges, 561495 markings/sec, 30 secs
lola: 24663326 markings, 62480399 edges, 564546 markings/sec, 35 secs
lola: 27464832 markings, 69577551 edges, 560301 markings/sec, 40 secs
lola: 30286282 markings, 76725227 edges, 564290 markings/sec, 45 secs
lola: 33189078 markings, 84078970 edges, 580559 markings/sec, 50 secs
lola: 36205604 markings, 91720844 edges, 603305 markings/sec, 55 secs
lola: 39114921 markings, 99091101 edges, 581863 markings/sec, 60 secs
lola: 41997130 markings, 106392698 edges, 576442 markings/sec, 65 secs
lola: 44897408 markings, 113740067 edges, 580056 markings/sec, 70 secs
lola: 47878076 markings, 121291095 edges, 596134 markings/sec, 75 secs
lola: 50880996 markings, 128898502 edges, 600584 markings/sec, 80 secs
lola: 53748624 markings, 136163152 edges, 573526 markings/sec, 85 secs
lola: 56659997 markings, 143538637 edges, 582275 markings/sec, 90 secs
lola: 59440249 markings, 150581933 edges, 556050 markings/sec, 95 secs
lola: 62265653 markings, 157739628 edges, 565081 markings/sec, 100 secs
lola: 65071229 markings, 164847091 edges, 561115 markings/sec, 105 secs
lola: 68067785 markings, 172438365 edges, 599311 markings/sec, 110 secs
lola: 71034190 markings, 179953256 edges, 593281 markings/sec, 115 secs
lola: 73895822 markings, 187202716 edges, 572326 markings/sec, 120 secs
lola: 76742901 markings, 194415313 edges, 569416 markings/sec, 125 secs
lola: 78961127 markings, 200035333 edges, 443645 markings/sec, 130 secs
lola: 80475408 markings, 203870996 edges, 302856 markings/sec, 135 secs
lola: 81755627 markings, 207114232 edges, 256044 markings/sec, 140 secs
lola: 82888968 markings, 209985345 edges, 226668 markings/sec, 145 secs
lola: 82888968 markings, 209985345 edges, 0 markings/sec, 150 secs
lola: 82912342 markings, 210044565 edges, 4675 markings/sec, 155 secs
lola: 82913536 markings, 210047585 edges, 239 markings/sec, 160 secs
lola: 84932451 markings, 215162180 edges, 403783 markings/sec, 165 secs
lola: 85166494 markings, 215755085 edges, 46809 markings/sec, 170 secs
lola: 85166494 markings, 215755085 edges, 0 markings/sec, 175 secs
lola: 86665931 markings, 219553655 edges, 299887 markings/sec, 180 secs
lola: 87902138 markings, 222685387 edges, 247241 markings/sec, 185 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p42) AND (A (X (E (X ((1 <= p53))))) AND (E (F (((1 <= p61) AND (1 <= p62) AND (1 <= p64) AND (1 <= p70)))) OR (A (G (((1 <= p18) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59)))) OR (((1 <= p21) AND (1 <= p22) AND (1 <= p24) AND (1 <= p31) AND (1 <= p32) AND (1 <= p34) AND ((1 <= p75) OR (1 <= p35)) AND ((1 <= p78) OR (p50 <= 0) OR ((1 <= p46) AND (1 <= p47) AND (1 <= p49)))) OR (((1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p11) AND (1 <= p12) AND (1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p11) AND (1 <= p12) AND (1 <= p14))
lola: processed formula length: 42
lola: 30 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 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p42)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p42)
lola: processed formula length: 10
lola: 30 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 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p18) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p18) AND (1 <= p56) AND (1 <= p57) AND (1 <= p59))))
lola: processed formula length: 65
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: formula 0: ((p18 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))
lola: state equation task get result unparse finished id 0
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p61) AND (1 <= p62) AND (1 <= p64) AND (1 <= p70))))
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 <= p61) AND (1 <= p62) AND (1 <= p64) AND (1 <= p70))))
lola: processed formula length: 65
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((1 <= p61) AND (1 <= p62) AND (1 <= p64) AND (1 <= p70))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((1 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX((1 <= p53)))
lola: processed formula length: 18
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: 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.
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))) U (A (X ((1 <= p60))) AND (((1 <= p11) AND (1 <= p12) AND (1 <= p14)) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (1 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) U (AX((1 <= p60)) AND (((1 <= p11) AND (1 <= p12) AND (1 <= p14)) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (1 <= p35)))))
lola: processed formula length: 179
lola: 33 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: 2916264 markings, 7387849 edges, 583253 markings/sec, 0 secs
lola: 5728216 markings, 14511456 edges, 562390 markings/sec, 5 secs
lola: 8366081 markings, 21194057 edges, 527573 markings/sec, 10 secs
lola: 11003642 markings, 27875866 edges, 527512 markings/sec, 15 secs
lola: 13783468 markings, 34918084 edges, 555965 markings/sec, 20 secs
lola: 16570896 markings, 41979572 edges, 557486 markings/sec, 25 secs
lola: 19232023 markings, 48721092 edges, 532225 markings/sec, 30 secs
lola: 21891230 markings, 55457755 edges, 531841 markings/sec, 35 secs
lola: 24563856 markings, 62228398 edges, 534525 markings/sec, 40 secs
lola: 27165116 markings, 68818276 edges, 520252 markings/sec, 45 secs
lola: 29757165 markings, 75384790 edges, 518410 markings/sec, 50 secs
lola: 32378992 markings, 82026750 edges, 524365 markings/sec, 55 secs
lola: 35087455 markings, 88888200 edges, 541693 markings/sec, 60 secs
lola: 37668714 markings, 95427384 edges, 516252 markings/sec, 65 secs
lola: 40214624 markings, 101877031 edges, 509182 markings/sec, 70 secs
lola: 42692082 markings, 108153241 edges, 495492 markings/sec, 75 secs
lola: 45292436 markings, 114740803 edges, 520071 markings/sec, 80 secs
lola: 47891903 markings, 121326129 edges, 519893 markings/sec, 85 secs
lola: 50580273 markings, 128136659 edges, 537674 markings/sec, 90 secs
lola: 53223089 markings, 134831793 edges, 528563 markings/sec, 95 secs
lola: 54868721 markings, 139001268 edges, 329126 markings/sec, 100 secs
lola: 57087622 markings, 144624490 edges, 443780 markings/sec, 105 secs
lola: 58519553 markings, 148249509 edges, 286386 markings/sec, 110 secs
lola: 60028608 markings, 152072449 edges, 301811 markings/sec, 115 secs
lola: 60862998 markings, 154186238 edges, 166878 markings/sec, 120 secs
lola: 61082041 markings, 154741152 edges, 43809 markings/sec, 125 secs
lola: 61259006 markings, 155189456 edges, 35393 markings/sec, 130 secs
lola: 61259006 markings, 155189456 edges, 0 markings/sec, 135 secs
lola: 61320867 markings, 155346170 edges, 12372 markings/sec, 140 secs
lola: 61519848 markings, 155850255 edges, 39796 markings/sec, 145 secs
lola: 61698024 markings, 156301630 edges, 35635 markings/sec, 150 secs
lola: 61728698 markings, 156379345 edges, 6135 markings/sec, 155 secs
lola: 63197394 markings, 160100035 edges, 293739 markings/sec, 160 secs
lola: 63197394 markings, 160100035 edges, 0 markings/sec, 165 secs
lola: 63197394 markings, 160100035 edges, 0 markings/sec, 170 secs
lola: 63197394 markings, 160100035 edges, 0 markings/sec, 175 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown yes unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p47) AND (A (G ((p50 <= 0))) OR A (X (((p22 <= 0) AND ((p61 <= 0) OR (p62 <= 0) OR (p64 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p50 <= 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:787
lola: processed formula: A (G ((p50 <= 0)))
lola: processed formula length: 18
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p50)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p47)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p47)
lola: processed formula length: 10
lola: 30 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 5 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p22 <= 0) AND ((p61 <= 0) OR (p62 <= 0) OR (p64 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p22 <= 0) AND ((p61 <= 0) OR (p62 <= 0) OR (p64 <= 0))))
lola: processed formula length: 63
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 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 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p15)))
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 <= p15)))
lola: processed formula length: 18
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p31) AND (1 <= p32) AND (1 <= p34))))
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 <= p31) AND (1 <= p32) AND (1 <= p34))))
lola: processed formula length: 50
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((1 <= p31) AND (1 <= p32) AND (1 <= p34))
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: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p61 <= 0) OR (p62 <= 0) OR (p64 <= 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:787
lola: processed formula: A (G (((p61 <= 0) OR (p62 <= 0) OR (p64 <= 0))))
lola: processed formula length: 50
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p61) AND (1 <= p62) AND (1 <= p64))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p5) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))))
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 <= p5) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))))
lola: processed formula length: 63
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((1 <= p5) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 8 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= p57)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p57 <= 0)
lola: processed formula length: 10
lola: 34 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: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 /EFEG
lola: The predicate does not eventually occur from all states.
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p47) OR (E (G ((1 <= p77))) OR ((p58 <= 0) AND (p55 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((1 <= p47) OR (EG((1 <= p77)) OR ((p58 <= 0) AND (p55 <= 0)))))
lola: processed formula length: 67
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: 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: 4417216 markings, 6773046 edges, 883443 markings/sec, 0 secs
lola: 8673486 markings, 13299317 edges, 851254 markings/sec, 5 secs
lola: 12852151 markings, 19706612 edges, 835733 markings/sec, 10 secs
lola: 17109018 markings, 26233799 edges, 851373 markings/sec, 15 secs
lola: 20849073 markings, 31968557 edges, 748011 markings/sec, 20 secs
lola: 24527338 markings, 37608565 edges, 735653 markings/sec, 25 secs
lola: 28023007 markings, 42968585 edges, 699134 markings/sec, 30 secs
lola: 31662201 markings, 48548689 edges, 727839 markings/sec, 35 secs
lola: 35567839 markings, 54537332 edges, 781128 markings/sec, 40 secs
lola: 39495649 markings, 60559976 edges, 785562 markings/sec, 45 secs
lola: 43350542 markings, 66470803 edges, 770979 markings/sec, 50 secs
lola: 47307121 markings, 72537561 edges, 791316 markings/sec, 55 secs
lola: 51244077 markings, 78574220 edges, 787391 markings/sec, 60 secs
lola: 54835741 markings, 84081447 edges, 718333 markings/sec, 65 secs
lola: 58296519 markings, 89387966 edges, 692156 markings/sec, 70 secs
lola: 61718183 markings, 94634521 edges, 684333 markings/sec, 75 secs
lola: 65235008 markings, 100026996 edges, 703365 markings/sec, 80 secs
lola: 69103863 markings, 105959228 edges, 773771 markings/sec, 85 secs
lola: 73042029 markings, 111997751 edges, 787633 markings/sec, 90 secs
lola: 76944524 markings, 117981573 edges, 780499 markings/sec, 95 secs
lola: 80610497 markings, 123602989 edges, 733195 markings/sec, 100 secs
lola: 82433983 markings, 126398907 edges, 364697 markings/sec, 105 secs
lola: 85235636 markings, 130695237 edges, 560331 markings/sec, 110 secs
lola: 86678948 markings, 132907692 edges, 288662 markings/sec, 115 secs
lola: 89897645 markings, 137844507 edges, 643739 markings/sec, 120 secs
lola: 91202164 markings, 139843308 edges, 260904 markings/sec, 125 secs
lola: 93843403 markings, 143893188 edges, 528248 markings/sec, 130 secs
lola: 94960523 markings, 145606104 edges, 223424 markings/sec, 135 secs
lola: 94960616 markings, 145606251 edges, 19 markings/sec, 140 secs
lola: 94960616 markings, 145606251 edges, 0 markings/sec, 145 secs
lola: 94960616 markings, 145606251 edges, 0 markings/sec, 150 secs
lola: 95837439 markings, 146950714 edges, 175365 markings/sec, 155 secs
lola: 96642910 markings, 148185773 edges, 161094 markings/sec, 160 secs
lola: 96642910 markings, 148185773 edges, 0 markings/sec, 165 secs
lola: 96672241 markings, 148230743 edges, 5866 markings/sec, 170 secs
lola: 97350866 markings, 149271291 edges, 135725 markings/sec, 175 secs
lola: 97352356 markings, 149273585 edges, 298 markings/sec, 180 secs
lola: 97654438 markings, 149736778 edges, 60416 markings/sec, 185 secs
lola: 97679458 markings, 149775145 edges, 5004 markings/sec, 190 secs
lola: 98080862 markings, 150390631 edges, 80281 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0)))) OR A (G ((1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0))) OR AG((1 <= p37))))
lola: processed formula length: 70
lola: 33 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: 4705055 markings, 7214396 edges, 941011 markings/sec, 0 secs
lola: 9518240 markings, 14594608 edges, 962637 markings/sec, 5 secs
lola: 14314282 markings, 21948535 edges, 959208 markings/sec, 10 secs
lola: 18844898 markings, 28895483 edges, 906123 markings/sec, 15 secs
lola: 22959487 markings, 35204526 edges, 822918 markings/sec, 20 secs
lola: 26951024 markings, 41324877 edges, 798307 markings/sec, 25 secs
lola: 30754182 markings, 47156388 edges, 760632 markings/sec, 30 secs
lola: 35112532 markings, 53839194 edges, 871670 markings/sec, 35 secs
lola: 39451211 markings, 60491838 edges, 867736 markings/sec, 40 secs
lola: 43824651 markings, 67197773 edges, 874688 markings/sec, 45 secs
lola: 48166397 markings, 73855117 edges, 868349 markings/sec, 50 secs
lola: 52280214 markings, 80162978 edges, 822763 markings/sec, 55 secs
lola: 56127744 markings, 86062512 edges, 769506 markings/sec, 60 secs
lola: 59906776 markings, 91857030 edges, 755806 markings/sec, 65 secs
lola: 63637531 markings, 97577524 edges, 746151 markings/sec, 70 secs
lola: 67546090 markings, 103570649 edges, 781712 markings/sec, 75 secs
lola: 71836086 markings, 110148648 edges, 857999 markings/sec, 80 secs
lola: 76034585 markings, 116586341 edges, 839700 markings/sec, 85 secs
lola: 79941634 markings, 122577836 edges, 781410 markings/sec, 90 secs
lola: 80610070 markings, 123602150 edges, 133687 markings/sec, 95 secs
lola: 84321957 markings, 129293706 edges, 742377 markings/sec, 100 secs
lola: 87081717 markings, 133525261 edges, 551952 markings/sec, 105 secs
lola: 89032447 markings, 136516387 edges, 390146 markings/sec, 110 secs
lola: 90691105 markings, 139059675 edges, 331732 markings/sec, 115 secs
lola: 90691187 markings, 139059792 edges, 16 markings/sec, 120 secs
lola: 90691280 markings, 139059931 edges, 19 markings/sec, 125 secs
lola: 91210355 markings, 139855849 edges, 103815 markings/sec, 130 secs
lola: 93229079 markings, 142951224 edges, 403745 markings/sec, 135 secs
lola: 93229823 markings, 142952361 edges, 149 markings/sec, 140 secs
lola: 93229823 markings, 142952361 edges, 0 markings/sec, 145 secs
lola: 93229823 markings, 142952361 edges, 0 markings/sec, 150 secs
lola: 93229823 markings, 142952361 edges, 0 markings/sec, 155 secs
lola: 93534003 markings, 143418767 edges, 60836 markings/sec, 160 secs
lola: 94470261 markings, 144854381 edges, 187252 markings/sec, 165 secs
lola: 94470261 markings, 144854381 edges, 0 markings/sec, 170 secs
lola: 94470585 markings, 144854880 edges, 65 markings/sec, 175 secs
lola: 95175283 markings, 145935409 edges, 140940 markings/sec, 180 secs
lola: 95175283 markings, 145935409 edges, 0 markings/sec, 185 secs
lola: 95175283 markings, 145935409 edges, 0 markings/sec, 190 secs
lola: 95175283 markings, 145935409 edges, 0 markings/sec, 195 secs
lola: 95175331 markings, 145935486 edges, 10 markings/sec, 200 secs
lola: 96484097 markings, 147942266 edges, 261753 markings/sec, 205 secs
lola: 96484097 markings, 147942266 edges, 0 markings/sec, 210 secs
lola: 96484097 markings, 147942266 edges, 0 markings/sec, 215 secs
lola: 96484097 markings, 147942266 edges, 0 markings/sec, 220 secs
lola: 96484841 markings, 147943409 edges, 149 markings/sec, 225 secs
lola: 97460062 markings, 149438734 edges, 195044 markings/sec, 230 secs
lola: 97460062 markings, 149438734 edges, 0 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)) AND (p50 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p26) AND (1 <= p27) AND (1 <= p29)) OR (1 <= p50))
lola: processed formula length: 59
lola: 34 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p26) AND (1 <= p27) AND (1 <= p29)) OR (1 <= p50))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)) AND (p50 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-1.sara
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-1.sara.
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4889969 markings, 7497926 edges, 977994 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 10006003 markings, 15342509 edges, 1023207 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 15189951 markings, 23291237 edges, 1036790 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 20033613 markings, 30718173 edges, 968732 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 24752438 markings, 37953707 edges, 943765 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 29536518 markings, 45289300 edges, 956816 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 34371792 markings, 52703384 edges, 967055 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 39190715 markings, 60092412 edges, 963785 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 43723229 markings, 67042259 edges, 906503 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 48363589 markings, 74157484 edges, 928072 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 53230890 markings, 81620666 edges, 973460 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 57807623 markings, 88638323 edges, 915347 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 62197097 markings, 95368848 edges, 877895 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 66693061 markings, 102262675 edges, 899193 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 71203491 markings, 109178666 edges, 902086 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 75633235 markings, 115970934 edges, 885949 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 80125659 markings, 122859315 edges, 898485 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 84745070 markings, 129942401 edges, 923882 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 89313655 markings, 136947564 edges, 913717 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 93713224 markings, 143693580 edges, 879914 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 97389445 markings, 149330457 edges, 735244 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 100808920 markings, 154573656 edges, 683895 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 104959821 markings, 160938361 edges, 830180 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 107976449 markings, 165563858 edges, 603326 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 111325274 markings, 170698725 edges, 669765 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 113471642 markings, 173989820 edges, 429274 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 116493020 markings, 178622592 edges, 604276 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 607 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p37) OR (1 <= p47)) U (E (G ((1 <= p20))) AND (p38 <= 0))))
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:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
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: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: (((p37 <= 0) AND (p47 <= 0)) R (F ((p20 <= 0)) OR (1 <= p38)))
lola: processed formula length: 62
lola: 41 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: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 120815 markings, 232297 edges
lola: ========================================
lola: subprocess 13 will run for 809 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (((1 <= p55) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39)))) OR (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
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 ((((1 <= p55) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39))) OR (1 <= p7)))
lola: processed formula length: 76
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 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 universal single path CTL formula does not hold.
lola: 4331 markings, 8172 edges
lola: ========================================
lola: subprocess 14 will run for 1214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p31) AND (1 <= p32) AND (1 <= p34)))) OR ((1 <= p77) AND (A (F (((1 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9)))) AND (E (F ((1 <= p5))) OR ((p21 <= 0) OR ((p22 <= 0) OR ((p24 <= 0) OR ((1 <= p27) AND (1 <= p66) AND (1 <= p67) AND (1 <= p69)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p21 <= 0) OR ((p22 <= 0) OR ((p24 <= 0) OR ((1 <= p27) AND (1 <= p66) AND (1 <= p67) AND (1 <= p69)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p21 <= 0) OR (p22 <= 0) OR (p24 <= 0) OR ((1 <= p27) AND (1 <= p66) AND (1 <= p67) AND (1 <= p69)))
lola: processed formula length: 101
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p77)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p77)
lola: processed formula length: 10
lola: 30 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: 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 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9))))
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: ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))
lola: processed formula length: 84
lola: 33 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: formula 0: ((1 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9))
lola: state equation task get result unparse finished id 0
lola: The predicate does not eventually occur.
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p42 <= 0) R (p45 <= 0))) AND (A (G ((1 <= p22))) AND (A ((((1 <= p0) AND (1 <= p76) AND (1 <= p77)) U ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) OR E (F (((1 <= p46) AND (1 <= p47) AND (1 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p46) AND (1 <= p47) AND (1 <= p49))))
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 <= p46) AND (1 <= p47) AND (1 <= p49))))
lola: processed formula length: 50
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((1 <= p46) AND (1 <= p47) AND (1 <= p49))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 8 markings, 7 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 (((p42 <= 0) R (p45 <= 0)))
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 (((p42 <= 0) R (p45 <= 0)))
lola: processed formula length: 29
lola: 33 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: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 <= p45)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (A (F (((1 <= p22) OR ((1 <= p71) AND (1 <= p72) AND (1 <= p74))))))) OR E ((E (X ((1 <= p63))) U ((p42 <= 0) AND (p22 <= 0)))))
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: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (AG(AF(((1 <= p22) OR ((1 <= p71) AND (1 <= p72) AND (1 <= p74))))) OR E(EX((1 <= p63)) U ((p42 <= 0) AND (p22 <= 0))))
lola: processed formula length: 120
lola: 34 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: 3332051 markings, 8441166 edges, 666410 markings/sec, 0 secs
lola: 6495433 markings, 16455069 edges, 632676 markings/sec, 5 secs
lola: 9646003 markings, 24436504 edges, 630114 markings/sec, 10 secs
lola: 12795338 markings, 32414832 edges, 629867 markings/sec, 15 secs
lola: 15996489 markings, 40524412 edges, 640230 markings/sec, 20 secs
lola: 18862100 markings, 47783962 edges, 573122 markings/sec, 25 secs
lola: 21502107 markings, 54471980 edges, 528001 markings/sec, 30 secs
lola: 24160001 markings, 61205307 edges, 531579 markings/sec, 35 secs
lola: 26807962 markings, 67913473 edges, 529592 markings/sec, 40 secs
lola: 29504552 markings, 74744847 edges, 539318 markings/sec, 45 secs
lola: 32276767 markings, 81767788 edges, 554443 markings/sec, 50 secs
lola: 35242617 markings, 89281278 edges, 593170 markings/sec, 55 secs
lola: 38302917 markings, 97034030 edges, 612060 markings/sec, 60 secs
lola: 41455637 markings, 105020918 edges, 630544 markings/sec, 65 secs
lola: 44459013 markings, 112629482 edges, 600675 markings/sec, 70 secs
lola: 47672091 markings, 120769262 edges, 642616 markings/sec, 75 secs
lola: 50773056 markings, 128625050 edges, 620193 markings/sec, 80 secs
lola: 53410766 markings, 135307237 edges, 527542 markings/sec, 85 secs
lola: 56148593 markings, 142243072 edges, 547565 markings/sec, 90 secs
lola: 58731133 markings, 148785518 edges, 516508 markings/sec, 95 secs
lola: 61368519 markings, 155466888 edges, 527477 markings/sec, 100 secs
lola: 63978069 markings, 162077750 edges, 521910 markings/sec, 105 secs
lola: 66657675 markings, 168866084 edges, 535921 markings/sec, 110 secs
lola: 69796561 markings, 176817924 edges, 627777 markings/sec, 115 secs
lola: 72792468 markings, 184407554 edges, 599181 markings/sec, 120 secs
lola: 75669527 markings, 191696115 edges, 575412 markings/sec, 125 secs
lola: 78606635 markings, 199136767 edges, 587422 markings/sec, 130 secs
lola: 81193855 markings, 205693053 edges, 517444 markings/sec, 135 secs
lola: 83797812 markings, 212287873 edges, 520791 markings/sec, 140 secs
lola: 86330236 markings, 218703751 edges, 506485 markings/sec, 145 secs
lola: 88439599 markings, 224046952 edges, 421873 markings/sec, 150 secs
lola: 90328412 markings, 228831948 edges, 377763 markings/sec, 155 secs
lola: 90422154 markings, 229069432 edges, 18748 markings/sec, 160 secs
lola: 90967412 markings, 230450743 edges, 109052 markings/sec, 165 secs
lola: 92320232 markings, 233877895 edges, 270564 markings/sec, 170 secs
lola: 94287333 markings, 238861219 edges, 393420 markings/sec, 175 secs
lola: 95040953 markings, 240770389 edges, 150724 markings/sec, 180 secs
lola: 95040953 markings, 240770389 edges, 0 markings/sec, 185 secs
lola: 95040953 markings, 240770389 edges, 0 markings/sec, 190 secs
lola: 96812893 markings, 245259306 edges, 354388 markings/sec, 195 secs
lola: 97178369 markings, 246185170 edges, 73095 markings/sec, 200 secs
lola: 97179113 markings, 246187057 edges, 149 markings/sec, 205 secs
lola: 98317589 markings, 249071232 edges, 227695 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((E (F (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))) U (A (X ((1 <= p60))) AND (((1 <= p11) AND (1 <= p12) AND (1 <= p14)) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (1 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) U (AX((1 <= p60)) AND (((1 <= p11) AND (1 <= p12) AND (1 <= p14)) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (1 <= p35)))))
lola: processed formula length: 179
lola: 33 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: 2872976 markings, 7278179 edges, 574595 markings/sec, 0 secs
lola: 5701204 markings, 14443022 edges, 565646 markings/sec, 5 secs
lola: 8478633 markings, 21479183 edges, 555486 markings/sec, 10 secs
lola: 11192542 markings, 28354409 edges, 542782 markings/sec, 15 secs
lola: 14010364 markings, 35492897 edges, 563564 markings/sec, 20 secs
lola: 16816496 markings, 42601758 edges, 561226 markings/sec, 25 secs
lola: 19525141 markings, 49463663 edges, 541729 markings/sec, 30 secs
lola: 22251433 markings, 56370267 edges, 545258 markings/sec, 35 secs
lola: 24889123 markings, 63052421 edges, 527538 markings/sec, 40 secs
lola: 27497584 markings, 69660518 edges, 521692 markings/sec, 45 secs
lola: 30154306 markings, 76390893 edges, 531344 markings/sec, 50 secs
lola: 32953462 markings, 83482073 edges, 559831 markings/sec, 55 secs
lola: 35703984 markings, 90450065 edges, 550104 markings/sec, 60 secs
lola: 38473741 markings, 97466779 edges, 553951 markings/sec, 65 secs
lola: 41073811 markings, 104053623 edges, 520014 markings/sec, 70 secs
lola: 43670616 markings, 110632205 edges, 519361 markings/sec, 75 secs
lola: 46355079 markings, 117432835 edges, 536893 markings/sec, 80 secs
lola: 49057769 markings, 124279648 edges, 540538 markings/sec, 85 secs
lola: 51804256 markings, 131237422 edges, 549297 markings/sec, 90 secs
lola: 53877002 markings, 136488415 edges, 414549 markings/sec, 95 secs
lola: 54850034 markings, 138953386 edges, 194606 markings/sec, 100 secs
lola: 56802651 markings, 143900041 edges, 390523 markings/sec, 105 secs
lola: 58986808 markings, 149433388 edges, 436831 markings/sec, 110 secs
lola: 59073526 markings, 149652909 edges, 17344 markings/sec, 115 secs
lola: 59073526 markings, 149652909 edges, 0 markings/sec, 120 secs
lola: 59073526 markings, 149652909 edges, 0 markings/sec, 125 secs
lola: 60930246 markings, 154356599 edges, 371344 markings/sec, 130 secs
lola: 61238620 markings, 155137811 edges, 61675 markings/sec, 135 secs
lola: 62405323 markings, 158093458 edges, 233341 markings/sec, 140 secs
lola: 62502342 markings, 158339243 edges, 19404 markings/sec, 145 secs
lola: 62502342 markings, 158339243 edges, 0 markings/sec, 150 secs
lola: 62912649 markings, 159378691 edges, 82061 markings/sec, 155 secs
lola: 64517180 markings, 163443498 edges, 320906 markings/sec, 160 secs
lola: 66436635 markings, 168306126 edges, 383891 markings/sec, 165 secs
lola: 66518765 markings, 168514172 edges, 16426 markings/sec, 170 secs
lola: 66518765 markings, 168514172 edges, 0 markings/sec, 175 secs
lola: 66518765 markings, 168514172 edges, 0 markings/sec, 180 secs
lola: 66518765 markings, 168514172 edges, 0 markings/sec, 185 secs
lola: 66526246 markings, 168533133 edges, 1496 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p47) OR (E (G ((1 <= p77))) OR ((p58 <= 0) AND (p55 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((1 <= p47) OR (EG((1 <= p77)) OR ((p58 <= 0) AND (p55 <= 0)))))
lola: processed formula length: 67
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: 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: 4260705 markings, 6533064 edges, 852141 markings/sec, 0 secs
lola: 8403864 markings, 12885908 edges, 828632 markings/sec, 5 secs
lola: 12553796 markings, 19249131 edges, 829986 markings/sec, 10 secs
lola: 16777217 markings, 25725057 edges, 844684 markings/sec, 15 secs
lola: 19807591 markings, 30371612 edges, 606075 markings/sec, 20 secs
lola: 23697411 markings, 36336010 edges, 777964 markings/sec, 25 secs
lola: 27572351 markings, 42277583 edges, 774988 markings/sec, 30 secs
lola: 31503456 markings, 48305282 edges, 786221 markings/sec, 35 secs
lola: 35566111 markings, 54534686 edges, 812531 markings/sec, 40 secs
lola: 39520575 markings, 60598189 edges, 790893 markings/sec, 45 secs
lola: 43495908 markings, 66693701 edges, 795067 markings/sec, 50 secs
lola: 47589850 markings, 72971077 edges, 818788 markings/sec, 55 secs
lola: 51660599 markings, 79212885 edges, 814150 markings/sec, 60 secs
lola: 55507522 markings, 85111504 edges, 769385 markings/sec, 65 secs
lola: 59258840 markings, 90863530 edges, 750264 markings/sec, 70 secs
lola: 63033260 markings, 96650974 edges, 754884 markings/sec, 75 secs
lola: 66849236 markings, 102502142 edges, 763195 markings/sec, 80 secs
lola: 70838292 markings, 108618688 edges, 797811 markings/sec, 85 secs
lola: 74827174 markings, 114734977 edges, 797776 markings/sec, 90 secs
lola: 78818792 markings, 120855448 edges, 798324 markings/sec, 95 secs
lola: 79129185 markings, 121331502 edges, 62079 markings/sec, 100 secs
lola: 82144901 markings, 125955483 edges, 603143 markings/sec, 105 secs
lola: 85675467 markings, 131572331 edges, 706113 markings/sec, 110 secs
lola: 88828808 markings, 136204148 edges, 630668 markings/sec, 115 secs
lola: 90338093 markings, 138518376 edges, 301857 markings/sec, 120 secs
lola: 90985168 markings, 139510553 edges, 129415 markings/sec, 125 secs
lola: 92345925 markings, 141597060 edges, 272151 markings/sec, 130 secs
lola: 94435817 markings, 144801562 edges, 417978 markings/sec, 135 secs
lola: 94982167 markings, 145639294 edges, 109270 markings/sec, 140 secs
lola: 94982167 markings, 145639294 edges, 0 markings/sec, 145 secs
lola: 95354856 markings, 146210751 edges, 74538 markings/sec, 150 secs
lola: 97275090 markings, 149155104 edges, 384047 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0)))) OR A (G ((1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0))) OR AG((1 <= p37))))
lola: processed formula length: 70
lola: 33 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: 4550846 markings, 6977940 edges, 910169 markings/sec, 0 secs
lola: 8995375 markings, 13792884 edges, 888906 markings/sec, 5 secs
lola: 13421658 markings, 20579845 edges, 885257 markings/sec, 10 secs
lola: 17833037 markings, 27343964 edges, 882276 markings/sec, 15 secs
lola: 21877767 markings, 33545885 edges, 808946 markings/sec, 20 secs
lola: 25861140 markings, 39653723 edges, 796675 markings/sec, 25 secs
lola: 29769756 markings, 45646949 edges, 781723 markings/sec, 30 secs
lola: 33827194 markings, 51868347 edges, 811488 markings/sec, 35 secs
lola: 38081362 markings, 58391390 edges, 850834 markings/sec, 40 secs
lola: 42232504 markings, 64756481 edges, 830228 markings/sec, 45 secs
lola: 46466426 markings, 71248493 edges, 846784 markings/sec, 50 secs
lola: 50698592 markings, 77737818 edges, 846433 markings/sec, 55 secs
lola: 54616845 markings, 83745802 edges, 783651 markings/sec, 60 secs
lola: 58489090 markings, 89683248 edges, 774449 markings/sec, 65 secs
lola: 62333478 markings, 95577979 edges, 768878 markings/sec, 70 secs
lola: 66252509 markings, 101587148 edges, 783806 markings/sec, 75 secs
lola: 70453443 markings, 108028585 edges, 840187 markings/sec, 80 secs
lola: 74577656 markings, 114352375 edges, 824843 markings/sec, 85 secs
lola: 78725249 markings, 120712022 edges, 829519 markings/sec, 90 secs
lola: 79353564 markings, 121675775 edges, 125663 markings/sec, 95 secs
lola: 83025401 markings, 127306403 edges, 734367 markings/sec, 100 secs
lola: 83099176 markings, 127418713 edges, 14755 markings/sec, 105 secs
lola: 83099176 markings, 127418713 edges, 0 markings/sec, 110 secs
lola: 83099176 markings, 127418713 edges, 0 markings/sec, 115 secs
lola: 83099176 markings, 127418713 edges, 0 markings/sec, 120 secs
lola: 83099176 markings, 127418713 edges, 0 markings/sec, 125 secs
lola: 83099176 markings, 127418713 edges, 0 markings/sec, 130 secs
lola: 84850764 markings, 130104470 edges, 350318 markings/sec, 135 secs
lola: 85204993 markings, 130647638 edges, 70846 markings/sec, 140 secs
lola: 85204993 markings, 130647638 edges, 0 markings/sec, 145 secs
lola: 87354810 markings, 133944411 edges, 429963 markings/sec, 150 secs
lola: 88403142 markings, 135551451 edges, 209666 markings/sec, 155 secs
lola: 88403142 markings, 135551451 edges, 0 markings/sec, 160 secs
lola: 88403142 markings, 135551451 edges, 0 markings/sec, 165 secs
lola: 88531355 markings, 135748050 edges, 25643 markings/sec, 170 secs
lola: 90572403 markings, 138877661 edges, 408210 markings/sec, 175 secs
lola: 90963572 markings, 139477452 edges, 78234 markings/sec, 180 secs
lola: 90963572 markings, 139477452 edges, 0 markings/sec, 185 secs
lola: 92176408 markings, 141337142 edges, 242567 markings/sec, 190 secs
lola: 92422539 markings, 141714540 edges, 49226 markings/sec, 195 secs
lola: 92422539 markings, 141714540 edges, 0 markings/sec, 200 secs
lola: 92422539 markings, 141714540 edges, 0 markings/sec, 205 secs
lola: 92578839 markings, 141954199 edges, 31260 markings/sec, 210 secs
lola: 94537796 markings, 144957935 edges, 391791 markings/sec, 215 secs
lola: 94537796 markings, 144957935 edges, 0 markings/sec, 220 secs
lola: 94537796 markings, 144957935 edges, 0 markings/sec, 225 secs
lola: 94537796 markings, 144957935 edges, 0 markings/sec, 230 secs
lola: 94902958 markings, 145517842 edges, 73032 markings/sec, 235 secs
lola: 96272901 markings, 147618430 edges, 273989 markings/sec, 240 secs
lola: 96272901 markings, 147618430 edges, 0 markings/sec, 245 secs
lola: 96272901 markings, 147618430 edges, 0 markings/sec, 250 secs
lola: 97051648 markings, 148812507 edges, 155749 markings/sec, 255 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)) AND (p50 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p26) AND (1 <= p27) AND (1 <= p29)) OR (1 <= p50))
lola: processed formula length: 59
lola: 34 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)) AND (p50 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p26) AND (1 <= p27) AND (1 <= p29)) OR (1 <= p50))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-20-0.sara
lola: state equation: write sara problem file to CTLFireability-20-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-20-1.sara.
sara: try reading problem file CTLFireability-20-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4967944 markings, 7617491 edges, 993589 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 9827638 markings, 15069014 edges, 971939 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 14778463 markings, 22660292 edges, 990165 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 19638712 markings, 30112663 edges, 972050 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 24246847 markings, 37178479 edges, 921627 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 28785946 markings, 44138422 edges, 907820 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 33469049 markings, 51319184 edges, 936621 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 38101894 markings, 58422884 edges, 926569 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 42571043 markings, 65275571 edges, 893830 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 47121784 markings, 72253367 edges, 910148 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 51764524 markings, 79372238 edges, 928548 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 56284295 markings, 86302554 edges, 903954 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 60683813 markings, 93048496 edges, 879904 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 65175091 markings, 99935122 edges, 898256 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 69765563 markings, 106973840 edges, 918094 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 74204798 markings, 113780668 edges, 887847 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 78608438 markings, 120532907 edges, 880728 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 83127824 markings, 127462628 edges, 903877 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 87620631 markings, 134351604 edges, 898561 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 92004609 markings, 141073714 edges, 876796 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 95886104 markings, 147025326 edges, 776299 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 97381063 markings, 149317601 edges, 298992 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 100684997 markings, 154383641 edges, 660787 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 103257298 markings, 158327823 edges, 514460 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 107083753 markings, 164195069 edges, 765291 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 109226917 markings, 167481246 edges, 428633 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 112070213 markings, 171840965 edges, 568659 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 112070541 markings, 171841461 edges, 66 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 115500085 markings, 177100105 edges, 685909 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 115500797 markings, 177101194 edges, 142 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 115500797 markings, 177101194 edges, 0 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 116488036 markings, 178614953 edges, 197448 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p31) AND (1 <= p32) AND (1 <= p34)))) OR ((1 <= p77) AND (A (F (((1 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9)))) AND (E (F ((1 <= p5))) OR ((p21 <= 0) OR ((p22 <= 0) OR ((p24 <= 0) OR ((1 <= p27) AND (1 <= p66) AND (1 <= p67) AND (1 <= p69)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p21 <= 0) OR ((p22 <= 0) OR ((p24 <= 0) OR ((1 <= p27) AND (1 <= p66) AND (1 <= p67) AND (1 <= p69)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p21 <= 0) OR (p22 <= 0) OR (p24 <= 0) OR ((1 <= p27) AND (1 <= p66) AND (1 <= p67) AND (1 <= p69)))
lola: processed formula length: 101
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (1 <= p77)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p77)
lola: processed formula length: 10
lola: 30 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: ========================================
lola: ...considering subproblem: E (F (((1 <= p31) AND (1 <= p32) AND (1 <= p34))))
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 <= p31) AND (1 <= p32) AND (1 <= p34))))
lola: processed formula length: 50
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((1 <= p31) AND (1 <= p32) AND (1 <= p34))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (((p42 <= 0) R (p45 <= 0))) AND (A (G ((1 <= p22))) AND (A ((((1 <= p0) AND (1 <= p76) AND (1 <= p77)) U ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) OR E (F (((1 <= p46) AND (1 <= p47) AND (1 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p46) AND (1 <= p47) AND (1 <= p49))))
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 <= p46) AND (1 <= p47) AND (1 <= p49))))
lola: processed formula length: 50
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((1 <= p46) AND (1 <= p47) AND (1 <= p49))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: 8 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p22)))
lola: processed formula length: 18
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p22 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-23-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no yes unknown unknown yes yes unknown yes yes unknown no no yes no
lola:
preliminary result: no unknown no yes unknown unknown yes yes unknown yes yes unknown no no yes no
sara: try reading problem file CTLFireability-23-0.sara.
sara: place or transition ordering is non-deterministic

lola: memory consumption: 3704 KB
lola: time consumption: 2443 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="RefineWMG-PT-015015"
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 RefineWMG-PT-015015, 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 r186-oct2-158987938500068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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